Congestion games with capacitated resources (Q904685)

From MaRDI portal
Revision as of 07:28, 11 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
Congestion games with capacitated resources
scientific article

    Statements

    title
    Congestion games with capacitated resources (English)
    0 references
    author
    Laurent Gourvès
    0 references
    Stefano Moretti
    0 references
    Nguyen Kim Thang
    0 references
    Jérôme Monnot
    0 references
    publication date
    13 January 2016
    0 references
    zbMATH Keywords
    congestion games
    0 references
    pure Nash equilibrium
    0 references
    potential function
    0 references
    algorithms
    0 references
    cites work
    Potential games
    0 references
    Q2934594
    0 references
    Q5414563
    0 references
    Q4198056
    0 references
    Q3109944
    0 references
    Q3409969
    0 references
    Worst-case equilibria
    0 references

    Identifiers

    Mathematics Subject Classification ID
    91B32
    0 references
    91A10
    0 references
    68Q17
    0 references
    68Q25
    0 references
    zbMATH DE Number
    6529724
    0 references
    OpenAlex ID
    W2154639153
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q904685&oldid=36223412"
    Powered by MediaWiki