Computing approximate Nash equilibria in network congestion games (Q2913950)

From MaRDI portal
Revision as of 20:12, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
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=31703090"
    Powered by MediaWiki