Efficiency and envy-freeness in fair division of indivisible goods: logical representation and complexity
Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence. Pages 935-939.
Abstract
We study fair division of indivisible goods among agents from the point of view of compact representation and computational complexity. We identify the complexity of several problems, including that of deciding whether there exists an efficient and envy-free allocation when preferences are represented in a succinct way. We also draw connections to nonmonotonic reasoning.
Sylvain Bouveret, and Jérôme Lang. 2005. Efficiency and envy-freeness in fair division of indivisible goods: logical representation and complexity. In Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, IJCAI-05. IJCAI, 935–939. https://ijcai.org/proceedings/2005/60
Bouveret, S., & Lang, J. (2005). Efficiency and envy-freeness in fair division of indivisible goods: logical representation and complexity. In Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, IJCAI-05 (pp. 935–939). IJCAI. https://ijcai.org/proceedings/2005/60
@inproceedings{ijcai2005p60,
title = {Efficiency and envy-freeness in fair division of indivisible goods: logical representation and complexity},
author = {Bouveret, Sylvain and Lang, Jérôme},
booktitle = {Proceedings of the Nineteenth International Joint Conference on
Artificial Intelligence, {IJCAI-05}},
publisher = {International Joint Conferences on Artificial Intelligence},
pages = {935--939},
year = {2005},
url = {https://ijcai.org/proceedings/2005/60},
}
TY - CPAPER TI - Efficiency and envy-freeness in fair division of indivisible goods: logical representation and complexity AU - Bouveret, Sylvain AU - Lang, Jérôme T2 - Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, IJCAI-05 PB - International Joint Conferences on Artificial Intelligence PY - 2005 SP - 935 EP - 939 UR - https://ijcai.org/proceedings/2005/60 ER -Copied
Machine-readable versions of this paper, for tools and AI agents: