Consensus-halving via theorems of Borsuk-Ulam and Tucker
Author
Abstract
Suggested Citation
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- 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.
- 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.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Erel Segal-Halevi & Warut Suksompong, 2023. "Cutting a Cake Fairly for Groups Revisited," Papers 2301.09061, arXiv.org.
- 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.
- 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.
- 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.
- 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.
- Xiaotie Deng & Qi Qi & Amin Saberi, 2012. "Algorithmic Solutions for Envy-Free Cake Cutting," Operations Research, INFORMS, vol. 60(6), pages 1461-1476, December.
- Frédéric Meunier, 2008. "Discrete Splittings of the Necklace," Mathematics of Operations Research, INFORMS, vol. 33(3), pages 678-688, August.
- 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.
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.- 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.
- 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.
- Helmuts Azacis, 2004. "Double Implementation in a Market for Indivisible Goods with a Price Constraint," UFAE and IAE Working Papers 623.04, Unitat de Fonaments de l'Anàlisi Econòmica (UAB) and Institut d'Anàlisi Econòmica (CSIC).
- Azacis, Helmuts, 2005. "Double Implementation in a Market for Indivisible Goods with a Price Constraint," Cardiff Economics Working Papers E2005/10, Cardiff University, Cardiff Business School, Economics Section.
- Erel Segal-Halevi, 2019. "Generalized Rental Harmony," Papers 1912.13249, arXiv.org, revised Feb 2020.
- 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.
- 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.
- 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.
- 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.
- Atila Abdulkadiroglu & Tayfun Sonmez & M. Utku Unver, 2002. "Room Assignment-Rent Division: A Market Approach," Game Theory and Information 0202003, University Library of Munich, Germany, revised 09 Feb 2004.
- 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.
- Brams, Steven J. & Kilgour, D. Marc & Klamler, Christian, 2009. "The undercut procedure: an algorithm for the envy-free division of indivisible items," MPRA Paper 12774, University Library of Munich, Germany.
- Ortega, Josué, 2020.
"Multi-unit assignment under dichotomous preferences,"
Mathematical Social Sciences, Elsevier, vol. 103(C), pages 15-24.
- Josue Ortega, 2017. "Multi-unit Assignment under Dichotomous Preferences," Papers 1703.10897, arXiv.org, revised Jul 2018.
- Ortega, Josué, 2018. "Multi-unit assignment under dichotomous preferences," ZEW Discussion Papers 18-052, ZEW - Leibniz Centre for European Economic Research.
- 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.
- Brams, Steven J. & Kaplan, Todd & Kilgour, D. Marc, "undated". "A Simple Bargaining Mechanism That Elicits Truthful Reservation Prices," Working Papers WP2011/2, University of Haifa, Department of Economics.
- Brams, Steven J. & Kaplan, Todd R & Kilgour, D. Marc, 2011. "A Simple Bargaining Mechanism That Elicits Truthful Reservation Prices," MPRA Paper 28999, University Library of Munich, Germany.
- Chakravarty, Surajeet & Kaplan, Todd R., 2013.
"Optimal allocation without transfer payments,"
Games and Economic Behavior, Elsevier, vol. 77(1), pages 1-20.
- Chakravarty, Surajeet & Kaplan, Todd R., 2006. "Optimal Allocation without Transfer Payments," MPRA Paper 18481, University Library of Munich, Germany, revised 02 Mar 2009.
- Surajeet Chakravarty & Todd R. Kaplan, 2010. "Optimal Allocation without Transfer Payments," Discussion Papers 1004, University of Exeter, Department of Economics.
- 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.
- , & , & ,, 2014.
"Budget-balance, fairness and minimal manipulability,"
Theoretical Economics, Econometric Society, vol. 9(3), September.
- Andersson, Tommy & Svensson, Lars-Gunnar & Ehlers, Lars, 2010. "Budget-Balance, Fairness and Minimal Manipulability," Working Papers 2010:16, Lund University, Department of Economics, revised 15 Jan 2013.
- ANDERSSON, Tommy & EHLERS, Lars & SVENSSON, Lars-Gunnar, 2010. "Budget-Balance, Fairness and Minimal Manipulability," Cahiers de recherche 18-2010, Centre interuniversitaire de recherche en économie quantitative, CIREQ.
- ANDERSSON, Tommy & EHLERS, Lars & SVENSSON, Lars-Gunnar, 2010. "Budget-Balance, Fairness and Minimal Manipulability," Cahiers de recherche 2010-09, Universite de Montreal, Departement de sciences economiques.
- Andreas Wagener, 2006. "Geometric division with a fixed point: Not half the cake, but at least 4/9," Group Decision and Negotiation, Springer, vol. 15(1), pages 43-53, January.
- 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.
- Richard Hule & Matthias Sutter, 2003. "Can the Stability and Growth Pact in EMU Cause Budget Deficit Cycles?," Empirica, Springer;Austrian Institute for Economic Research;Austrian Economic Association, vol. 30(1), pages 25-38, March.
- Andersson, Tommy & Ehlers, Lars & Svensson, Lars-Gunnar, 2014.
"Least manipulable Envy-free rules in economies with indivisibilities,"
Mathematical Social Sciences, Elsevier, vol. 69(C), pages 43-49.
- Andersson, Tommy & Ehlers, Lars & Svensson, Lars-Gunnar, 2012. "Least Manipulable Envy-free Rules in Economies with Indivisibilities," Working Papers 2012:8, Lund University, Department of Economics, revised 30 Sep 2013.
- Ning Sun & Zaifu Yang, 2009. "Strategy Proof And Privacy Preserving Fair Allocation Mechanism," The Japanese Economic Review, Japanese Economic Association, vol. 60(2), pages 143-151, June.
- Fragnelli, Vito & Marina, Maria Erminia, 2003. "A fair procedure in insurance," Insurance: Mathematics and Economics, Elsevier, vol. 33(1), pages 75-85, August.
- Nicolò, Antonio & Velez, Rodrigo A., 2017.
"Divide and compromise,"
Mathematical Social Sciences, Elsevier, vol. 90(C), pages 100-110.
- Rodrigo A. Velez & Antonio Nicolo, 2016. "Divide and compromise," Working Papers 20160710-001, Texas A&M University, Department of Economics.
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.