7 citations · 11 across the 7 of their papers we have counts for
5 papers · 1 filter
Comparing the Fairness of Recursively Balanced Picking Sequences
Karen Frilya Celine, Warut Suksompong, Sheung Man Yuen
Picking sequences are well-established methods for allocating indivisible goods. Among the various picking sequences, recursively balanced picking sequences -- whereby each agent p…
Reforming an Unfair Allocation by Exchanging Goods
Sheung Man Yuen, Ayumi Igarashi, Naoyuki Kamiyama +1
Fairly allocating indivisible goods is a frequently occurring task in everyday life. Given an initial allocation of the goods, we consider the problem of reforming it via a sequenc…
On the Fairness of Additive Welfarist Rules
Karen Frilya Celine, Warut Suksompong, Sheung Man Yuen
Allocating indivisible goods is a ubiquitous task in fair division. We study additive welfarist rules, an important class of rules which choose an allocation that maximizes the sum…
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…