A discrete and bounded locally envy-free cake cutting protocol on trees
From MaRDI portal
Publication:6609151
DOI10.1007/978-3-031-48974-7_18MaRDI QIDQ6609151FDOQ6609151
Authors: Ganesh Ghalme, Xin Huang, Yuka Machino, Nidhi Rathi 
Publication date: 20 September 2024
Applications of game theory (91A80) Auctions, bargaining, bidding and selling, and other market models (91B26) Internet topics (68M11)
Cites Work
- Rental Harmony: Sperner's Lemma in Fair Division
- Title not available (Why is that?)
- Handbook of Computational Social Choice
- How to Cut A Cake Fairly
- Title not available (Why is that?)
- How to Cut a Cake Fairly
- Envy-free cake divisions cannot be found by finite protocols
- Algorithmic solutions for envy-free cake cutting
- A discrete and bounded envy-free cake cutting protocol for four agents
- Fair and efficient cake division with connected pieces
- An improved envy-free cake cutting protocol for four agents
- Fair Cake Division Under Monotone Likelihood Ratios
- Envy-free allocations respecting social networks
- Thou shalt covet the average of thy neighbors' cakes
- Cake Cutting on Graphs: A Discrete and Bounded Proportional Protocol
Cited In (1)
This page was built for publication: A discrete and bounded locally envy-free cake cutting protocol on trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6609151)
