Skip to Main content Skip to Navigation
Conference papers

Efficiency, Sequenceability and Deal-Optimality in Fair Division of Indivisible Goods

Abstract : In fair division of indivisible goods, using sequences of sincere choices (or picking sequences) is a natural way to allocate the objects. The idea is as follows: at each stage, a designated agent picks one object among those that remain. Another intuitive way to obtain an allocation is to give objects to agents in the first place, and to let agents exchange them as long as such "deals" are beneficial. This paper investigates these notions, when agents have additive preferences over objects, and unveils surprising connections between them, and with other efficiency and fairness notions. In particular, we show that an allocation is sequenceable if and only if it is optimal for a certain type of deals, namely cycle deals involving a single object. Furthermore, any Pareto-optimal allocation is sequenceable, but not the converse. Regarding fairness, we show that an allocation can be envy-free and non-sequenceable, but that every competitive equilibrium with equal incomes is sequenceable. To complete the picture, we show how some domain restrictions may affect the relations between these notions. Finally, we experimentally explore the links between the scales of efficiency and fairness.
Document type :
Conference papers
Complete list of metadatas

Cited literature [41 references]  Display  Hide  Download
Contributor : Nicolas Maudet <>
Submitted on : Friday, May 17, 2019 - 2:43:42 PM
Last modification on : Thursday, November 19, 2020 - 2:46:07 PM


Files produced by the author(s)


  • HAL Id : hal-02132742, version 1


Aurélie Beynier, Sylvain Bouveret, Michel Lemaître, Nicolas Maudet, Simon Rey, et al.. Efficiency, Sequenceability and Deal-Optimality in Fair Division of Indivisible Goods. 18th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2019), May 2019, Montreal, Canada. ⟨hal-02132742⟩



Record views


Files downloads