Lower bounds for the query complexity of equilibria in Lipschitz games (Q2670917)

From MaRDI portal
Revision as of 05:32, 29 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
Lower bounds for the query complexity of equilibria in Lipschitz games
scientific article

    Statements

    title
    Lower bounds for the query complexity of equilibria in Lipschitz games (English)
    0 references
    author
    Paul W. Goldberg
    0 references
    Matthew J. Katzman
    0 references
    publication date
    1 June 2022
    0 references
    zbMATH Keywords
    query complexity
    0 references
    Lipschitz games
    0 references
    Nash equilibrium
    0 references

    Identifiers

    zbMATH DE Number
    7535988
    0 references
    OpenAlex ID
    W3202943119
    0 references
    arXiv ID
    2107.03898
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2670917&oldid=36812150"
    Powered by MediaWiki