Well Supported Approximate Equilibria in Bimatrix Games |
| |
| Authors: | Spyros C. Kontogiannis Paul G. Spirakis |
| |
| Affiliation: | 1. Department of Computer Science, University of Ioannina, 45110, Ioannina, Greece
2. Research Academic Computer Technology Institute, N. Kazantzaki Str., Patra University Campus, 26500, Rio-Patra, Greece
|
| |
| Abstract: | In view of the apparent intractability of constructing Nash Equilibria (NE in short) in polynomial time, even for bimatrix games, understanding the limitations of the approximability of the problem is an important challenge. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
