A note on the undercut procedure
暂无分享,去创建一个
[1] Alvin E. Roth,et al. Sorority Rush as a Two-Sided Matching Mechanism , 1991 .
[2] Ramaswamy Chandrasekaran,et al. A Class of Sequential Games , 1971, Oper. Res..
[3] Toby Walsh,et al. Fair assignment of indivisible objects under ordinal preferences , 2013, AAMAS.
[4] Steven J. Brams,et al. Fair division - from cake-cutting to dispute resolution , 1998 .
[5] Parag A. Pathak,et al. The New York City High School Match , 2005 .
[6] Steven J. Brams,et al. The undercut procedure: an algorithm for the envy-free division of indivisible items , 2009, Soc. Choice Welf..
[7] D. Marc Kilgour,et al. Fair division of indivisible items between two players: design parameters for Contested Pile methods , 2014 .
[8] Yann Chevaleyre,et al. Issues in Multiagent Resource Allocation , 2006, Informatica.
[9] W. Bossert,et al. Ranking Sets of Objects , 2001 .
[10] D. Marc Kilgour,et al. Strategic Behavior in Contested-Pile Methods for Fair Division of Indivisible Items , 2013 .