IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v223y2014i1p121-13610.1007-s10479-014-1611-9.html
   My bibliography  Save this article

Finding maxmin allocations in cooperative and competitive fair division

Author

Listed:
  • Marco Dall’Aglio
  • Camilla Luca

Abstract

We define a subgradient algorithm to compute the maxmin value of a completely divisible good in both competitive and cooperative strategic contexts. The algorithm relies on the construction of upper and lower bounds for the optimal value which are based on the convexity properties of the range of utility vectors associated to all possible divisions of the good. The upper bound always converges to the optimal value. Moreover, if two additional hypotheses hold: that the preferences of the players are mutually absolutely continuous, and that there always exists relative disagreement among the players, then also the lower bound converges, and the algorithm finds an approximately optimal allocation. Copyright Springer Science+Business Media New York 2014

Suggested Citation

  • Marco Dall’Aglio & Camilla Luca, 2014. "Finding maxmin allocations in cooperative and competitive fair division," Annals of Operations Research, Springer, vol. 223(1), pages 121-136, December.
  • Handle: RePEc:spr:annopr:v:223:y:2014:i:1:p:121-136:10.1007/s10479-014-1611-9
    DOI: 10.1007/s10479-014-1611-9
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-014-1611-9
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1007/s10479-014-1611-9?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Marco Dall’Aglio & Rodica Branzei & Stef Tijs, 2009. "Cooperation in dividing the cake," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 17(2), pages 417-432, December.
    2. Barbanel, Julius, 1999. "Partition ratios, Pareto optimal cake division, and related notions," Journal of Mathematical Economics, Elsevier, vol. 32(4), pages 401-428, December.
    3. Kalai, Ehud & Smorodinsky, Meir, 1975. "Other Solutions to Nash's Bargaining Problem," Econometrica, Econometric Society, vol. 43(3), pages 513-518, May.
    4. Kalai, Ehud, 1977. "Proportional Solutions to Bargaining Situations: Interpersonal Utility Comparisons," Econometrica, Econometric Society, vol. 45(7), pages 1623-1630, October.
    5. Legut, Jerzy, 1990. "On totally balanced games arising from cooperation in fair division," Games and Economic Behavior, Elsevier, vol. 2(1), pages 47-60, March.
    6. Barbanel,Julius B. Introduction by-Name:Taylor,Alan D., 2005. "The Geometry of Efficient Fair Division," Cambridge Books, Cambridge University Press, number 9780521842488.
    7. Legut J. & Potters J. A. M. & Tijs S. H., 1994. "Economies with Land--A Game Theoretical Approach," Games and Economic Behavior, Elsevier, vol. 6(3), pages 416-430, May.
    8. Legut, J. & Potters, J.A.M. & Tijs, S.H., 1994. "Economies with land : A game theoretical approach," Other publications TiSEM 37ff121d-d79c-4e41-a06a-9, Tilburg University, School of Economics and Management.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Natalia I. Naumova, 2022. "Some solutions for generalized games with restricted cooperation," Annals of Operations Research, Springer, vol. 318(2), pages 1077-1093, November.
    2. Jerzy Legut, 2020. "How to obtain an equitable optimal fair division," Annals of Operations Research, Springer, vol. 284(1), pages 323-332, January.
    3. Erel Segal-Halevi & Shmuel Nitzan, 2019. "Fair cake-cutting among families," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 53(4), pages 709-740, December.
    4. Sophie Bade & Erel Segal-Halevi, 2018. "Fairness for Multi-Self Agents," Papers 1811.06684, arXiv.org, revised Apr 2022.
    5. Erel Segal-Halevi & Balázs R. Sziklai, 2019. "Monotonicity and competitive equilibrium in cake-cutting," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 68(2), pages 363-401, September.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Marco Dall'Aglio & Camilla Di Luca, 2011. "Finding Maxmin Allocations in Cooperative and Competitive Fair Division," Working Papers 2011.88, Fondazione Eni Enrico Mattei.
    2. Dall'Aglio, M. & Brânzei, R. & Tijs, S.H., 2008. "Cooperation in Dividing the Cake," Discussion Paper 2008-101, Tilburg University, Center for Economic Research.
    3. Segal-Halevi, Erel & Nitzan, Shmuel & Hassidim, Avinatan & Aumann, Yonatan, 2017. "Fair and square: Cake-cutting in two dimensions," Journal of Mathematical Economics, Elsevier, vol. 70(C), pages 1-28.
    4. Dall'Aglio, M. & Brânzei, R. & Tijs, S.H., 2008. "Cooperation in Dividing the Cake," Other publications TiSEM cc8598f8-1be5-46d7-b91d-1, Tilburg University, School of Economics and Management.
    5. Marco Dall'Aglio & Camilla Di Luca & Lucia Milone, 2017. "Finding the Pareto optimal equitable allocation of homogeneous divisible goods among three players," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 27(3), pages 35-50.
    6. Bergantiños, Gustavo & Moreno-Ternero, Juan D., 2022. "Monotonicity in sharing the revenues from broadcasting sports leagues," European Journal of Operational Research, Elsevier, vol. 297(1), pages 338-346.
    7. Lea Melnikovová, 2017. "Can Game Theory Help to Mitigate Water Conflicts in the Syrdarya Basin?," Acta Universitatis Agriculturae et Silviculturae Mendelianae Brunensis, Mendel University Press, vol. 65(4), pages 1393-1401.
    8. Daniele Cassese & Paolo Pin, 2018. "Decentralized Pure Exchange Processes on Networks," Papers 1803.08836, arXiv.org, revised Mar 2022.
    9. José-Manuel Giménez-Gómez & António Osório & Josep E. Peris, 2015. "From Bargaining Solutions to Claims Rules: A Proportional Approach," Games, MDPI, vol. 6(1), pages 1-7, March.
    10. Takeuchi, Ai & Veszteg, Róbert F. & Kamijo, Yoshio & Funaki, Yukihiko, 2022. "Bargaining over a jointly produced pie: The effect of the production function on bargaining outcomes," Games and Economic Behavior, Elsevier, vol. 134(C), pages 169-198.
    11. Hwang, Sung-Ha & Rey-Bellet, Luc, 2021. "Positive feedback in coordination games: Stochastic evolutionary dynamics and the logit choice rule," Games and Economic Behavior, Elsevier, vol. 126(C), pages 355-373.
    12. Saglam, Ismail, 2022. "Two-player bargaining problems with unilateral pre-donation," MPRA Paper 115203, University Library of Munich, Germany.
    13. Ismail Saglam, 2017. "Iterated Kalai–Smorodinsky–Nash compromise," Decisions in Economics and Finance, Springer;Associazione per la Matematica, vol. 40(1), pages 335-349, November.
    14. Ismail Saglam, 2013. "Endogenously proportional bargaining solutions," Economics Bulletin, AccessEcon, vol. 33(2), pages 1521-1534.
    15. Bas Dietzenbacher & Hans Peters, 2022. "Characterizing NTU-bankruptcy rules using bargaining axioms," Annals of Operations Research, Springer, vol. 318(2), pages 871-888, November.
    16. KIbrIs, Özgür & TapkI, Ipek Gürsel, 2010. "Bargaining with nonanonymous disagreement: Monotonic rules," Games and Economic Behavior, Elsevier, vol. 68(1), pages 233-241, January.
    17. Forgo, F. & Szidarovszky, F., 2003. "On the relation between the Nash bargaining solution and the weighting method," European Journal of Operational Research, Elsevier, vol. 147(1), pages 108-116, May.
    18. Shiran Rachmilevitch, 2019. "Egalitarianism, utilitarianism, and the Nash bargaining solution," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 52(4), pages 741-751, April.
    19. Huber, Samuel & Kim, Jaehong, 2019. "The role of trading frictions in financial markets," Journal of Economic Dynamics and Control, Elsevier, vol. 99(C), pages 1-18.
    20. Dufwenberg, Martin & Servátka, Maroš & Vadovič, Radovan, 2017. "Honesty and informal agreements," Games and Economic Behavior, Elsevier, vol. 102(C), pages 269-285.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:223:y:2014:i:1:p:121-136:10.1007/s10479-014-1611-9. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.