Approximate Pure Nash Equilibria via Lovász Local Lemma
暂无分享,去创建一个
[1] Aranyak Mehta,et al. Progress in approximate nash equilibria , 2007, EC '07.
[2] Paul W. Goldberg,et al. The complexity of computing a Nash equilibrium , 2006, STOC '06.
[3] Edith Elkind,et al. Nash equilibria in graphical games on trees revisited , 2006, EC '06.
[4] Robin A. Moser. A constructive proof of the Lovász local lemma , 2008, STOC '09.
[5] Aaas News,et al. Book Reviews , 1893, Buffalo Medical and Surgical Journal.
[6] Xiaotie Deng,et al. Settling the Complexity of Two-Player Nash Equilibrium , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).
[7] R. Rosenthal. A class of games possessing pure-strategy Nash equilibria , 1973 .
[8] Vahab S. Mirrokni,et al. Maximizing Non-Monotone Submodular Functions , 2011, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).
[9] Éva Tardos,et al. Near-Optimal Network Design with Selfish Agents , 2008, Theory Comput..
[10] Kazuoki Azuma. WEIGHTED SUMS OF CERTAIN DEPENDENT RANDOM VARIABLES , 1967 .
[11] Noga Alon,et al. The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.
[12] Adrian Vetta,et al. Nash equilibria in competitive societies, with applications to facility location, traffic routing and auctions , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..
[13] Christos H. Papadimitriou,et al. Computing pure nash equilibria in graphical games via markov random fields , 2006, EC '06.
[14] Paul W. Goldberg,et al. The Complexity of Computing a Nash Equilibrium , 2009, SIAM J. Comput..
[15] W. Hoeffding. Probability Inequalities for sums of Bounded Random Variables , 1963 .
[16] M. Talagrand. Concentration of measure and isoperimetric inequalities in product spaces , 1994, math/9406212.
[17] Johan Håstad,et al. Some optimal inapproximability results , 2001, JACM.
[18] Berthold Vöcking,et al. Inapproximability of pure nash equilibria , 2008, STOC.
[19] Michael L. Littman,et al. Graphical Models for Game Theory , 2001, UAI.
[20] Christos H. Papadimitriou,et al. The complexity of pure Nash equilibria , 2004, STOC '04.
[21] D. Alling. Early Decision in the Wilcoxon Two-Sample Test , 1963 .
[22] Vahab S. Mirrokni,et al. Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints , 2009, SIAM J. Discret. Math..
[23] Nargiss Mouatta. The Lovász local lemma , 2008 .
[24] P. Erdos-L Lovász. Problems and Results on 3-chromatic Hypergraphs and Some Related Questions , 2022 .
[25] Tim Roughgarden,et al. The Price of Stability for Network Design with Fair Cost Allocation , 2004, FOCS.
[26] Tim Roughgarden,et al. The price of stability for network design with fair cost allocation , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.