ML Anthology

Online Fair Division: Analysing a Food Bank Problem

Martin Aleksandrov, Haris Aziz, Serge Gaspers, Toby Walsh
IJCAI 2015 pp. 2540-2546
/ijcai/2015/aleksandrov2015ijcai-online-a/

Abstract

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 what items they like. We analyse axiomatic properties of these mechanisms such as strategy-proofness and envy freeness. Finally, we perform a competitive analysis and compute the price of anarchy.

PDF IJCAI Semantic Scholar

Cite

Text

Aleksandrov et al. "Online Fair Division: Analysing a Food Bank Problem." International Joint Conference on Artificial Intelligence, 2015.

Markdown

[Aleksandrov et al. "Online Fair Division: Analysing a Food Bank Problem." International Joint Conference on Artificial Intelligence, 2015.](https://mlanthology.org/ijcai/2015/aleksandrov2015ijcai-online-a/)

BibTeX

@inproceedings{aleksandrov2015ijcai-online-a,
  title     = {{Online Fair Division: Analysing a Food Bank Problem}},
  author    = {Aleksandrov, Martin and Aziz, Haris and Gaspers, Serge and Walsh, Toby},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2015},
  pages     = {2540-2546},
  url       = {https://mlanthology.org/ijcai/2015/aleksandrov2015ijcai-online-a/}
}