activity
20112026
most citedWeighted Envy-Freeness in Indivisible Item Allocation

58 citations · 867 across the 88 of their papers we have counts for

collaborators
Showing 2018Show all

8 papers · 1 filter

cs.GT2018★ 14 cited

When Do Envy-Free Allocations Exist?

Pasin Manurangsi, Warut Suksompong

We consider a fair division setting in which indivisible items are to be allocated among agents, where the agents have additive utilities and the agents' utilities for indi…

cs.GT2018★ 10 cited

Fairly Allocating Many Goods with Few Queries

Hoon Oh, Ariel D. Procaccia, Warut Suksompong

We investigate the query complexity of the fair allocation of indivisible goods. For two agents with arbitrary monotonic utilities, we design an algorithm that computes an allocati…

cs.GT2018★ 17 cited

Asymptotic Existence of Proportionally Fair Allocations

Warut Suksompong

Fair division has long been an important problem in the economics literature. In this note, we consider the existence of proportionally fair allocations of indivisible goods, i.e.,…

cs.DC2018★ 7 cited

On the Efficiency of Localized Work Stealing

Warut Suksompong, Charles E. Leiserson, Tao B. Schardl

This paper investigates a variant of the work-stealing algorithm that we call the localized work-stealing algorithm. The intuition behind this variant is that because of locality,…

math.CO2018★ 30 cited

Scheduling Asynchronous Round-Robin Tournaments

Warut Suksompong

We study the problem of scheduling asynchronous round-robin tournaments. We consider three measures of a schedule that concern the quality and fairness of a tournament. We show tha…

cs.GT2018★ 11 cited

Individual and Group Stability in Neutral Restrictions of Hedonic Games

Warut Suksompong

We consider a class of coalition formation games called hedonic games, i.e., games in which the utility of a player is completely determined by the coalition that the player belong…

cs.GT2018★ 12 cited

Truthful Fair Division without Free Disposal

Xiaohui Bei, Guangda Huzhang, Warut Suksompong

We study the problem of fairly dividing a heterogeneous resource, commonly known as cake cutting and chore division, in the presence of strategic agents. While a number of results…

cs.GT2018★ 13 cited

Robust Bounds on Choosing from Large Tournaments

Christian Saile, Warut Suksompong

Tournament solutions provide methods for selecting the "best" alternatives from a tournament and have found applications in a wide range of areas. Previous work has shown that seve…