Empirical Distribution of Equilibrium Play and Its Testing Application

References

• Althöfer I (1994) On sparse approximations to randomized strategies and convex combinations. Linear Algebra Its Appl. 199:339–355.Crossref, Google Scholar
• Aumann RJ (1974) Subjectivity and correlation in randomized strategies. J. Math. Econom. 1(1):67–96.Crossref, Google Scholar
• Batu T, Fortnow L, Rubinfeld R, Smith WD, White P (2000) Testing that distributions are close. Prod. 41st Annual Sympos. Foundations Comput. Sci., FOC ’00 (IEEE Computer Society, Washington, DC), 259–269.Crossref, Google Scholar
• Batu T, Fortnow L, Rubinfeld R, Smith WD, White P (2013) Testing closeness of discrete distributions. J. ACM 60(1):4.Crossref, Google Scholar
• Batu T, Fischer E, Fortnow L, Kumar R, Rubinfeld R, White P (2001) Testing random variables for independence and identity. Prod. 42nd Annual Sympos. Foundations Comput. Sci., FOC ’01 (IEEE Computer Society, Washington, DC), 442–451.Crossref, Google Scholar
• Chan S-O, Diakonikolas I, Valiant P, Valiant G (2014) Optimal algorithms for testing closeness of discrete distributions. Chekuri C, ed. Proc. 25th Annual ACM-SIAM Sympos. Discreet Algorithms, SODA ’14 (SIAM, Philadelphia), 1193–1203.Crossref, Google Scholar
• Cressie N, Read TRC (1984) Multinomial goodness-of-fit tests. J. Roy. Statist. Soc. Ser. B (Methodological) 440–464.Google Scholar
• Farach-Colton M, Mosteiro MA (2007) Sensor network gossiping, or how to break the broadcast lower bound. Tokuyama T, ed. Algorithms and Computation (Springer, Berlin), 232–243.Crossref, Google Scholar
• Germano F, Lugosi G (2007) Existence of sparsely supported correlated equilibria. Econom. Theory 32(3):575–578.Crossref, Google Scholar
• Goldreich O, Ron D (2011) On testing expansion in bounded-degree graphs. Goldreich O, ed. Studies in Complexity and Cryptography. Miscellanea on the Interplay Between Randomness and Computation (Springer, Berlin), 68–75.Crossref, Google Scholar
• Hannan J (1957) Approximation to bayes risk in repeated play. Contributions to the Theory of Games 3:97–139.Google Scholar
• Hart S, Mas-Colell A, Babichenko Y (2013) Simple Adaptive Strategies: From Regret-Matching to Uncoupled Dynamics, Vol. 4 (World Scientific Publishing, Singapore).Crossref, Google Scholar
• Hémon S, de Rougemont M, Santha M (2008) Approximate Nash equilibria for multi-player games. Monien B, Schroeder U-P, eds. Algorithmic Game Theory: First Internat. Sympos., SAGT 2008 (Springer, Berlin), 267–278.Crossref, Google Scholar
• Hoeffding W (1963) Probability inequalities for sums of bounded random variables. J. Amer. Statist. Assoc. 58(301):13–30.Crossref, Google Scholar
• Lipton RJ, Markakis E, Mehta A (2003) Playing large games using simple strategies. Proc. 4th ACM Conf. Electronic Commerce, EC ’04 (ACM, New York), 36–41.Crossref, Google Scholar
• Nash J (1951) Non-cooperative games. Ann. Math. 54(2):286–295.Crossref, Google Scholar
• Nisan N (2009) Approximate Nash: Turing’s invisible hand: Computation, economics and game theory. Accessed July 4, 2014, http://agtb.wordpress.com/2009/06/07/approximate-nash/.Google Scholar
• Siotani M, Fujikoshi Yet al. (1984) Asymptotic approximations for the distributions of multinomial goodness-of-fit statistics. Hiroshima Math. J. 14(1):115–124.Crossref, Google Scholar
• Valiant G, Valiant P, Bhattacharyya A, Fischer E, Rubinfeld R (2013) Instance-by-instance optimal identity testing. Electronic Colloquium on Computational Complexity (ECCC), Vol. 20, 111.Google Scholar