Envy-free division in the presence of a dragon
From MaRDI portal
Publication:2106889
DOI10.1007/s11784-022-00997-yzbMath1504.91127arXiv2112.12969OpenAlexW4309673443MaRDI QIDQ2106889
Rade T. Živaljević, Gaiane Yu. Panina
Publication date: 29 November 2022
Published in: Journal of Fixed Point Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2112.12969
KKM theoremchessboard complexesenvy-free divisionconfiguration space/test map schemedragon marriage theorem
Applications of game theory (91A80) Fixed points and coincidences in algebraic topology (55M20) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Cites Work
- Unnamed Item
- Chessboard complexes indomitable
- Equilibrium in a discrete exchange economy with money
- Dividing a cake fairly
- The colored Tverberg's problem and complexes of injective functions
- On a topological generalization of the Tverberg theorem
- Envy-free cake division without assuming the players prefer nonempty pieces
- Permutohedra, Associahedra, and Beyond
- How to Cut a Cake Fairly
- Chessboard Complexes and Matching Complexes
- Fair Division and Generalizations of Sperner- and KKM-type Results
- Splitting Necklaces, with Constraints
- Multilabeled Versions of Sperner's and Fan's Lemmas and Applications
- 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
- Envy-free division via configuration spaces
This page was built for publication: Envy-free division in the presence of a dragon