The complexity of welfare maximization in congestion games

DOI10.1002/net.20439zbMath1241.91047OpenAlexW2110166550MaRDI 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 complexitycongestion gamesmulticommodity flowsnetwork optimization

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Welfare economics (91B15)

Related Items (4)

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

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

This page was built for publication: The complexity of welfare maximization in congestion games