How to divide things fairly

DOI10.4169/MATH.MAG.88.5.338MaRDI QIDQ2956577zbMATH OpenOpenAlexFDO

Authors J. Brams, D. Marc Kilgour, Christian Klamler

Publication date 18 January 2017

Published in Mathematics Magazine (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4169/math.mag.88.5.338

Mathematics Subject Classification ID

2-person games (91A05) (n)-person games, (n>2) (91A06) Noncooperative games (91A10) Multistage and repeated games (91A20) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Recommendations

• Fair division of indivisible items
• Fair Division
• Two-player fair division of indivisible items: comparison of algorithms
• Fair (and not so fair) division
• scientific article; zbMATH DE number 1015852

Cited in

(19)

• Equitable distribution of indivisible objects
• Fair choice sequences
• How to be fairer
• Fair division of indivisible items
• Cooperative models for allocating an object
• Picking sequences and monotonicity in weighted fair division
• Two-person fair division of indivisible items when envy-freeness is impossible
• How to obtain an equitable optimal fair division
• How to allocate hard candies fairly
• Fair (and not so fair) division
• The structure of fair-division problems and the design of fair-negotiation procedures
• Fair Division
• How to divide the indivisible
• The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
• Towards a logical analysis of \textit{Adjusted Winner}
• Multi-agent task allocation under unrestricted environments
• Fairly taking turns
• Two-player fair division of indivisible items: comparison of algorithms
• A general branch-and-bound algorithm for fair division problems

This page was built for publication: How to divide things fairly

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2956577)