A dynamic VCG mechanism for random allocation spaces
暂无分享,去创建一个
[1] William Vickrey,et al. Counterspeculation, Auctions, And Competitive Sealed Tenders , 1961 .
[2] Yoav Shoham,et al. Combinatorial Auctions , 2005, Encyclopedia of Wireless Networks.
[3] E. H. Clarke. Multipart pricing of public goods , 1971 .
[4] Antonio Penta,et al. Robust Dynamic Mechanism Design , 2011 .
[5] Theodore Groves,et al. Incentives in Teams , 1973 .
[6] C. d'Aspremont,et al. Incentives and incomplete information , 1979 .
[7] I. Segal,et al. Dynamic Mechanism Design: A Myersonian Approach , 2014 .
[8] Ilya Segal,et al. An Efficient Dynamic Mechanism , 2013 .
[9] Jerry R. Green,et al. Characterization of Satisfactory Mechanisms for the Revelation of Preferences for Public Goods , 1977 .
[10] D. Bergemann,et al. Robust Mechanism Design , 2003 .
[11] Noam Nisan,et al. Computationally feasible VCG mechanisms , 2000, EC '00.
[12] Vincent Conitzer,et al. Complexity of Mechanism Design , 2002, UAI.
[13] R. Myerson. MULTISTAGE GAMES WITH COMMUNICATION , 1984 .
[14] M. Satterthwaite,et al. Efficient Mechanisms for Bilateral Trading , 1983 .
[15] D. Bergemann,et al. The Dynamic Pivot Mechanism , 2008 .