Envy-free division of multi-layered cakes
From MaRDI portal
Publication:2152142
DOI10.1007/978-3-030-94676-0_28OpenAlexW4205086933MaRDI QIDQ2152142
Frédéric Meunier, Ayumi Igarashi
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
- Unnamed Item
- Envy-free cake divisions cannot be found by finite protocols
- Dividing a cake fairly
- On a topological generalization of the Tverberg theorem
- Fair division with multiple pieces
- Two-player envy-free multi-cake division
- Envy-free cake division without assuming the players prefer nonempty pieces
- A course in topological combinatorics
- Envy-free two-player \(m\)-cake and three-player two-cake divisions
- Fair multi-cake cutting
- Rental Harmony: Sperner's Lemma in Fair Division
- How to Cut A Cake Fairly
- Some Combinatorial Lemmas in Topology
- How to Cut a Cake Fairly
- Chessboard Complexes and Matching Complexes
- Fair Division and Generalizations of Sperner- and KKM-type Results
- Algorithmic Solutions for Envy-Free Cake Cutting
- Splitting Necklaces, with Constraints
- Multilabeled Versions of Sperner's and Fan's Lemmas and Applications
- 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
- Sur la division pragmatique
- 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 USING MAPPING DEGREE
This page was built for publication: Envy-free division of multi-layered cakes
