Assessing the Robustness of Cremer-McLean with Automated Mechanism Design
暂无分享,去创建一个
Vincent Conitzer | Michael Albert | Giuseppe Lopomo | Giuseppe Lopomo | Michael Albert | Vincent Conitzer
[1] E. Maasland,et al. Auction Theory , 2021, Springer Texts in Business and Economics.
[2] Giuseppe Lopomo. The English Auction Is Optimal Among Simple Sequential Auctions , 1998 .
[3] Richard P. McLean,et al. Optimal Selling Strategies under Uncertainty for a Discriminating Monopolist When Demands Are Interdependent , 1985 .
[4] Amin Saberi,et al. On the hardness of optimal auctions , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..
[5] A. Raftery,et al. Strictly Proper Scoring Rules, Prediction, and Estimation , 2007 .
[6] Narendra Karmarkar,et al. A new polynomial-time algorithm for linear programming , 1984, Comb..
[7] Tim Roughgarden,et al. Simple versus optimal mechanisms , 2009, SECO.
[8] Roger B. Myerson,et al. Game theory - Analysis of Conflict , 1991 .
[9] Vincent Conitzer,et al. Computationally Feasible Automated Mechanism Design: General Approach and Case Studies , 2010, AAAI.
[10] Vincent Conitzer,et al. Self-interested automated mechanism design and implications for optimal combinatorial auctions , 2004, EC '04.
[11] Vincent Conitzer,et al. Complexity of Mechanism Design , 2002, UAI.
[12] Tuomas Sandholm,et al. Approximating Revenue-Maximizing Combinatorial Auctions , 2005, AAAI.