IDEAS home Printed from https://ideas.repec.org/
MyIDEAS: Log in (now much improved!)

Citations for "Competitive Fair Division"

by Brams, S.J. & Kilgour, D.M.

For a complete description of this item, click here. For a RSS feed for citations of this item, click here.
as
in new window

  1. Barbanel, Julius B. & Brams, Steven J., 2010. "Two-person pie-cutting: The fairest cuts," MPRA Paper 22703, University Library of Munich, Germany.
  2. Rodrigo A. Velez & Antonio Nicolo, 2016. "Divide and compromise," Working Papers 20160710-001, Texas A&M University, Department of Economics.
  3. 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.
  4. 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.
  5. Carlo Carraro & Carmen Marchiori & Alessandra Sgobbi, 2005. "Advances in Negotiation Theory: Bargaining, Coalitions and Fairness," Working Papers 2005.66, Fondazione Eni Enrico Mattei.
  6. Chakravarty, Surajeet & Kaplan, Todd R., 2013. "Optimal allocation without transfer payments," Games and Economic Behavior, Elsevier, vol. 77(1), pages 1-20.
  7. 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.
  8. Tayfun Sonmez & M. Utku Unver, 2003. "Course Bidding at Business Schools," Game Theory and Information 0306001, EconWPA, revised 02 Jan 2004.
  9. 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.
  10. Barbanel, Julius B. & Brams, Steven J., 2004. "Cake division with minimal cuts: envy-free procedures for three persons, four persons, and beyond," Mathematical Social Sciences, Elsevier, vol. 48(3), pages 251-269, November.
  11. 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.
  12. 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.
  13. Atila Abdulkadiroglu & Tayfun Sonmez & M. Utku Unver, 2002. "Room Assignment-Rent Division: A Market Approach," Game Theory and Information 0202003, EconWPA, revised 26 Sep 2002.
  14. Claus-Jochen Haake & Matthias G. Raith & Francis Edward Su, 1999. "Bidding for envy-freeness: A procedural approach to n-player fair-division problems," Center for Mathematical Economics Working Papers 311, Center for Mathematical Economics, Bielefeld University.
  15. 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.
  16. Velez, Rodrigo A., 2011. "Are incentives against economic justice?," Journal of Economic Theory, Elsevier, vol. 146(1), pages 326-345, January.
  17. Claus-Jochen Haake & Matthias G. Raith & Francis Su, 2000. "Bidding for Envy-Freeness: A Procedural Approach to n-Player Fair Division Problems," Claremont Colleges Working Papers 2000-47, Claremont Colleges.
  18. Haake, Claus-Jochen, 2016. "Dividing by Demanding: Object Division through Market Procedures," Center for Mathematical Economics Working Papers 359, Center for Mathematical Economics, Bielefeld University.
  19. 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.
  20. 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.
  21. 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.
This information is provided to you by IDEAS at the Research Division of the Federal Reserve Bank of St. Louis using RePEc data.