58 citations · 867 across the 88 of their papers we have counts for
9 papers · 1 filter
Democratic Fair Allocation of Indivisible Goods
Erel Segal-Halevi, Warut Suksompong
We study the problem of fairly allocating indivisible goods to groups of agents. Agents in the same group share the same set of goods even though they may have different preference…
Asymptotic Existence of Fair Divisions for Groups
Pasin Manurangsi, Warut Suksompong
The problem of dividing resources fairly occurs in many practical situations and is therefore an important topic of study in economics. In this paper, we investigate envy-free divi…
On Black-Box Transformations in Downward-Closed Environments
Warut Suksompong
Black-box transformations have been extensively studied in algorithmic mechanism design as a generic tool for converting algorithms into truthful mechanisms without degrading the a…
Fairly Allocating Contiguous Blocks of Indivisible Items
Warut Suksompong
In this paper, we study the classic problem of fairly allocating indivisible items with the extra feature that the items lie on a line. Our goal is to find a fair allocation that i…
Upper Bounds on Number of Steals in Rooted Trees
Charles E. Leiserson, Tao B. Schardl, Warut Suksompong
Inspired by applications in parallel computing, we analyze the setting of work stealing in multithreaded computations. We obtain tight upper bounds on the number of steals when the…
Approximate Maximin Shares for Groups of Agents
Warut Suksompong
We investigate the problem of fairly allocating indivisible goods among interested agents using the concept of maximin share. Procaccia and Wang showed that while an allocation tha…
Simple Pricing Schemes for the Cloud
Ian A. Kash, Peter Key, Warut Suksompong
The problem of pricing the cloud has attracted much recent attention due to the widespread use of cloud computing and cloud services. From a theoretical perspective, several mechan…
Pricing Multi-Unit Markets
Tomer Ezra, Michal Feldman, Tim Roughgarden +1
We study the power and limitations of posted prices in multi-unit markets, where agents arrive sequentially in an arbitrary order. We prove upper and lower bounds on the largest fr…
Computing an Approximately Optimal Agreeable Set of Items
Pasin Manurangsi, Warut Suksompong
We study the problem of finding a small subset of items that is \emph{agreeable} to all agents, meaning that all agents value the subset at least as much as its complement. Previou…