The complexity of welfare maximization in congestion games (Q2892161): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1002/net.20439 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2110166550 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Price of Stability for Network Design with Fair Cost Allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4258216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing equilibria for a service provider game with (Im)perfect information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bounds for worst-case equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Pure-Strategy Nash Equilibria in Congestion and Local-Effect Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Send-and-Split Method for Minimum-Concave-Cost Network Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of pure Nash equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: The directed subgraph homeomorphism problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selfish unsplittable flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation and Online Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficiency Loss in a Network Resource Allocation Game / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3409969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The price of selfish routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Congestion games with player-specific payoff functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generic Uniqueness of Equilibrium in Large Crowding Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing correlated equilibria in multi-player games / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of games possessing pure-strategy Nash equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selfish load balancing and atomic congestion games / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:19, 5 July 2024

scientific article
Language Label Description Also known as
English
The complexity of welfare maximization in congestion games
scientific article

    Statements

    The complexity of welfare maximization in congestion games (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    18 June 2012
    0 references
    0 references
    congestion games
    0 references
    network optimization
    0 references
    multicommodity flows
    0 references
    computational complexity
    0 references
    0 references