Computing approximate Nash equilibria in network congestion games (Q2913950)

From MaRDI portal
Revision as of 16:48, 5 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
Computing approximate Nash equilibria in network congestion games
scientific article

    Statements

    title
    Computing approximate Nash equilibria in network congestion games (English)
    0 references
    author
    Andreas Emil Feldmann
    0 references
    Heiko Röglin
    0 references
    Berthold Vöcking
    0 references
    published in
    Networks
    0 references
    publication date
    21 September 2012
    0 references
    zbMATH Keywords
    algorithmic game theory
    0 references
    approximate Nash equilibria
    0 references
    congestion games
    0 references

    Identifiers

    DOI
    10.1002/net.20444
    0 references
    Mathematics Subject Classification ID
    91A43
    0 references
    90B10
    0 references
    90B22
    0 references
    zbMATH DE Number
    6085246
    0 references
    OpenAlex ID
    W2147373582
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2913950&oldid=35300017"
    Powered by MediaWiki