Envy-free division of multi-layered cakes
From MaRDI portal
Publication:2152142
DOI10.1007/978-3-030-94676-0_28OpenAlexW4205086933MaRDI QIDQ2152142FDOQ2152142
Authors: Ayumi Igarashi, Frédéric Meunier 
Publication date: 6 July 2022
Full work available at URL: https://arxiv.org/abs/2106.02262
Applications of game theory (91A80) Auctions, bargaining, bidding and selling, and other market models (91B26) Internet topics (68M11)
Cites Work
- 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
- Rental Harmony: Sperner's Lemma in Fair Division
- Some Combinatorial Lemmas in Topology
- Chessboard Complexes and Matching Complexes
- How to Cut A Cake Fairly
- User's guide to equivariant methods in combinatorics. II
- On a topological generalization of the Tverberg theorem
- How to Cut a Cake Fairly
- Sur la division pragmatique
- Dividing a cake fairly
- A course in topological combinatorics
- Envy-free cake divisions cannot be found by finite protocols
- Algorithmic solutions for envy-free cake cutting
- Two-player envy-free multi-cake division
- A discrete and bounded envy-free cake cutting protocol for four agents
- Simplicial maps from an orientable n-pseudomanifold into Sm with the octahedral triangulation
- Fair division with multiple pieces
- Fair division and generalizations of Sperner- and KKM-type results
- Envy-free two-player \(m\)-cake and three-player two-cake divisions
- Multilabeled Versions of Sperner's and Fan's Lemmas and Applications
- Envy-free cake division without assuming the players prefer nonempty pieces
- Fair multi-cake cutting
- ENVY‐FREE DIVISION USING MAPPING DEGREE
- Splitting Necklaces, with Constraints
Cited In (2)
This page was built for publication: Envy-free division of multi-layered cakes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2152142)
