Well supported approximate equilibria in bimatrix games (Q973002): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q169706
Property / author
 
Property / author: Q239694 / rank
Normal rank
 

Revision as of 06:27, 10 February 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
    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