Envy-free two-player m-cake and three-player two-cake divisions
Year of publication: |
2013
|
---|---|
Authors: | Lebert, Nicolas ; Meunier, Frédéric ; Carbonneaux, Quentin |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 41.2013, 6, p. 607-610
|
Subject: | Fair division | Envy-free | Matching | m-partite hypergraph | Polytope | Sperner's lemma | Gerechtigkeit | Justice | Spieltheorie | Game theory | Allokation | Allocation |
-
The unreasonable fairness of maximum nash welfare
Caragiannis, Ioannis, (2016)
-
Population monotonicity in fair division of multiple indivisible goods
Doğan, Emre, (2021)
-
Trudeau, Christian, (2018)
- More ...
-
Discrete splittings of the necklace
Meunier, Frédéric, (2008)
-
Gevigney, Oliver Durand de, (2011)
-
Computing solutions of the paintshop-necklace problem
Meunier, Frédéric, (2012)
- More ...