Random bimatrix games are asymptotically easy to solve (a simple proof) (Q1678770)

From MaRDI portal
Revision as of 16:56, 14 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
Random bimatrix games are asymptotically easy to solve (a simple proof)
scientific article

    Statements

    Random bimatrix games are asymptotically easy to solve (a simple proof) (English)
    0 references
    7 November 2017
    0 references
    approximate Nash equilibrium
    0 references
    bimatrix game
    0 references
    random game
    0 references
    Hoeffding bounds
    0 references

    Identifiers