Automated mechanism design for a self-interested designer
暂无分享,去创建一个
[1] Vincent Conitzer,et al. Computational criticisms of the revelation principle , 2004, EC '04.
[2] William Vickrey,et al. Counterspeculation, Auctions, And Competitive Sealed Tenders , 1961 .
[3] A. Mas-Colell,et al. Microeconomic Theory , 1995 .
[4] Y. Shoham,et al. Truth revelation in rapid, approximately efficient combinatorial auctions , 2001 .
[5] Rajeev Kohli,et al. The Minimum Satisfiability Problem , 1994, SIAM J. Discret. Math..
[6] F. Hahn,et al. Optimal Multi-Unit Auctions , 1989 .
[7] Roger B. Myerson,et al. Optimal Auction Design , 1981, Math. Oper. Res..
[8] E. H. Clarke. Multipart pricing of public goods , 1971 .
[9] Theodore Groves,et al. Incentives in Teams , 1973 .
[10] C. d'Aspremont,et al. Incentives and incomplete information , 1979 .
[11] Vincent Conitzer,et al. Complexity of Mechanism Design , 2002, UAI.
[12] Tuomas Sandholm,et al. Issues in Computational Vickrey Auctions , 2000, Int. J. Electron. Commer..
[13] M. Satterthwaite. Strategy-proofness and Arrow's conditions: Existence and correspondence theorems for voting procedures and social welfare functions , 1975 .
[14] K. Arrow. The Property Rights Doctrine and Demand Revelation under Incomplete Information**This work was supported by National Science Foundation under Grant No. SOC75-21820 at the Institute for Mathematical Studies in the Social Sciences, Stanford University. , 1979 .
[15] Tim Roughgarden,et al. Designing networks for selfish users is hard , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.