Fair Division
From MaRDI portal
Publication:5150295
DOI10.1007/978-1-0716-0368-0_198zbMath1455.91123OpenAlexW4237638503MaRDI QIDQ5150295
Steven J. Brams, Christian Klamler
Publication date: 15 February 2021
Published in: Complex Social and Behavioral Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-0716-0368-0_198
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Economics and computation. An introduction to algorithmic game theory, computational social choice, and fair division
- Fair division of indivisible items between two players: design parameters for contested pile methods
- A note on cake cutting
- A note on the undercut procedure
- Envy-free cake divisions cannot be found by finite protocols
- Cake division with minimal cuts: envy-free procedures for three persons, four persons, and beyond
- Fair division of indivisible items
- The undercut procedure: an algorithm for the envy-free division of indivisible items
- On the complexity of cake cutting
- Proportional pie-cutting
- A simple procedure for finding equitable allocations of indivisible goods
- Relations among certain ranges of vector measures
- Rental Harmony: Sperner's Lemma in Fair Division
- Two-Person Fair Division of Indivisible Items: An Efficient, Envy-Free Algorithm
- How to Divide Things Fairly
- Fair Division under Ordinal Preferences: Computing Envy-Free Allocations of Indivisible Goods
- Divide-and-Conquer: A Proportional, Minimal-Envy Cake-Cutting Algorithm
- How to Cut A Cake Fairly
- How to Cut a Cake Fairly
- A moving-knife solution to the four-person envy-free cake-division problem
- Fair Enough
- Equitable, Envy-Free, and Efficient Cake Cutting for Two People and Its Application to Divisible Goods
- An Envy-Free Cake Division Protocol
- <em>N</em>-Person Cake-Cutting: There May Be No Perfect Division
- Introduction to the Theory of Fair Allocation
- Fair Allocation of Indivisible Goods
- Handbook of Computational Social Choice
- A discrete and bounded envy-free cake cutting protocol for four agents
- Cake cutting really is not a piece of cake
This page was built for publication: Fair Division
