IDEAS home Printed from https://ideas.repec.org/a/eee/matsoc/v60y2010i1p1-14.html
   My bibliography  Save this article

Brams-Taylor model of fair division for divisible and indivisible items

Author

Listed:
  • Rubchinsky, Alexander

Abstract

In this article, the fair division problem for two participants in the presence of both divisible and indivisible items is considered. Three interrelated modifications of the notion of fair division-profitably, uniformly and equitably fair divisions-were introduced. Computationally efficient algorithm for finding all of them was designed. The algorithm includes repetitive solutions of integer knapsack-type problems as its essential steps. The necessary and sufficient conditions of the existence of proportional and equitable division were found. The statements of the article are illustrated by various examples.

Suggested Citation

  • Rubchinsky, Alexander, 2010. "Brams-Taylor model of fair division for divisible and indivisible items," Mathematical Social Sciences, Elsevier, vol. 60(1), pages 1-14, July.
    • Handle: RePEc:eee:matsoc:v:60:y:2010:i:1:p:1-14
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0165-4896(10)00023-5
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. Fuad Aleskerov & Denis Bouyssou & Bernard Monjardet, 2007. "Utility Maximization, Choice and Preference," Springer Books, Springer, edition 0, number 978-3-540-34183-3, July.
    2. Brams,Steven J. & Taylor,Alan D., 1996. "Fair Division," Cambridge Books, Cambridge University Press, number 9780521556446, October.
    Full references (including those not matched with items on IDEAS)

    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. Z. Landau & O. Reid & I. Yershov, 2009. "A fair division solution to the problem of redistricting," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 32(3), pages 479-492, March.
    2. Sun, Ning & Trockel, Walter & Yang, Zaifu, 2008. "Competitive outcomes and endogenous coalition formation in an n-person game," Journal of Mathematical Economics, Elsevier, vol. 44(7-8), pages 853-860, July.
    3. Schwartz, Thomas, 2014. "Choice functions and bounded rationality," Mathematical Social Sciences, Elsevier, vol. 68(C), pages 14-18.
    4. Federica Briata & Andrea Dall’Aglio & Marco Dall’Aglio & Vito Fragnelli, 2017. "The Shapley value in the Knaster gain game," Annals of Operations Research, Springer, vol. 259(1), pages 1-19, December.
    5. Bernard Monjardet, 2005. "Modèles ordinaux de préférences," Cahiers de la Maison des Sciences Economiques b05097, Université Panthéon-Sorbonne (Paris 1).
    6. Juan P. Aguilera & Levent Ülkü, 2017. "On the maximization of menu-dependent interval orders," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 48(2), pages 357-366, February.
    7. Steven Brams & D. Kilgour & Christian Klamler, 2012. "The undercut procedure: an algorithm for the envy-free division of indivisible items," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 39(2), pages 615-631, July.
    8. Amy Givler Chapman & John E. Mitchell, 2018. "A fair division approach to humanitarian logistics inspired by conditional value-at-risk," Annals of Operations Research, Springer, vol. 262(1), pages 133-151, March.
    9. Alcantud, Jose C.R., 2006. "Maximality with or without binariness: Transfer-type characterizations," Mathematical Social Sciences, Elsevier, vol. 51(2), pages 182-191, March.
    10. Denis Bouyssou & Marc Pirlot, 2021. "Unit representation of semiorders I: Countable sets," Post-Print hal-03280649, HAL.
    11. Thomson, William, 2005. "Divide-and-permute," Games and Economic Behavior, Elsevier, vol. 52(1), pages 186-200, July.
    12. Galeazzi, Paolo & Marti, Johannes, 2023. "Choice structures in games," Games and Economic Behavior, Elsevier, vol. 140(C), pages 431-455.
    13. Elias Bouacida, 2021. "Identifying Choice Correspondences," Working Papers 327800275, Lancaster University Management School, Economics Department.
    14. Tyson, Christopher J., 2008. "Cognitive constraints, contraction consistency, and the satisficing criterion," Journal of Economic Theory, Elsevier, vol. 138(1), pages 51-70, January.
    15. Salvador Barberà & Geoffroy De Clippel & Alejandro Neme & Kareen Rozen, 2019. "Order-k Rationality," Working Papers 1130, Barcelona School of Economics.
      • Salvador Barberà & Geoffroy De Cleppel & Alejandro Neme & Kareen Rozeen, 2020. "Order-k Rationality," Working Papers 4, Red Nacional de Investigadores en Economía (RedNIE).
      • Salvador Barber‡ & Geoffroy de Clippel & Alejandro Neme & Kareen Rozen, 2020. "Order-k Rationality," Working Papers 2020-10, Brown University, Department of Economics.
    16. Barbanel, J. B. & Brams, S. J., 2001. "Cake Division with Minimal Cuts: Envy-Free Procedures for 3 Person, 4 Persons, and Beyond," Working Papers 01-07, C.V. Starr Center for Applied Economics, New York University.
    17. Olivier Hudry & Bruno Leclerc & Bernard Monjardet & Jean-Pierre Barthélemy, 2004. "Médianes métriques et latticielles," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-03322636, HAL.
    18. Aleskerov, F., 2013. "Game-Theoretic Modeling: An Attempt of Brief Discussion and a Forecast of Development," Journal of the New Economic Association, New Economic Association, vol. 17(1), pages 181-184.
    19. Haake, Claus-Jochen & Raith, Matthias G. & Su, Francis Edward, 2017. "Bidding for envy freeness," Center for Mathematical Economics Working Papers 311, Center for Mathematical Economics, Bielefeld University.
    20. D. Pennesi, 2016. "When perfectionism becomes willpower," Working Papers wp1050, Dipartimento Scienze Economiche, Universita' di Bologna.

    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:eee:matsoc:v:60:y:2010:i:1:p:1-14. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/inca/505565 .

    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.