Hardness Results for Signaling in Bayesian Zero-Sum and Network Routing Games
暂无分享,去创建一个
Yu Cheng | Chaitanya Swamy | Umang Bhaskar | Young Kun Ko | Yu Cheng | Y. Cheng | Chaitanya Swamy | U. Bhaskar
[1] U. Feige,et al. Finding hidden cliques in linear time , 2009 .
[2] Paul R. Milgrom,et al. A theory of auctions and competitive bidding , 1982 .
[3] Ludek Kucera,et al. Expected Complexity of Graph Partitioning Problems , 1995, Discret. Appl. Math..
[4] J. Hirshleifer. The Private and Social Value of Information and the Reward to Inventive Activity , 1971 .
[5] Li Han,et al. Mixture Selection, Mechanism Design, and Signaling , 2015, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science.
[6] Aviad Rubinstein,et al. ETH-Hardness for Signaling in Symmetric Zero-Sum Games , 2015, ArXiv.
[7] Benjamin Doerr,et al. Analyzing Randomized Search Heuristics: Tools from Probability Theory , 2011, Theory of Randomized Search Heuristics.
[8] Amin Saberi,et al. Approximating nash equilibria using small-support strategies , 2007, EC '07.
[9] Mingyu Guo,et al. Revenue Maximization via Hiding Item Attributes , 2013, IJCAI.
[10] Ehud Lehrer,et al. Signaling and Mediation in Games with Common Interests , 2006, Games Econ. Behav..
[11] John Darzentas,et al. Problem Complexity and Method Efficiency in Optimization , 1983 .
[12] Russell Impagliazzo,et al. AM with Multiple Merlins , 2014, 2014 IEEE 29th Conference on Computational Complexity (CCC).
[13] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[14] Alessandro Panconesi,et al. Concentration of Measure for the Analysis of Randomized Algorithms , 2009 .
[15] Liz Malm,et al. The Market for “ Lemons : ” Quality Uncertainty and the Market Mechanism Presented by Team , 2012 .
[16] Benjamin A. Brooks,et al. The Limits of Price Discrimination , 2013 .
[17] George A. Akerlof. The Market for “Lemons”: Quality Uncertainty and the Market Mechanism , 1970 .
[18] Moshe Tennenholtz,et al. Signaling Schemes for Revenue Maximization , 2012, TEAC.
[19] Mark Jerrum,et al. Large Cliques Elude the Metropolis Process , 1992, Random Struct. Algorithms.
[20] Robert Krauthgamer,et al. The Probable Value of the Lovász--Schrijver Relaxations for Maximum Independent Set , 2003, SIAM J. Comput..
[21] Tim Roughgarden,et al. How bad is selfish routing? , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[22] Shaddin Dughmi,et al. On the Hardness of Signaling , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.
[23] Robert Krauthgamer,et al. How hard is it to approximate the best Nash equilibrium? , 2009, SODA.
[24] Peter Bro Miltersen,et al. Send mixed signals: earn more, work less , 2012, EC '12.
[25] D. Blackwell. Comparison of Experiments , 1951 .
[26] Vincent Conitzer,et al. Computing the optimal strategy to commit to , 2006, EC '06.
[27] Mark Braverman,et al. Approximating the best Nash Equilibrium in no(log n)-time breaks the Exponential Time Hypothesis , 2015, Electron. Colloquium Comput. Complex..
[28] Yuval Peres,et al. Finding Hidden Cliques in Linear Time with High Probability , 2010, Combinatorics, Probability and Computing.
[29] Richard Cole,et al. How much can taxes help selfish routing? , 2003, EC '03.
[30] J. G. Pierce,et al. Geometric Algorithms and Combinatorial Optimization , 2016 .
[31] Nicole Immorlica,et al. Constrained Signaling in Auction Design , 2013, SODA.
[32] Tim Roughgarden,et al. How bad is selfish routing? , 2002, JACM.
[33] Avinatan Hassidim,et al. Implementing the Wisdom of Waze , 2015, IJCAI.
[34] Stephen A. Vavasis,et al. Convex optimization for the planted k-disjoint-clique problem , 2010, Math. Program..
[35] Ari Juels,et al. Hiding Cliques for Cryptographic Security , 1998, SODA '98.
[36] Santosh S. Vempala,et al. Statistical Algorithms and a Lower Bound for Detecting Planted Cliques , 2012, J. ACM.