Envy-free division via configuration spaces
DOI:
https://doi.org/10.12775/TMNA.2022.036Keywords
Envy-free division, configuration space/test map schemeAbstract
The classical approach to envy-free division and equilibrium problems arising in mathematical economics typically relies on Knaster-Kuratowski-Mazurkiewicz theorem, Sperner's lemma or some extension involving mapping degree. We propose a different and relatively novel approach where the emphasis is on configuration spaces and equivariant topology, originally developed for applications in discrete and computational geometry (Tverberg type problems, necklace splitting problem, etc.). We illustrate the method by proving several counterparts and extensions of the classical envy-free division theorem of David Gale, where the emphasis is on preferences allowing the players to choose degenerate pieces of the cake.References
N. Alon, Splitting necklaces, Adv. Math. 63 (1987), 247–253.
S. Avvakumov and R. Karasev, Envy-free division using mapping degree, Mathematika 67 (2021), no. 1, 36–53.
S. Avvakumov, R. Karasev, Equipartition of a segment, arXiv: 2009.09862.
P.V.M. Blagojević, B. Matschke and G.M. Ziegler, Optimal bounds for the colored Tverberg problem, J. Eur. Math. Soc. (JEMS) 17 (2015), no. 4, 739–754.
A. Dold, Simple proofs of some Borsuk–Ulam results, Contemp. Math. 19 (1983), 65–69.
D. Gale, Equilibrium in a discrete exchange economy with money, Internat. J. Game Theory 13 (1984), no. 1, 61–64.
F. Frick, K. Houston-Edwards and F. Meunier, Achieving rental harmony with a secretive roommate, Amer. Math. Monthly 126 (2019), no. 1.
M.D. Hirsch, M. Magill and A. Mas-Colell, A geometric approach to a class of equilibrium existence theorems, J. Math. Econom. 19 (1990), 95–106.
S.Y. Husseini, J.-M. Lasry and M.J.P. Magill, Existence of equilibrium with incomplete markets, J. Math. Econom. 19 (1990), 39–67.
D. Jojić, G. Panina and R.T. Živaljević, Splitting necklaces, with constraints, SIAM J. Discrete Math. 35 (2021), no. 2, 1268–1286.
D. Jojić, G. Panina and R.T. Živaljević, Optimal colored Tverberg theorems for prime powers, Homology Homotopy Appl. 24 (2022), no. 2, 401–424.
J. Matoušek, Using the Borsuk–Ulam Theorem. Lectures on Topological Methods in Combinatorics and Geometry, Universitext, Springer–Verlag, Heidelberg, 2003 (corrected 2nd printing 2008).
F. Meunier and S. Zerbib, Envy-free cake division without assuming the players prefer nonempty pieces, Israel J. Math. 234 (2019), 907–925.
E. Segal-Halevi, Fairly dividing a cake after some parts were burnt in the oven, Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems (AAMAS 2018), 2018, 1276–1284.
P. Soberón, Fair distributions for more participants than allocations, Proc. Amer. Math. Soc. Ser. B 9 (2022), 404–414.
W. Stromquist, How to cut a cake fairly, Amer. Math. Monthly 87 (1980), no. 8, 640–644.
A.Y. Volovikov, On a topological generalization of the Tverberg theorem, Math. Notes 59 (1996), 324–32.
S. Vrećica and R. Živaljević, Chessboard complexes indomitable, J. Combin. Theory Ser. A 118 (2011), 2157–2166.
D.R. Woodall, Dividing a cake fairly, J. Math. Anal. Appl. 78 (1980), no. 1, 233–247.
R.T. Živaljević, Topological methods in discrete geometry, Handbook of Discrete and Computational Geometry (third edition), (J.E. Goodman, J. O’Rourke, and C. D. Tóth, eds) CRC Press LLC, 2017, Chapter 21, 551–580.
R.T. Živaljević and S.T. Vrećica, The colored Tverberg’s problem and complexes of injective functions, J. Combin. Theory Ser. A 61 (1992), 309–318.
Published
How to Cite
Issue
Section
License
Copyright (c) 2023 Gaiane Panina, Rade T. Živaljević
This work is licensed under a Creative Commons Attribution-NoDerivatives 4.0 International License.
Stats
Number of views and downloads: 0
Number of citations: 0
