Fair cake-cutting for imitative agents
From MaRDI portal
Publication:2673785
DOI10.1007/s00355-021-01375-2zbMath1492.91154OpenAlexW3211640163MaRDI QIDQ2673785
Publication date: 13 June 2022
Published in: Social Choice and Welfare (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00355-021-01375-2
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Strategic divide and choose
- The complexity of cake cutting with unequal shares
- The undercut procedure: an algorithm for the envy-free division of indivisible items
- On the complexity of cake cutting
- Cake Cutting Algorithms for Piecewise Constant and Piecewise Uniform Valuations
- Meta-Envy-Free Cake-Cutting Protocols
- How to Cut A Cake Fairly
- Regret in Decision Making under Uncertainty
- Information Theoretic Cutting of a Cake
- <em>N</em>-Person Cake-Cutting: There May Be No Perfect Division
- Cake Cutting Algorithms
- Cake cutting really is not a piece of cake