---
res:
bibo_abstract:
- "We study the problem of computing approximate Nash equilibria (epsilon-Nash\r\nequilibria)
in normal form games, where the number of players is a small\r\nconstant. We consider
the approach of looking for solutions with constant\r\nsupport size. It is known
from recent work that in the 2-player case, a\r\n1/2-Nash equilibrium can be easily
found, but in general one cannot achieve a\r\nsmaller value of epsilon than 1/2.
In this paper we extend those results to the\r\nk-player case, and find that epsilon
= 1-1/k is feasible, but cannot be\r\nimproved upon. We show how stronger results
for the 2-player case may be used\r\nin order to slightly improve upon the epsilon
= 1-1/k obtained in the k-player\r\ncase.@eng"
bibo_authorlist:
- foaf_Person:
foaf_givenName: Patrick
foaf_name: Briest, Patrick
foaf_surname: Briest
- foaf_Person:
foaf_givenName: Paul W.
foaf_name: Goldberg, Paul W.
foaf_surname: Goldberg
- foaf_Person:
foaf_givenName: Heiko
foaf_name: Roeglin, Heiko
foaf_surname: Roeglin
dct_date: 2008^xs_gYear
dct_language: eng
dct_title: Approximate Equilibria in Games with Few Players@
...