Affiliation:
1. UNSW Sydney
2. The Hong Kong Polytechnic University
3. University of Glasgow
4. University of Macau
Abstract
The theory of algorithmic fair allocation is at the center of multi-agent systems and economics in recent decades due to its industrial and social importance. At a high level, the problem is to assign a set of items that are either goods or chores to a set of agents so that every agent is happy with what she obtains. In this survey, we focus on indivisible items, for which exact fairness as measured by envy-freeness and proportionality cannot be guaranteed. One main theme in the recent research agenda is designing algorithms that approximately achieve fairness criteria. We aim at presenting a comprehensive survey of recent progress through the prism of algorithms, highlighting the ways to relax fairness notions and common techniques to design algorithms, as well as the most interesting questions for future research.
Publisher
Association for Computing Machinery (ACM)
Subject
Geriatrics and Gerontology
Reference100 articles.
1. Online Fair Division: A Survey
2. Georgios Amanatidis , Georgios Birmpas , and Evangelos Markakis . On truthful mechanisms for maximin share allocations . In IJCAI , pages 31 -- 37 , 2016 . Georgios Amanatidis, Georgios Birmpas, and Evangelos Markakis. On truthful mechanisms for maximin share allocations. In IJCAI, pages 31--37, 2016.
3. Truthful Allocation Mechanisms Without Payments
4. Approximation Algorithms for Computing Maximin Share Allocations
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献