IDEAS home Printed from https://ideas.repec.org/
MyIDEAS: Login

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, 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.
  2. Claus-Jochen Haake & Matthias G. Raith & Francis Edward Su, 1999. "Bidding for envy-freeness: A procedural approach to n-player fair-division problems," Working Papers 311, Bielefeld University, Center for Mathematical Economics.
  3. 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.
  4. Chakravarty, Surajeet & Kaplan, Todd R., 2013. "Optimal allocation without transfer payments," Games and Economic Behavior, Elsevier, vol. 77(1), pages 1-20.
  5. Carraro, Carlo & Marchiori, Carmen & Sgobbi, Alessandra, 2005. "Advances in negotiation theory : bargaining, coalitions, and fairness," Policy Research Working Paper Series 3642, The World Bank.
  6. 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.
  7. 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.
  8. 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.
  9. M.Utku Unver, 2003. "Course Bidding at Business Schools," Working Papers 257, University of Pittsburgh, Department of Economics, revised Jan 2003.
  10. 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.
  11. 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.
  12. Barbanel, Julius B. & Brams, Steven J., 2010. "Two-person pie-cutting: The fairest cuts," MPRA Paper 22703, University Library of Munich, Germany.
  13. 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.
  14. 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.
  15. 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.
  16. 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.
  17. Velez, Rodrigo A., 2011. "Are incentives against economic justice?," Journal of Economic Theory, Elsevier, vol. 146(1), pages 326-345, January.
  18. Haake,C., 2004. "Dividing by demanding : object division through market procedures," Working Papers 359, Bielefeld University, Center for Mathematical Economics.
This information is provided to you by IDEAS at the Research Division of the Federal Reserve Bank of St. Louis using RePEc data.