[HTML][HTML] Fair division of indivisible goods: Recent progress and open questions
Allocating resources to individuals in a fair manner has been a topic of interest since ancient
times, with most of the early mathematical work on the problem focusing on resources that …
times, with most of the early mathematical work on the problem focusing on resources that …
A survey of self-organization mechanisms in multiagent systems
D Ye, M Zhang, AV Vasilakos - IEEE Transactions on Systems …, 2016 - ieeexplore.ieee.org
This paper surveys the literature over the last decades in the field of self-organizing
multiagent systems. Self-organization has been extensively studied and applied in …
multiagent systems. Self-organization has been extensively studied and applied in …
Fair division of indivisible goods: A survey
Allocating resources to individuals in a fair manner has been a topic of interest since the
ancient times, with most of the early rigorous mathematical work on the problem focusing on …
ancient times, with most of the early rigorous mathematical work on the problem focusing on …
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 …
Beyond dominant resource fairness: Extensions, limitations, and indivisibilities
We study the problem of allocating multiple resources to agents with heterogeneous
demands. Technological advances such as cloud computing and data centers provide a …
demands. Technological advances such as cloud computing and data centers provide a …
Multi-resource fair allocation in heterogeneous cloud computing systems
We study the multi-resource allocation problem in cloud computing systems where the
resource pool is constructed from a large number of heterogeneous servers, representing …
resource pool is constructed from a large number of heterogeneous servers, representing …
[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 …
Dominant resource fairness in cloud computing systems with heterogeneous servers
We study the multi-resource allocation problem in cloud computing systems where the
resource pool is constructed from a large number of heterogeneous servers, representing …
resource pool is constructed from a large number of heterogeneous servers, representing …
Online fair division: Analysing a food bank problem
We study an online model of fair division designed to capture features of a real world charity
problem. We consider two simple mechanisms for this model in which agents simply declare …
problem. We consider two simple mechanisms for this model in which agents simply declare …
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 …