暂无分享,去创建一个
Pasin Manurangsi | Martin Hoefer | Alexandros Psomas | Pasin Manurangsi | M. Hoefer | Alexandros Psomas
[1] Rann Smorodinsky,et al. The Secretary Recommendation Problem , 2020, EC.
[2] Joel Watson,et al. Hard Evidence and Mechanism Design , 2002, Games Econ. Behav..
[3] Prasad Raghavendra,et al. Optimal algorithms and inapproximability results for every CSP? , 2008, STOC.
[4] Per Austrin,et al. Balanced max 2-sat might not be the hardest , 2007, STOC '07.
[5] Itai Sher,et al. Persuasion and dynamic communication , 2014 .
[6] Uriel Feige,et al. Approximating the value of two power proof systems, with applications to MAX 2SAT and MAX DICUT , 1995, Proceedings Third Israel Symposium on the Theory of Computing and Systems.
[7] A. Rubinstein,et al. On Optimal Rules of Persuasion , 2004 .
[8] Subhash Khot,et al. Hardness of Bipartite Expansion , 2016, ESA.
[9] David P. Williamson,et al. .879-approximation algorithms for MAX CUT and MAX 2SAT , 1994, STOC '94.
[10] Viggo Kann,et al. Some APX-completeness results for cubic graphs , 2000, Theor. Comput. Sci..
[11] Haifeng Xu,et al. Algorithmic Persuasion with No Externalities , 2017, EC.
[12] Shaddin Dughmi,et al. On the hardness of designing public signals , 2019, Games Econ. Behav..
[13] Sanford J. Grossman. The Informational Role of Warranties and Private Disclosure about Product Quality , 1981, The Journal of Law and Economics.
[14] Uri Zwick,et al. Improved Rounding Techniques for the MAX 2-SAT and MAX DI-CUT Problems , 2002, IPCO.
[15] Ariel Rubinstein,et al. A study in the pragmatics of persuasion: a game theoretical approach , 2006 .
[16] Rann Smorodinsky,et al. Prophet Inequalities for Bayesian Persuasion , 2020, IJCAI.
[17] Moshe Tennenholtz,et al. Signaling Schemes for Revenue Maximization , 2012, TEAC.
[18] J. Håstad. Clique is hard to approximate withinn1−ε , 1999 .
[19] Joel Sobel,et al. Giving and Receiving Advice * , 2022 .
[20] Martin Hoefer,et al. Algorithms for Persuasion with Limited Communication , 2020, SODA.
[21] Emir Kamenica,et al. Bayesian Persuasion , 2009 .
[22] Haifeng Xu,et al. Algorithmic Bayesian persuasion , 2015, STOC.
[23] Per Austrin. Towards Sharp Inapproximability For Any 2-CSP , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).
[24] S. Matthew Weinberg,et al. Persuasion and Incentives Through the Lens of Duality , 2019, WINE.
[25] Shaddin Dughmi,et al. Persuasion with Limited Communication , 2016, EC.
[26] Ran Raz. A Parallel Repetition Theorem , 1998, SIAM J. Comput..
[27] Itai Sher,et al. Credibility and determinism in a game of persuasion , 2011, Games Econ. Behav..
[28] Farid Alizadeh,et al. Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization , 1995, SIAM J. Optim..
[29] Gabriel Carroll,et al. Strategic Communication With Minimal Verification , 2019, Econometrica.
[30] Prasad Raghavendra,et al. How to Round Any CSP , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.
[31] Paul R. Milgrom,et al. Good News and Bad News: Representation Theorems and Applications , 1981 .