Resolving Braess's paradox in random networks (Q2408090)

From MaRDI portal
Revision as of 13:10, 14 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
Resolving Braess's paradox in random networks
scientific article

    Statements

    title
    Resolving Braess's paradox in random networks (English)
    0 references
    author
    Dimitris Fotakis
    0 references
    Thanasis Lianeas
    0 references
    Alexis C. Kaporis
    0 references
    Paul G. Spirakis
    0 references
    published in
    Algorithmica
    0 references
    publication date
    9 October 2017
    0 references
    zbMATH Keywords
    algorithmic game theory
    0 references
    Braess's paradox
    0 references
    selfish routing
    0 references
    Wardrop equilibrium
    0 references
    random graphs
    0 references
    describes a project that uses
    Walksat
    0 references
    DIMACS
    0 references
    cites work
    Q2743189
    0 references
    Q4012216
    0 references
    Q3286850
    0 references
    Q3533739
    0 references
    Q5501360
    0 references
    Q5687271
    0 references

    Identifiers

    Mathematics Subject Classification ID
    91A43
    0 references
    05C80
    0 references
    90B15
    0 references
    68Q25
    0 references
    zbMATH DE Number
    6788760
    0 references
    OpenAlex ID
    W2465605381
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2408090&oldid=36349146"
    Powered by MediaWiki