On approximately fair allocations of indivisible goods
We study the problem of fairly allocating a set of indivisible goods to a set of people from an
algorithmic perspective. fair division has been a central topic in the economic literature and …
algorithmic perspective. fair division has been a central topic in the economic literature and …
Fair enough: Guaranteeing approximate maximin shares
D Kurokawa, AD Procaccia, J Wang - Journal of the ACM (JACM), 2018 - dl.acm.org
We consider the problem of fairly allocating indivisible goods, focusing on a recently
introduced notion of fairness called maximin share guarantee: each player's value for his …
introduced notion of fairness called maximin share guarantee: each player's value for his …
A discrete and bounded envy-free cake cutting protocol for any number of agents
H Aziz, S Mackenzie - 2016 IEEE 57th Annual Symposium on …, 2016 - ieeexplore.ieee.org
We consider the well-studied cake cutting problem in which the goal is to find an envy-free
allocation based on queries from n agents. The problem has received attention in computer …
allocation based on queries from n agents. The problem has received attention in computer …
Truth, justice, and cake cutting
Cake cutting is a common metaphor for the division of a heterogeneous divisible good.
There are numerous papers that study the problem of fairly dividing a cake; a small number …
There are numerous papers that study the problem of fairly dividing a cake; a small number …
Fair enough: Guaranteeing approximate maximin shares
AD Procaccia, J Wang - Proceedings of the fifteenth ACM conference on …, 2014 - dl.acm.org
We consider the problem of fairly allocating indivisible goods, focusing on a recently-
introduced notion of fairness called maximin share guarantee: Each player's value for his …
introduced notion of fairness called maximin share guarantee: Each player's value for his …
The efficiency of fair division
In this paper we study the impact of fairness on the efficiency of allocations. We consider
three different notions of fairness, namely proportionality, envy-freeness, and equitability for …
three different notions of fairness, namely proportionality, envy-freeness, and equitability for …
[PDF][PDF] Cake cutting algorithms
AD Procaccia - 2016 - kilthub.cmu.edu
Imagine a cake that must be divided between a group of gluttonous children. To complicate
matters, the cake is heterogeneous: two pieces of cake may differ in terms of their toppings …
matters, the cake is heterogeneous: two pieces of cake may differ in terms of their toppings …
Cake cutting: Not just child's play
AD Procaccia - Communications of the ACM, 2013 - dl.acm.org
Cake cutting Page 1 78 CommuniCations of thE aCm | july 2013 | vol. 56 | no. 7 contributed
articles addressing some of the great challenges of the 21st century involves a thorough …
articles addressing some of the great challenges of the 21st century involves a thorough …
[图书][B] Economics and computation
J Rothe - 2015 - Springer
1 Her work has been supported in part by an NRW grant for gender-sensitive universities
supporting her as a junior professor for Computational Social Choice and by the project …
supporting her as a junior professor for Computational Social Choice and by the project …
Fair allocation of indivisible goods to asymmetric agents
We study fair allocation of indivisible goods to agents with unequal entitlements. Fair
allocation has been the subject of many studies in both divisible and indivisible settings. Our …
allocation has been the subject of many studies in both divisible and indivisible settings. Our …