Well supported approximate equilibria in bimatrix games (Q973002)

From MaRDI portal
Revision as of 21:40, 2 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    0 references
    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
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    bimatrix games
    0 references
    well supported approximate Nash equilibria
    0 references
    0 references