Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
research-article

Elementary Solution to the Fair Division Problem

Published: 07 August 2024 Publication History

Abstract

A new and relatively elementary approach is proposed for solving the problem of fair division of a continuous resource (measurable space, pie, etc.) between several participants, the selection criteria of which are described by charges (signed measures). The setting of the problem with charges is considered for the first time. The problem comes down to analyzing properties of trajectories of a specially constructed dynamical system acting in the space of finite measurable partitions. Exponentially fast convergence to a limit solution is proved for both the case of true measures and the case of charges.

References

[1]
Brams S.J., Jones M.A., and Klamler C. Better Ways to Cut a Cake Notices Amer. Math. Soc. 2006 53 11 1314-1321
[2]
Moulin H. Fair Division and Collective Welfare 2003 Cambridge MIT Press
[3]
Brams S.J. Mathematics and Democracy: Designing Better Voting and Fair Division Procedures 2008 Princeton, NJ Princeton Univ. Press
[4]
Barbanel J.B., Brams S.J., and Stromquist W.Cutting a Pie Is Not a Piece of CakeAmer. Math. Monthly20091166496-514https://doi.org/10.1080/00029890.2009.11920966
[5]
Dubins L.E. and Spanier E.H.How to Cut a Cake FairlyAmer. Math. Monthly19616811-17Part 1, https://doi.org/10.1080/00029890.1961.11989615
[6]
Liapounoff A.A. On Completely Additive Vector Functions Izv. Akad. Nauk SSSR Ser. Mat. 1940 4 6 465-478 https://www.mathnet.ru/eng/im3907
[7]
Halmos P.R.The Range of a Vector MeasureBull. Amer. Math. Soc.1948544416-421https://doi.org/10.1090/S0002-9904-1948-09020-6
[8]
Stromquist W.How to Cut a Cake FairlyAmer. Math. Monthly1980878640-644https://doi.org/10.1080/00029890.1980.11995109
[9]
Su F.E.Rental Harmony: Sperner’s Lemma in Fair DivisionAmer. Math. Monthly199910610930-942https://doi.org/10.2307/2589747
[10]
Stromquist, W., Envy-free Cake Divisions Cannot Be Found by Finite Protocols, Electron. J. Combin., 2008, vol. 15, no. 1, Research Paper R11 (10 pp.). https://doi.org/10.37236/735
[11]
Aziz, H. and Mackenzie, S., A Discrete and Bounded Envy-free Cake Cutting Protocol for Any Number of Agents, in Proc. 2016 IEEE 57th Annu. Symp. on Foundations of Computer Science (FOCS'2016), New Brunswick, NJ, USA, Oct. 9–11, 2016, Los Alamitos, CA: IEEE Comp. Soc., 2016, pp. 416–427. https://doi.org/10.1109/FOCS.2016.52
[12]
Dehghani, S., Farhadi, A., HajiAghayi, M.T., and Yami, H., Envy-free Chore Division for an Arbitrary Number of Agents, in Proc. 29th Annu. ACM–SIAM Symp. on Discrete Algorithms (SODA'2018), New Orleans, LA, USA, Jan. 7–10, 2018, Philadelphia, PA: SIAM, 2018, pp. 2564–2583. https://doi.org/10.1137/1.9781611975031.164
[13]
Segal-Halevi, E., Fairly Dividing a Cake after Some Parts Were Burnt in the Oven, https://arxiv.org/abs/1704.00726v5 [math.CO], 2018.
[14]
Blank M.L.How to Divide the IndivisibleDokl. Akad. Nauk20164716635-639[Dokl. Math. (Engl. Transl.), 2016, vol. 94, no. 3, pp. 688-691. https://doi.org/10.1134/S1064562416060272
[15]
Segal-Halevi, E., Hassidim, A., and Aumann, Y., Waste Makes Haste: Bounded Time Algorithms for Envy-free Cake Cutting with Free Disposal, ACM Trans. Algorithms, 2016, vol. 13, no. 1, Art. 12 (32 pp.). https://doi.org/10.1145/2988232

Recommendations

Comments

Information & Contributors

Information

Published In

cover image Problems of Information Transmission
Problems of Information Transmission  Volume 60, Issue 1
Mar 2024
70 pages

Publisher

Plenum Press

United States

Publication History

Published: 07 August 2024
Accepted: 23 May 2024
Revision received: 23 May 2024
Received: 18 January 2024

Author Tags

  1. fair division
  2. mathematical economics
  3. multicriteria optimization
  4. countably additive measures/charges
  5. dynamical systems

Qualifiers

  • Research-article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 0
    Total Downloads
  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 10 Oct 2024

Other Metrics

Citations

View Options

View options

Get Access

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media