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. Surajeet Chakravarty & Todd R. Kaplan, 2010. "Optimal Allocation without Transfer Payments," Discussion Papers 1004, Exeter University, Department of Economics.
  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. 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.
  4. 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.
  5. Barbanel, Julius B. & Brams, Steven J., 2010. "Two-person pie-cutting: The fairest cuts," MPRA Paper 22703, University Library of Munich, Germany.
  6. Velez, Rodrigo A., 2011. "Are incentives against economic justice?," Journal of Economic Theory, Elsevier, vol. 146(1), pages 326-345, January.
  7. Carlo Carraro & Carmen Marchiori & Alessandra Sgobbi, 2006. "Advances in Negotiation Theory: Bargaining, Coalitions and Fairness," Working Papers 2006_08, Department of Economics, University of Venice "Ca' Foscari".
  8. 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.
  9. 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.
  10. Haake,C., 2004. "Dividing by demanding : object division through market procedures," Working Papers 359, Bielefeld University, Center for Mathematical Economics.
  11. Tayfun Sönmez & M. Utku Ünver, 2005. "Course Bidding at Business Schools," Boston College Working Papers in Economics 618, Boston College Department of Economics.
  12. 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.
  13. 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.
  14. 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, vol. 19(4), pages 723-749.
  15. 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.
  16. 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.
  17. 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.
  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.
This information is provided to you by IDEAS at the Research Division of the Federal Reserve Bank of St. Louis using RePEc data.