ENVY‐FREE DIVISION USING MAPPING DEGREE

DOI10.1112/MTK.12059MaRDI QIDQ6072663zbMATH OpenOpenAlexFDO

Authors Sergey Avvakumov, Roman Karasev

Publication date 15 September 2023

Published in Mathematika (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1907.11183

Mathematics Subject Classification ID

Metric geometry (51F99) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Fixed points and coincidences in algebraic topology (55M20) Finite groups of transformations in algebraic topology (including Smith theory) (55M35)

Abstract: In this paper we study envy-free division problems. The classical approach to such problems, used by David Gale, reduces to considering continuous maps of a simplex to itself and finding sufficient conditions for this map to hit the center of the simplex. The mere continuity of the map is not sufficient for reaching such a conclusion. Classically, one makes additional assumptions on the behavior of the map on the boundary of the simplex (for example, in the Knaster--Kuratowski--Mazurkiewicz and the Gale theorem). We follow Erel Segal-Halevi, Fr'ed'eric Meunier, and Shira Zerbib, and replace the boundary condition by another assumption, which has the meaning in economy as the 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 division problems when $n$ is odd and not a prime power. In this arxiv version that appears after the official publication we have corrected the statement and the proof of Lemma 3.4.

Recommendations

• Envy-free division via configuration spaces
• Envy-free cake division without assuming the players prefer nonempty pieces
• Vanishing of all equivariant obstructions and the mapping degree
• On finding an envy-free Pareto-optimal division
• Envy-free divisions

Cites work

• A Borsuk-Ulam theorem for orthogonal \(T^ k\) and \(Z^ r_ p\) actions and applications
• A constructive proof of a permutation-based generalization of Sperner's lemma
• Convex equipartitions via equivariant obstruction theory
• Convex equipartitions: the spicy chicken theorem
• Envy-free cake division without assuming the players prefer nonempty pieces
• Equilibrium in a discrete exchange economy with money
• scientific article; zbMATH DE number 5788282 (Why is no real title available?)
• scientific article; zbMATH DE number 1860211 (Why is no real title available?)
• scientific article; zbMATH DE number 3095897 (Why is no real title available?)
• KKM type theorems with boundary conditions
• Topological methods for variational problems with symmetries
• Using the Borsuk-Ulam theorem. Lectures on topological methods in combinatorics and geometry. Written in cooperation with Anders Björner and Günter M. Ziegler
• Vanishing of all equivariant obstructions and the mapping degree

Cited in

(9)

• Counterexamples to the colorful Tverberg conjecture for hyperplanes
• Envy-free division of multi-layered cakes
• Vanishing of all equivariant obstructions and the mapping degree
• Splitting necklaces, with constraints
• Fair distributions for more participants than allocations
• Efficient Fair Division with Minimal Sharing
• Cutting a Cake Fairly for Groups Revisited
• Envy-free division via configuration spaces
• Fair distribution of bundles

This page was built for publication: ENVY‐FREE DIVISION USING MAPPING DEGREE

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6072663)