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

How to allocate hard candies fairly

Author

Listed:
  • Dall'Aglio, Marco
  • Mosca, Raffaele

Abstract

No abstract is available for this item.

Suggested Citation

  • Dall'Aglio, Marco & Mosca, Raffaele, 2007. "How to allocate hard candies fairly," Mathematical Social Sciences, Elsevier, vol. 54(3), pages 218-237, December.
    • Handle: RePEc:eee:matsoc:v:54:y:2007:i:3:p:218-237
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0165-4896(07)00041-8
    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. Steven J. Brams & Paul H. Edelman & Peter C. Fishburn, 2003. "Fair Division Of Indivisible Items," Theory and Decision, Springer, vol. 55(2), pages 147-180, September.
    2. Steven J. Brams & Peter C. Fishburn, 2000. "Fair division of indivisible items between two people with identical preferences: Envy-freeness, Pareto-optimality, and equity," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 17(2), pages 247-267.
    3. Demko, Stephen & Hill, Theodore P., 1988. "Equitable distribution of indivisible objects," Mathematical Social Sciences, Elsevier, vol. 16(2), pages 145-158, October.
    4. Dorothea Herreiner & Clemens Puppe, 2002. "A simple procedure for finding equitable allocations of indivisible goods," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 19(2), pages 415-430.
    5. Steven J. Brams & Daniel L. King, 2005. "Efficient Fair Division," Rationality and Society, , vol. 17(4), pages 387-421, November.
    6. Akin, Ethan, 1995. "Vilfredo Pareto cuts the cake," Journal of Mathematical Economics, Elsevier, vol. 24(1), pages 23-44.
    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. Chang, Carlos M. & Montes, Edith, 2014. "An Optimization Approach Applied to Fair Division Transportation Funding Allocation Models," Journal of the Transportation Research Forum, Transportation Research Forum, vol. 53(1).
    2. Rudolf Vetschera & D. Kilgour, 2014. "Fair division of indivisible items between two players: design parameters for Contested Pile methods," Theory and Decision, Springer, vol. 76(4), pages 547-572, April.
    3. Rudolf Vetschera & D. Marc Kilgour, 2013. "Strategic Behavior in Contested-Pile Methods for Fair Division of Indivisible Items," Group Decision and Negotiation, Springer, vol. 22(2), pages 299-319, March.

    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. Eve Ramaekers, 2013. "Fair allocation of indivisible goods: the two-agent case," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 41(2), pages 359-380, July.
    2. Thomson, William, 2011. "Chapter Twenty-One - Fair Allocation Rules," Handbook of Social Choice and Welfare, in: K. J. Arrow & A. K. Sen & K. Suzumura (ed.), Handbook of Social Choice and Welfare, edition 1, volume 2, chapter 21, pages 393-506, Elsevier.
    3. Rudolf Vetschera & D. Marc Kilgour, 2013. "Strategic Behavior in Contested-Pile Methods for Fair Division of Indivisible Items," Group Decision and Negotiation, Springer, vol. 22(2), pages 299-319, March.
    4. Haris Aziz, 2016. "A generalization of the AL method for fair allocation of indivisible objects," Economic Theory Bulletin, Springer;Society for the Advancement of Economic Theory (SAET), vol. 4(2), pages 307-324, October.
    5. 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.
    6. RAMAEKERS, Eve, 2010. "Fair allocation of indivisible goods among two agents," LIDAM Discussion Papers CORE 2010087, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    7. Nhan-Tam Nguyen & Dorothea Baumeister & Jörg Rothe, 2018. "Strategy-proofness of scoring allocation correspondences for indivisible goods," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 50(1), pages 101-122, January.
    8. Nicolò, Antonio & Yu, Yan, 2008. "Strategic divide and choose," Games and Economic Behavior, Elsevier, vol. 64(1), pages 268-289, September.
    9. Steven J. Brams & D. Marc Kilgour & Christian Klamler, 2017. "Maximin Envy-Free Division of Indivisible Items," Group Decision and Negotiation, Springer, vol. 26(1), pages 115-131, January.
    10. Brams, Steven J. & Kaplan, Todd R., 2017. "Dividing the indivisible: procedures for allocation cabinet ministries to political parties in a parlamentary system," Center for Mathematical Economics Working Papers 340, Center for Mathematical Economics, Bielefeld University.
    11. Brams, Steven J. & Kilgour, D. Marc & Klamler, Christian, 2013. "Two-Person Fair Division of Indivisible Items: An Efficient, Envy-Free Algorithm," MPRA Paper 47400, University Library of Munich, Germany.
    12. Andreas Darmann & Christian Klamler, 2019. "Using the Borda rule for ranking sets of objects," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 53(3), pages 399-414, October.
    13. Brams,S.L. & Kaplan,T.R., 2002. "Dividing the indivisible : procedures for allocating cabinet ministries to political parties in a parliamentary system," Center for Mathematical Economics Working Papers 340, Center for Mathematical Economics, Bielefeld University.
    14. Andreas Darmann & Christian Klamler, 2016. "Proportional Borda allocations," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 47(3), pages 543-558, October.
    15. Caspari, Gian, 2020. "Booster draft mechanism for multi-object assignment," ZEW Discussion Papers 20-074, ZEW - Leibniz Centre for European Economic Research.
    16. Rothe, Jörg & Schadrack, Hilmar & Schend, Lena, 2018. "Borda-induced hedonic games with friends, enemies, and neutral players," Mathematical Social Sciences, Elsevier, vol. 96(C), pages 21-36.
    17. Steven J. Brams & D. Marc Kilgour & Christian Klamler, 2022. "Two-Person Fair Division of Indivisible Items when Envy-Freeness is Impossible," SN Operations Research Forum, Springer, vol. 3(2), pages 1-23, June.
    18. Brams, Steven J. & Kilgour, D. Marc & Klamler, Christian, 2014. "An algorithm for the proportional division of indivisible items," MPRA Paper 56587, University Library of Munich, Germany.
    19. Eric Budish & Estelle Cantillon, 2012. "The Multi-unit Assignment Problem: Theory and Evidence from Course Allocation at Harvard," American Economic Review, American Economic Association, vol. 102(5), pages 2237-2271, August.
    20. Marco LiCalzi & Antonio Nicolò, 2009. "Efficient egalitarian equivalent allocations over a single good," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 40(1), pages 27-45, July.

    More about this item

    Statistics

    Access and download statistics

    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:54:y:2007:i:3:p:218-237. 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.