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

Consensus-halving via theorems of Borsuk-Ulam and Tucker

Author

Listed:
  • Simmons, Forest W.
  • Su, Francis Edward

Abstract

No abstract is available for this item.

Suggested Citation

  • Simmons, Forest W. & Su, Francis Edward, 2003. "Consensus-halving via theorems of Borsuk-Ulam and Tucker," Mathematical Social Sciences, Elsevier, vol. 45(1), pages 15-25, February.
    • Handle: RePEc:eee:matsoc:v:45:y:2003:i:1:p:15-25
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0165-4896(02)00087-2
    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 & D. Marc Kilgour, 2001. "Competitive Fair Division," Journal of Political Economy, University of Chicago Press, vol. 109(2), pages 418-443, April.
    2. Claus-Jochen Haake & Matthias G. Raith & Francis Edward Su, 2002. "Bidding for envy-freeness: A procedural approach to n-player fair-division problems," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 19(4), pages 723-749.
    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. Erel Segal-Halevi & Warut Suksompong, 2023. "Cutting a Cake Fairly for Groups Revisited," Papers 2301.09061, arXiv.org.
    2. Cloutier, John & Nyman, Kathryn L. & Su, Francis Edward, 2010. "Two-player envy-free multi-cake division," Mathematical Social Sciences, Elsevier, vol. 59(1), pages 26-37, January.
    3. Xiaotie Deng & Qi Qi & Amin Saberi, 2012. "Algorithmic Solutions for Envy-Free Cake Cutting," Operations Research, INFORMS, vol. 60(6), pages 1461-1476, December.
    4. Xiaotie Deng & Qi Qi & Amin Saberi & Jie Zhang, 2011. "Discrete Fixed Points: Models, Complexities, and Applications," Mathematics of Operations Research, INFORMS, vol. 36(4), pages 636-652, November.
    5. Frédéric Meunier, 2008. "Discrete Splittings of the Necklace," Mathematics of Operations Research, INFORMS, vol. 33(3), pages 678-688, August.
    6. Segal-Halevi, Erel & Sziklai, Balázs R., 2018. "Resource-monotonicity and population-monotonicity in connected cake-cutting," Mathematical Social Sciences, Elsevier, vol. 95(C), pages 19-30.
    7. Chèze, Guillaume, 2017. "Existence of a simple and equitable fair division: A short proof," Mathematical Social Sciences, Elsevier, vol. 87(C), pages 92-93.
    8. Balazs Sziklai & Erel Segal-Halevi, 2015. "Resource-monotonicity and Population-monotonicity in Cake-cutting," CERS-IE WORKING PAPERS 1552, Institute of Economics, Centre for Economic and Regional Studies.

    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. Francisco Sánchez Sánchez, 2022. "Envy-Free Solutions to the Problem of Room Assignment and Rent Division," Group Decision and Negotiation, Springer, vol. 31(3), pages 703-721, June.
    2. Azacis, Helmuts, 2008. "Double implementation in a market for indivisible goods with a price constraint," Games and Economic Behavior, Elsevier, vol. 62(1), pages 140-154, January.
    3. Erel Segal-Halevi, 2019. "Generalized Rental Harmony," Papers 1912.13249, arXiv.org, revised Feb 2020.
    4. Richard F. Potthoff, 2002. "Use of Linear Programming to Find an Envy-Free Solution Closest to the Brams–Kilgour Gap Solution for the Housemates Problem," Group Decision and Negotiation, Springer, vol. 11(5), pages 405-414, September.
    5. 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.
    6. Andersson, T. & Svensson, L.-G. & Yang, Z., 2010. "Constrainedly fair job assignments under minimum wages," Games and Economic Behavior, Elsevier, vol. 68(2), pages 428-442, March.
    7. Atila Abdulkadiroğlu & Tayfun Sönmez & M. Utku Ünver, 2004. "Room assignment-rent division: A market approach," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 22(3), pages 515-538, June.
    8. Ehtamo, Harri & Kettunen, Eero & Hamalainen, Raimo P., 2001. "Searching for joint gains in multi-party negotiations," European Journal of Operational Research, Elsevier, vol. 130(1), pages 54-69, April.
    9. Nolan Miller & Alexander Wagner & Richard Zeckhauser, 2013. "Solomonic separation: Risk decisions as productivity indicators," Journal of Risk and Uncertainty, Springer, vol. 46(3), pages 265-297, June.
    10. 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.
    11. Vito Fragnelli & Maria Erminia Marina, 2009. "Strategic Manipulations and Collusions in Knaster Procedure," Czech Economic Review, Charles University Prague, Faculty of Social Sciences, Institute of Economic Studies, vol. 3(2), pages 143-153, July.
    12. Ortega, Josué, 2020. "Multi-unit assignment under dichotomous preferences," Mathematical Social Sciences, Elsevier, vol. 103(C), pages 15-24.
    13. Tommy ANDERSSON & Lars EHLERS, 2013. "An Algorithm for Identifying Agent-k-Linked Allocations in Economies with Indivisibilities," Cahiers de recherche 17-2013, Centre interuniversitaire de recherche en économie quantitative, CIREQ.
    14. Tommy Andersson & Christer Andersson, 2009. "Solving House Allocation Problems with Risk-Averse Agents," Computational Economics, Springer;Society for Computational Economics, vol. 33(4), pages 389-401, May.
    15. Clark Bowman & Jonathan Hodge & Ada Yu, 2014. "The potential of iterative voting to solve the separability problem in referendum elections," Theory and Decision, Springer, vol. 77(1), pages 111-124, June.
    16. Steven J. Brams & Todd R. Kaplan & D. Marc Kilgour, 2015. "A Simple Bargaining Mechanism that Elicits Truthful Reservation Prices," Group Decision and Negotiation, Springer, vol. 24(3), pages 401-413, May.
    17. Chakravarty, Surajeet & Kaplan, Todd R., 2013. "Optimal allocation without transfer payments," Games and Economic Behavior, Elsevier, vol. 77(1), pages 1-20.
    18. 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.
    19. Edith Cohen & Michal Feldman & Amos Fiat & Haim Kaplan & Svetlana Olonetsky, 2010. "Truth and Envy in Capacitated Allocation Games," Discussion Paper Series dp540, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
    20. , & , & ,, 2014. "Budget-balance, fairness and minimal manipulability," Theoretical Economics, Econometric Society, vol. 9(3), September.

    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:45:y:2003:i:1:p:15-25. 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.