Well supported approximate equilibria in bimatrix games (Q973002): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 20:41, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Well supported approximate equilibria in bimatrix games |
scientific article |
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
