On the hardness of optimal auctions
暂无分享,去创建一个
[1] Giuseppe Lopomo. Optimality and Robustness of the English Auction , 2001, Games Econ. Behav..
[2] Andrew V. Goldberg,et al. Competitive auctions and digital goods , 2001, SODA '01.
[3] Noam Nisan,et al. Competitive analysis of online auctions , 2000 .
[4] William Vickrey,et al. Counterspeculation, Auctions, And Competitive Sealed Tenders , 1961 .
[5] Richard P. McLean,et al. Optimal Selling Strategies under Uncertainty for a Discriminating Monopolist When Demands Are Interdependent , 1985 .
[6] Noga Alon,et al. The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.
[7] T. N. Sriram. Asymptotics in Statistics–Some Basic Concepts , 2002 .
[8] Amir Ronen. On Approximating Optimal Auctions (Extended Abstract) , 2001 .
[9] P. Bag. Optimal auction design and R&D , 1997 .
[10] Noam Nisan,et al. Algorithmic mechanism design (extended abstract) , 1999, STOC '99.
[11] Amir Ronen,et al. Algorithms for Rational Agents , 2000, SOFSEM.
[12] Jeffrey C. Ely,et al. Ex-Post Incentive Compatible Mechanism Design , 2002 .
[13] Felix Wu,et al. Incentive-compatible online auctions for digital goods , 2002, SODA '02.
[14] Andrew V. Goldberg,et al. Competitive Auctions for Multiple Digital Goods , 2001, ESA.
[15] Sven de Vries,et al. Combinatorial Auctions: A Survey , 2003, INFORMS J. Comput..
[16] P. Klemperer. The Economic Theory of Auctions , 2000 .