Random Bimatrix Games Are Asymptotically Easy to Solve (A Simple Proof)

  • Panagiota N. Panagopoulou
  • Paul G. Spirakis
Conference paper

DOI: 10.1007/978-3-642-24829-0_18

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6982)
Cite this paper as:
Panagopoulou P.N., Spirakis P.G. (2011) Random Bimatrix Games Are Asymptotically Easy to Solve (A Simple Proof). In: Persiano G. (eds) Algorithmic Game Theory. SAGT 2011. Lecture Notes in Computer Science, vol 6982. Springer, Berlin, Heidelberg

Abstract

We focus on the problem of computing approximate Nash equilibria and well-supported approximate Nash equilibria in random bimatrix games, where each player’s payoffs are bounded and independent random variables, not necessarily identically distributed, but with common expectations. We show that the completely mixed uniform strategy profile, i.e. the combination of mixed strategies (one per player) where each player plays with equal probability each one of her available pure strategies, is with high probability a \(\sqrt{\frac{\ln n}{n}}\)-Nash equilibrium and a \(\sqrt{\frac{3\ln n}{n}}\)-well supported Nash equilibrium, where n is the number of pure strategies available to each player. This asserts that the completely mixed, uniform strategy profile is an almost Nash equilibrium for random bimatrix games, since it is, with high probability, an ε-well-supported Nash equilibrium where ε tends to zero as n tends to infinity.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Panagiota N. Panagopoulou
    • 2
  • Paul G. Spirakis
    • 1
    • 2
  1. 1.Computer Engineering and Informatics DepartmentPatras UniversityGreece
  2. 2.Research Academic Computer Technology InstituteGreece

Personalised recommendations