Cooperative envy-free division
From MaRDI portal
Publication:6425544
arXiv2302.02701MaRDI QIDQ6425544FDOQ6425544
Duško Jojić, Rade Živaljević, G. Panina
Publication date: 6 February 2023
Abstract: Relying on configuration spaces and equivariant topology, we study a general "cooperative envy-free division problem". A group of players want to cut a "cake" and divide among themselves the pieces in an envy-free manner. Once the cake is cut and served in plates on a round table (at most one piece per plate), each player makes her choice by pointing at one (or several) plates she prefers. The novelty is that her choice may depend on the whole "allocation configuration". In particular, a player may choose an empty plate (possibly preferring one of the empty plates over the other), and take into account not only the content of her preferred plate, but also the content of the neighbouring plates. We show that if the number of players is a prime power, in this setting an envy-free division exists under standard assumptions that the preferences are closed.
Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Combinatorial aspects of simplicial complexes (05E45) Discrete geometry (52C99) Fixed points and coincidences in algebraic topology (55M20)
This page was built for publication: Cooperative envy-free division
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6425544)
