21 papers
Individual Fairness in Budget Aggregation
Xiaohui Bei, Felix Brandt, Matthias Greger +3
We consider the problem of aggregating individual distributions over alternatives into a collective distribution, also known as budget aggregation. Existing fairness notion…
Fair Division with Binary Valuations: Characterizations
Florian Brandl, Warut Suksompong, Nicholas Teh
We consider the fair allocation of indivisible goods with binary valuations. In this setting, the maximum Nash welfare rule, the leximin rule, and all additive welfarist rules with…
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…
Optimizing the Envy Cycle Elimination Algorithm
Karen Frilya Celine, Warut Suksompong
In the fair allocation of indivisible goods, a widely used notion of fairness is envy-freeness up to one good (EF1). A classical way to compute an EF1 allocation is the envy cycle…
Envy-Free Allocation of Indivisible Goods via Noisy Queries
Zihan Li, Yan Hao Ling, Jonathan Scarlett +1
We introduce a problem of fairly allocating indivisible goods (items) in which the agents' valuations cannot be observed directly, but instead can only be accessed via noisy querie…
Decomposition Envy-Freeness in Random Assignment
Yasushi Kawase, Warut Suksompong, Hanna Sumita +1
In random assignment, fairness is often captured by stochastic-dominance envy-freeness (SD-EF). We observe that assignments satisfying SD-EF may admit decompositions that result in…