Algorithmic Game Theory: Mechanism Design without Money
暂无分享,去创建一个
[1] J. Stalnaker,et al. The matching program for intern placement. , 1953, Journal of medical education.
[2] L. Shapley,et al. On cores and indivisibility , 1974 .
[3] M. Satterthwaite. Strategy-proofness and Arrow's conditions: Existence and correspondence theorems for voting procedures and social welfare functions , 1975 .
[4] H. Moulin. On strategy-proofness and single peakedness , 1980 .
[5] Kim C. Border,et al. Straightforward Elections, Unanimity, and Phantom Voters , 1983 .
[6] J. V. Vate. Linear programming brings marital bliss , 1989 .
[7] Robert W. Irving,et al. The Stable marriage problem - structure and algorithms , 1989, Foundations of computing series.
[8] Alvin E. Roth,et al. Two-Sided Matching: A Study in Game-Theoretic Modeling and Analysis , 1990 .
[9] Stephen Ching,et al. Strategy-proofness and “median voters” , 1998, Int. J. Game Theory.
[10] Chung-Piaw Teo,et al. The Geometry of Fractional Stable Matchings and Its Applications , 1998, Math. Oper. Res..
[11] Hiroyuki Adachi. On a characterization of stable matchings , 2000 .
[12] Salvador Barberà,et al. An introduction to strategy-proof social choice functions , 2001, Soc. Choice Welf..
[13] Tamás Fleiner,et al. Some results on stable matchings and fixed points , 2002 .
[14] Rakesh V. Vohra,et al. Strategy-proof Location on a Network , 2002, J. Econ. Theory.
[15] Paul R. Milgrom,et al. Matching with Contracts , 2005 .
[16] David Austen-Smith,et al. Positive Political Theory II: Strategy and Structure , 2005 .