Online Fair Division: analysing a Food Bank problem
Computer Science and Game Theory
2015-03-03 v2 Artificial Intelligence
Multiagent Systems
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 several axiomatic properties of these mechanisms like strategy-proofness and envy-freeness. Finally, we perform a competitive analysis and compute the price of anarchy.
Keywords
Cite
@article{arxiv.1502.07571,
title = {Online Fair Division: analysing a Food Bank problem},
author = {Martin Aleksandrov and Haris Aziz and Serge Gaspers and Toby Walsh},
journal= {arXiv preprint arXiv:1502.07571},
year = {2015}
}
Comments
7 pages, 2 figures, 1 table