7 citations · 11 across the 7 of their papers we have counts for
4 papers · 1 filter
On Connected Strongly-Proportional Cake-Cutting
Zsuzsanna Jankó, Attila Joó, Erel Segal-Halevi +1
We investigate the problem of fairly dividing a divisible heterogeneous resource, also known as a cake, among a set of agents who may have different entitlements. We characterize t…
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…
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…
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…