Envy-free division using mapping degree

S. Avvakumov, R. Karasev, (n.d.).

Preprint | Submitted | English
In this paper we study envy-free division problems. The classical approach to some of such problems, used by David Gale, reduces to considering continuous maps of a simplex to itself and finding sufficient conditions when this map hits the center of the simplex. The mere continuity is not sufficient for such a conclusion, the usual assumption (for example, in the Knaster--Kuratowski--Mazurkiewicz and the Gale theorem) is a certain boundary condition. We follow Erel Segal-Halevi, Fr\'ed\'eric Meunier, and Shira Zerbib, and replace the boundary condition by another assumption, which has the economic meaning of possibility for a player to prefer an empty part in the segment partition problem. We solve the problem positively when $n$, the number of players that divide the segment, is a prime power, and we provide counterexamples for every $n$ which is not a prime power. We also provide counterexamples relevant to a wider class of fair or envy-free partition problems when $n$ is odd and not a prime power.
Publishing Year
Date Published
Article Number

Cite this

Avvakumov S, Karasev R. Envy-free division using mapping degree.
Avvakumov, S., & Karasev, R. (n.d.). Envy-free division using mapping degree. arXiv.
Avvakumov, Sergey, and Roman Karasev. “Envy-Free Division Using Mapping Degree.” arXiv, n.d.
S. Avvakumov and R. Karasev, “Envy-free division using mapping degree.” arXiv.
Avvakumov S, Karasev R. Envy-free division using mapping degree.
Avvakumov, Sergey, and Roman Karasev. Envy-Free Division Using Mapping Degree. 1907.11183, arXiv.
All files available under the following license(s):
Copyright Statement:
This Item is protected by copyright and/or related rights. [...]

Link(s) to Main File(s)
Access Level
OA Open Access
Material in IST:
Dissertation containing IST record


Marked Publications

Open Data IST Research Explorer


arXiv 1907.11183

Search this title in

Google Scholar