58 citations · 867 across the 88 of their papers we have counts for
8 papers · 1 filter
Reachability of Fair Allocations via Sequential Exchanges
Ayumi Igarashi, Naoyuki Kamiyama, Warut Suksompong +1
In the allocation of indivisible goods, a prominent fairness notion is envy-freeness up to one good (EF1). We initiate the study of reachability problems in fair division by invest…
Settling the Score: Portioning with Cardinal Preferences
Edith Elkind, Matthias Greger, Patrick Lederer +2
We study a portioning setting in which a public resource such as time or money is to be divided among a given set of candidates, and each agent proposes a division of the resource.…
Coordinating Charitable Donations with Leontief Preferences
Felix Brandt, Matthias Greger, Erel Segal-Halevi +1
We consider the problem of funding public goods that are complementary in nature. Examples include charities handling different needs (e.g., protecting animals vs. providing health…
Approximate Envy-Freeness in Graphical Cake Cutting
Sheung Man Yuen, Warut Suksompong
We study the problem of fairly allocating a divisible resource in the form of a graph, also known as graphical cake cutting. Unlike for the canonical interval cake, a connected env…
On Maximum Bipartite Matching with Separation
Pasin Manurangsi, Erel Segal-Halevi, Warut Suksompong
Maximum bipartite matching is a fundamental algorithmic problem which can be solved in polynomial time. We consider a natural variant in which there is a separation constraint: the…
Weighted Fair Division with Matroid-Rank Valuations: Monotonicity and Strategyproofness
Warut Suksompong, Nicholas Teh
We study the problem of fairly allocating indivisible goods to agents with weights corresponding to their entitlements. Previous work has shown that, when agents have binary additi…
Extending the Characterization of Maximum Nash Welfare
Sheung Man Yuen, Warut Suksompong
In the allocation of indivisible goods, the maximum Nash welfare rule has recently been characterized as the only rule within the class of additive welfarist rules that satisfies e…
Cutting a Cake Fairly for Groups Revisited
Erel Segal-Halevi, Warut Suksompong
Cake cutting is a classic fair division problem, with the cake serving as a metaphor for a heterogeneous divisible resource. Recently, it was shown that for any number of players w…