Computing Approximate Nash Equilibria in Network Congestion Games with Polynomially Decreasing Cost Functions (Q3460781)

From MaRDI portal
Revision as of 08:00, 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
Computing Approximate Nash Equilibria in Network Congestion Games with Polynomially Decreasing Cost Functions
scientific article

    Statements

    Computing Approximate Nash Equilibria in Network Congestion Games with Polynomially Decreasing Cost Functions (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    8 January 2016
    0 references
    network congestion games
    0 references
    approximate Nash equilibria computation
    0 references
    Shapley cost sharing value
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references