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, Julius B. & Brams, Steven J., 2010. "Two-person pie-cutting: The fairest cuts," MPRA Paper 22703, University Library of Munich, Germany.
  2. Chakravarty, Surajeet & Kaplan, Todd R., 2006. "Optimal Allocation without Transfer Payments," MPRA Paper 18481, University Library of Munich, Germany, revised 02 Mar 2009.
  3. 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.
  4. Tayfun Sönmez & M. Utku Ünver, 2010. "Course Bidding At Business Schools," International Economic Review, Department of Economics, University of Pennsylvania and Osaka University Institute of Social and Economic Research Association, vol. 51(1), pages 99-123, 02.
  5. 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.
  6. Velez, Rodrigo A., 2011. "Are incentives against economic justice?," Journal of Economic Theory, Elsevier, vol. 146(1), pages 326-345, January.
  7. 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.
  8. 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.
  9. 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.
  10. 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.
  11. Carlo Carraro & Carmen Marchiori & Alessandra Sgobbi, 2005. "Advances in Negotiation Theory: Bargaining, Coalitions and Fairness," Working Papers 2005.66, Fondazione Eni Enrico Mattei.
  12. 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.
  13. 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.
  14. Brams, Steven J. & Kaplan, Todd & Kilgour, D. Marc, . "A Simple Bargaining Mechanism That Elicits Truthful Reservation Prices," Working Papers WP2011/2, University of Haifa, Department of Economics, revised 22 Feb 2011.
  15. Haake,C., 2004. "Dividing by demanding : object division through market procedures," Working Papers 359, Bielefeld University, Center for Mathematical Economics.
  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. 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.
  18. 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).
This information is provided to you by IDEAS at the Research Division of the Federal Reserve Bank of St. Louis using RePEc data.