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

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00453-008-9227-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2107285505 / rank
 
Normal rank

Revision as of 21:14, 19 March 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
    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