A discrete and bounded locally envy-free cake cutting protocol on trees
From MaRDI portal
Publication:6609151
Cites work
- scientific article; zbMATH DE number 1234106 (Why is no real title available?)
- scientific article; zbMATH DE number 1015852 (Why is no real title available?)
- A discrete and bounded envy-free cake cutting protocol for four agents
- Algorithmic solutions for envy-free cake cutting
- An improved envy-free cake cutting protocol for four agents
- Cake Cutting on Graphs: A Discrete and Bounded Proportional Protocol
- Envy-free allocations respecting social networks
- Envy-free cake divisions cannot be found by finite protocols
- Fair Cake Division Under Monotone Likelihood Ratios
- Fair and efficient cake division with connected pieces
- Handbook of Computational Social Choice
- How to Cut A Cake Fairly
- How to Cut a Cake Fairly
- Rental Harmony: Sperner's Lemma in Fair Division
- Thou shalt covet the average of thy neighbors' cakes
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)