The complexity of welfare maximization in congestion games

DOI10.1002/net.20439zbMath1241.91047MaRDI QIDQ2892161

Carol A. Meyers, Andreas S. Schulz

Publication date: 18 June 2012

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20439

zbMATH Keywords

computational complexity; congestion games; multicommodity flows; network optimization

Mathematics Subject Classification ID

90B22: Queues and service in operations research

91B15: Welfare economics

Related Items

A logarithmic approximation for polymatroid congestion games, Approximate separable multichoice optimization over monotone systems, Fault-Tolerant Aggregate Signatures, Hierarchical Network Formation Games

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Selfish load balancing and atomic congestion games
• The price of selfish routing
• The directed subgraph homeomorphism problem
• Congestion games with player-specific payoff functions
• A class of games possessing pure-strategy Nash equilibria
• Selfish unsplittable flows
• Generic Uniqueness of Equilibrium in Large Crowding Games
• Computing equilibria for a service provider game with (Im)perfect information
• Tight bounds for worst-case equilibria
• On the Complexity of Pure-Strategy Nash Equilibria in Congestion and Local-Effect Games
• The Price of Stability for Network Design with Fair Cost Allocation
• The complexity of pure Nash equilibria
• Send-and-Split Method for Minimum-Concave-Cost Network Flows
• Efficiency Loss in a Network Resource Allocation Game
• Approximation and Online Algorithms
• Computing correlated equilibria in multi-player games