A Duality-Based Unified Approach to Bayesian Mechanism Design
暂无分享,去创建一个
[1] Roger B. Myerson,et al. Optimal Auction Design , 1981, Math. Oper. Res..
[2] Jeremy I. Bulow,et al. Auctions versus Negotiations , 1996 .
[3] M. Armstrong. Multiproduct Nonlinear Pricing , 1996 .
[4] J. Laffont,et al. Optimal auction with financially constrained buyers , 1996 .
[5] J. Rochet,et al. Ironing, Sweeping, and Multidimensional Screening , 1998 .
[6] M. Armstrong. Price Discrimination by a Many-Product Firm , 1999 .
[7] Faruk Gul,et al. WALRASIAN EQUILIBRIUM WITH GROSS SUBSTITUTES , 1999 .
[8] Amir Ronen,et al. On approximating optimal auctions , 2001, EC '01.
[9] Rakesh V. Vohra,et al. Single and Multi-Dimensional Optimal Auctions - A Network Approach , 2004 .
[10] John Thanassoulis,et al. Haggling over substitutes , 2004, J. Econ. Theory.
[11] Shuchi Chawla,et al. Algorithmic pricing via virtual valuations , 2007, EC '07.
[12] Tim Roughgarden,et al. Simple versus optimal mechanisms , 2009, SECO.
[13] S. Matthew Weinberg,et al. Pricing randomized allocations , 2009, SODA '10.
[14] Shuchi Chawla,et al. The power of randomness in bayesian optimal mechanism design , 2010, EC '10.
[15] Kent E. Morrison. The FedEx Problem , 2010, 1410.6723.
[16] Shuchi Chawla,et al. Multi-parameter mechanism design and sequential posted pricing , 2010, BQGT.
[17] Robert D. Kleinberg,et al. Bayesian incentive compatibility via matchings , 2011, SODA '11.
[18] G. Pavlov,et al. Optimal Mechanism for Selling Two Goods , 2011 .
[19] Xiaohui Bei,et al. Bayesian incentive compatibility via fractional assignments , 2010, SODA '11.
[20] Noam Nisan,et al. Approximate revenue maximization with multiple items , 2012, EC '12.
[21] Yang Cai,et al. An algorithmic characterization of multi-dimensional mechanisms , 2011, STOC '12.
[22] Yang Cai,et al. Optimal Multi-dimensional Mechanism Design: Reducing Revenue to Welfare Maximization , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.
[23] Rakesh V. Vohra,et al. Optimization and mechanism design , 2012, Mathematical Programming.
[24] S. Matthew Weinberg,et al. Matroid prophet inequalities , 2012, STOC '12.
[25] Tim Roughgarden,et al. Supply-limiting mechanisms , 2012, EC '12.
[26] S. Matthew Weinberg,et al. Symmetries and optimal multi-dimensional mechanism design , 2012, EC '12.
[27] Noam Nisan,et al. The menu-size complexity of auctions , 2013, EC '13.
[28] Kamesh Munagala,et al. Optimal auctions via the multiplicative weight method , 2012, EC '13.
[29] Yang Cai,et al. Understanding Incentives: Mechanism Design Becomes Algorithm Design , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.
[30] Yang Cai,et al. Reducing Revenue to Welfare Maximization: Approximation Algorithms and other Generalizations , 2013, SODA.
[31] Andrew Chi-Chih Yao,et al. On revenue maximization for selling multiple independently distributed items , 2013, Proceedings of the National Academy of Sciences.
[32] Christos Tzamos,et al. Mechanism design via optimal transport , 2013, EC '13.
[33] Yang Cai,et al. Simple and Nearly Optimal Multi-Item Auctions , 2012, SODA.
[34] Yiannis Giannakopoulos. A Note on Optimal Auctions for Two Uniformly Distributed Items , 2014, ArXiv.
[35] Shuchi Chawla,et al. Bayesian algorithmic mechanism design , 2014, SECO.
[36] Shaddin Dughmi,et al. On the Hardness of Signaling , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.
[37] S. Matthew Weinberg,et al. A Simple and Approximately Optimal Mechanism for an Additive Buyer , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.
[38] Christos Tzamos,et al. The Complexity of Optimal Mechanism Design , 2012, SODA.
[39] Shuchi Chawla,et al. The power of randomness in Bayesian optimal mechanism design , 2015, Games Econ. Behav..
[40] Andrew Chi-Chih Yao,et al. An n-to-1 Bidder Reduction for Multi-item Auctions and its Applications , 2014, SODA.
[41] Mohammad Taghi Hajiaghayi,et al. Revenue Maximization for Selling Multiple Correlated Items , 2014, ESA.
[42] Elias Koutsoupias,et al. Selling Two Goods Optimally , 2015, ICALP.
[43] Nima Haghpanah,et al. Reverse Mechanism Design , 2014, EC.
[44] S. Matthew Weinberg,et al. Simple Mechanisms for a Subadditive Buyer and Applications to Revenue Monotonicity , 2018, ACM Trans. Economics and Comput..
[45] Gabriel D. Carroll. Robustness and Linear Contracts , 2015 .
[46] Ning Chen,et al. Competitive Analysis via Benchmark Decomposition , 2014, EC.
[47] Christos Tzamos,et al. Strong Duality for a Multiple-Good Monopolist , 2014, EC.
[48] S. Matthew Weinberg,et al. Bayesian Truthful Mechanisms for Job Scheduling from Bi-criterion Approximation Algorithms , 2014, SODA.
[49] Anna R. Karlin,et al. A Prior-Independent Revenue-Maximizing Auction for Multiple Additive Bidders , 2016, WINE.
[50] Shuchi Chawla,et al. Mechanism Design for Subadditive Agents via an Ex Ante Relaxation , 2016, EC.
[51] Haifeng Xu,et al. Algorithmic Bayesian persuasion , 2015, STOC.
[52] Yvonne Schuhmacher,et al. Mechanism Design A Linear Programming Approach , 2016 .
[53] Yang Cai,et al. Approximating Gains from Trade in Two-sided Markets via Simple Mechanisms , 2017, EC.
[54] Andrew Chi-Chih Yao,et al. Dominant-Strategy versus Bayesian Multi-item Auctions: Maximum Revenue Determination and Comparison , 2017, EC.
[55] S. Matthew Weinberg,et al. The Competition Complexity of Auctions: A Bulow-Klemperer Result for Multi-Dimensional Bidders , 2016, EC.
[56] Nikhil R. Devanur,et al. Optimal Multi-Unit Mechanisms with Private Demands , 2017, EC.
[57] Yang Cai,et al. Simple mechanisms for subadditive buyers via duality , 2016, STOC.
[58] Gabriel D. Carroll. Robustness and Separation in Multidimensional Screening , 2017 .
[59] Nikhil R. Devanur,et al. Revenue Maximization and Ex-Post Budget Constraints , 2018, ACM Trans. Economics and Comput..
[60] Hu Fu,et al. The Value of Information Concealment , 2018, SODA.
[61] Siqi Liu,et al. On the Competition Complexity of Dynamic Mechanism Design , 2018, SODA.
[62] Elias Koutsoupias,et al. Duality and optimality of auctions for uniform distributions , 2014, SIAM J. Comput..
[63] S. Matthew Weinberg,et al. A Simple and Approximately Optimal Mechanism for a Buyer with Complements , 2021, Oper. Res..