The undercut procedure: an algorithm for the envy-free division of indivisible items
Download full text from publisher
Other versions of this item:
- 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.
References listed on IDEAS
- Brams, S.J. & Kaplan, T.R., 2002.
"Dividing the Indivisible: Procedures for Allocating Cabinet Ministries to Political Parties in a Parliamentary System,"
02-06, C.V. Starr Center for Applied Economics, New York University.
- Steven J. Brams & Todd R. Kaplan, 2002. "Dividing the Indivisible: Procedures for Allocating Cabinet Ministries to Political Parties in a Parliamentary System," Discussion Papers 0202, Exeter University, Department of Economics.
- 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.
- Edelman, Paul & Fishburn, Peter, 2001. "Fair division of indivisible items among people with similar preferences," Mathematical Social Sciences, Elsevier, vol. 41(3), pages 327-347, May.
- Weingast, Barry R. & Wittman, Donald, 2008. "The Oxford Handbook of Political Economy," OUP Catalogue, Oxford University Press, number 9780199548477.
- 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.
- 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.
- Brams, S.J. & Fishburn, P.C., 1998. "Fair Division of Indivisible Items between Two People with Identical Preferences: Envy-Freeness, Pareto-Optimality, and Equity," Working Papers 98-20, C.V. Starr Center for Applied Economics, New York University.
- I. D. Hill, 2008. "Mathematics and Democracy: Designing Better Voting and Fair-division Procedures," Journal of the Royal Statistical Society Series A, Royal Statistical Society, vol. 171(4), pages 1032-1033.
- 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.
CitationsCitations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
- 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.
- 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.
- Haris Aziz, 2015. "A note on the undercut procedure," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 45(4), pages 723-728, December.
- repec:eee:matsoc:v:89:y:2017:i:c:p:100-108 is not listed on IDEAS
- 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.
- 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.
- 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.
- repec:spr:grdene:v:22:y:2013:i:2:d:10.1007_s10726-011-9263-5 is not listed on IDEAS
- 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.
- 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.
More about this item
KeywordsFair division; allocation of indivisible items; envy-freeness; ultimatum game;
- D63 - Microeconomics - - Welfare Economics - - - Equity, Justice, Inequality, and Other Normative Criteria and Measurement
- D74 - Microeconomics - - Analysis of Collective Decision-Making - - - Conflict; Conflict Resolution; Alliances; Revolutions
- C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games
NEP fieldsThis paper has been announced in the following NEP Reports:
- NEP-ALL-2009-01-24 (All new papers)
- NEP-CBE-2009-01-24 (Cognitive & Behavioural Economics)
- NEP-GTH-2009-01-24 (Game Theory)
StatisticsAccess and download statistics
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:pra:mprapa:12774. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Joachim Winter) or (Rebekah McClure). General contact details of provider: http://edirc.repec.org/data/vfmunde.html .
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 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.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.