Collective choice under dichotomous preferences
暂无分享,去创建一个
[1] Shasikanta Nandeibam,et al. An alternative proof of Gibbard's random dictatorship result , 1998 .
[2] A. Gibbard. Manipulation of Schemes That Mix Voting with Chance , 1977 .
[3] Salvador Barberà,et al. Majority and Positional Voting in a Probabilistic Framework , 1979 .
[4] Scott Shenker,et al. Analysis and simulation of a fair queueing algorithm , 1989, SIGCOMM 1989.
[5] Salvador Barberà,et al. Strategy-Proof Probabilistic Rules for Expected Utility Maximizers , 1998 .
[6] Douglas Muzzio,et al. Approval voting , 1983 .
[7] H. Moulin,et al. Random Matching under Dichotomous Preferences , 2004 .
[8] Xavier Freixas,et al. A cardinal approach to straightforward probabilistic mechanisms , 1984 .
[9] Peter C. Fishburn,et al. Axioms for approval voting: Direct proof , 1978 .
[10] Hans Peters,et al. Strategy-Proof Probabilistic Mechanisms in Economies with Pure Public Goods , 2002, J. Econ. Theory.
[11] Scott Shenker,et al. Making greed work in networks: a game-theoretic analysis of switch service disciplines , 1995, TNET.
[12] Anna Bogomolnaia,et al. Random Matching and assignment under dichotomous preferences , 2001 .
[13] Allan Gibbard,et al. Straightforwardness of Game Forms with Lotteries as Outcomes , 1978 .
[14] Scott Shenker. Making greed work in networks: a game-theoretic analysis of gateway service disciplines , 1990, SIGMETRICS '90.