暂无分享,去创建一个
Tim Roughgarden | Paul Dütting | Inbal Talgam-Cohen | T. Roughgarden | Paul Dütting | Inbal Talgam-Cohen | Tim Roughgarden
[1] Moshe Babaioff,et al. The menu-size complexity of revenue approximation , 2016, STOC.
[2] S. Micali,et al. Computational principal–agent problems , 2018 .
[3] C. Papadimitriou. Algorithmic Game Theory: The Complexity of Finding Nash Equilibria , 2007 .
[4] Nicole Immorlica,et al. Constrained Signaling in Auction Design , 2013, SODA.
[5] Moshe Babaioff,et al. Contract complexity , 2014, EC.
[6] 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.
[7] Brendan Lucier,et al. Non-Optimal Mechanism Design , 2015 .
[8] Mikhail Y. Kovalyov,et al. A generic approach to proving NP-hardness of partition type problems , 2010, Discret. Appl. Math..
[9] Michal Feldman,et al. Computing optimal contracts in combinatorial agencies , 2012, Theor. Comput. Sci..
[10] Robert D. Kleinberg,et al. Bayesian incentive compatibility via matchings , 2011, SODA '11.
[11] Roger B. Myerson,et al. Optimal Auction Design , 1981, Math. Oper. Res..
[12] Shlomo Moran,et al. General Approximation Algorithms for some Arithmetical Combinatorial Problems , 1981, Theor. Comput. Sci..
[13] T. C. Edwin Cheng,et al. "Product Partition" and related problems of scheduling and systems reliability: Computational complexity and approximation , 2010, Eur. J. Oper. Res..
[14] Yang Cai,et al. Mechanism design : a new algorithmic framework , 2013 .
[15] Johan Håstad,et al. Some optimal inapproximability results , 2001, JACM.
[16] George A. Akerlof. The Market for “Lemons”: Quality Uncertainty and the Market Mechanism , 1970 .
[17] Li Han,et al. Mixture Selection, Mechanism Design, and Signaling , 2015, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science.
[18] Haifeng Xu,et al. Algorithmic Bayesian persuasion , 2015, STOC.
[19] Gabriel D. Carroll. A Quantitative Approach to Incentives: Application to Voting Rules (Job Market Paper) , 2011 .
[20] Florian Englmaier,et al. Contractual and Organizational Structure with Reciprocal Agents , 2008, SSRN Electronic Journal.
[21] Kevin Leyton-Brown,et al. Polynomial-time computation of exact correlated equilibrium in compact games , 2010, EC '11.
[22] Kenneth Steiglitz,et al. Combinatorial Optimization: Algorithms and Complexity , 1981 .
[23] 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.
[24] Shaddin Dughmi,et al. Bernoulli factories and black-box reductions in mechanism design , 2017, SECO.
[25] S. Matthew Weinberg,et al. Algorithms for strategic agents , 2014 .
[26] B. Kőszegi. Behavioral Contract Theory , 2014 .
[27] Gabriel D. Carroll. Robustness and Linear Contracts , 2015 .
[28] Nikhil R. Devanur,et al. A duality based unified approach to Bayesian mechanism design , 2016, STOC.
[29] Sanford J. Grossman,et al. AN ANALYSIS OF THE PRINCIPAL-AGENT PROBLEM , 1983 .
[30] Richard M. Karp,et al. An efficient approximation scheme for the one-dimensional bin-packing problem , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[31] Benjamin E. Hermalin,et al. Hidden-Information Agency , 2000 .
[32] Yang Cai,et al. Understanding Incentives: Mechanism Design Becomes Algorithm Design , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.
[33] S. Matthew Weinberg,et al. The Sample Complexity of Up-to-ε Multi-Dimensional Revenue Maximization , 2018, 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS).
[34] Shaddin Dughmi,et al. On the Hardness of Signaling , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.
[35] Vahab S. Mirrokni,et al. Tight Approximation Algorithms for Maximum Separable Assignment Problems , 2019 .
[36] Jon M. Kleinberg,et al. Delegated Search Approximates Efficient Search , 2018, EC.
[37] George A. Akerlof. Labor Contracts as Partial Gift Exchange , 1982 .
[38] Robert D. Carr,et al. Randomized metarounding , 2002, Random Struct. Algorithms.
[39] When are Robust Contracts Linear?∗ , 2019 .
[40] Raphael Yuster,et al. A (1-1/e)-approximation algorithm for the generalized assignment problem , 2006, Oper. Res. Lett..
[41] Tim Roughgarden,et al. Simple versus Optimal Contracts , 2018, EC.
[42] Bernard Salanié,et al. The Economics of Contracts: A Primer , 1997 .
[43] Mohammad R. Salavatipour,et al. Packing Steiner trees , 2003, SODA '03.
[44] Yannai A. Gonczarowski. Bounding the menu-size of approximately optimal auctions via optimal-transport duality , 2017, STOC.
[45] Aleksandrs Slivkins,et al. Adaptive Contract Design for Crowdsourcing Markets: Bandit Algorithms for Repeated Principal-Agent Problems , 2016, J. Artif. Intell. Res..
[46] S. Matthew Weinberg,et al. Symmetries and optimal multi-dimensional mechanism design , 2012, EC '12.
[47] Moshe Babaioff,et al. Combinatorial agency , 2006, EC '06.
[48] Christos H. Papadimitriou,et al. Computing correlated equilibria in multi-player games , 2005, STOC '05.
[49] Guy Kortsarz,et al. Improved approximating algorithms for Directed Steiner Forest , 2009, SODA.