The complexity of welfare maximization in congestion games (Q2892161)

From MaRDI portal
Revision as of 09:56, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
The complexity of welfare maximization in congestion games
scientific article

    Statements

    title
    The complexity of welfare maximization in congestion games (English)
    0 references
    DOI
    10.1002/net.20439
    0 references
    author
    Carol A. Meyers
    0 references
    Andreas S. Schulz
    0 references
    published in
    Networks
    0 references
    publication date
    18 June 2012
    0 references
    zbMATH DE Number
    6047280
    0 references
    zbMATH Keywords
    congestion games
    0 references
    network optimization
    0 references
    multicommodity flows
    0 references
    computational complexity
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2892161&oldid=27327120"
    Powered by MediaWiki