Well supported approximate equilibria in bimatrix games (Q973002)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Well supported approximate equilibria in bimatrix games |
scientific article; zbMATH DE number 5713392
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Well supported approximate equilibria in bimatrix games |
scientific article; zbMATH DE number 5713392 |
Statements
Well supported approximate equilibria in bimatrix games (English)
0 references
28 May 2010
0 references
The authors study a new notion of approximate Nash equilibria, with the first polynomial time algorithm for its construction in normalized and win lose bimatrix games.
0 references
bimatrix games
0 references
well supported approximate Nash equilibria
0 references
0 references
0 references
0.9618447422981262
0 references
0.9314298629760742
0 references
0.8961513042449951
0 references
0.8740537762641907
0 references
0.8725813627243042
0 references
