Elementary solution to the fair division problem

DOI10.1134/S003294602401006XMaRDI QIDQ6585744zbMATH OpenFDO

Authors Michael L. Blank, M. O. Polyakov

Publication date 12 August 2024

Published in Problems of Information Transmission (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/S003294602401006X

zbMATH Keywords

countably additive measures/chargesdynamical systemsfair divisionmathematical economicsmulticriteria optimization

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Multi-objective and goal programming (90C29)

Recommendations

• How to divide the indivisible
• The problem of fair division for a hybrid resource
• Cutting a cake for infinitely many guests
• Extensions of cut-and-choose fair division
• On a method of obtaining an approximate solution of an exact fair division problem

Cites work

• Better ways to cut a cake
• Cutting a pie is not a piece of cake
• Envy-free cake divisions cannot be found by finite protocols
• How to Cut a Cake Fairly
• How to Cut A Cake Fairly
• How to divide the indivisible
• scientific article; zbMATH DE number 6850473 (Why is no real title available?)
• scientific article; zbMATH DE number 5240213 (Why is no real title available?)
• Rental Harmony: Sperner's Lemma in Fair Division
• Sur les fonctions-vecteurs complètement additives.
• The range of a vector measure
• Waste makes haste: bounded time algorithms for envy-free cake cutting with free disposal

This page was built for publication: Elementary solution to the fair division problem

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