Computing Approximate Nash Equilibria in Network Congestion Games with Polynomially Decreasing Cost Functions

DOI10.1007/978-3-662-48995-6_9zbMath1404.91044OpenAlexW2294349365MaRDI QIDQ3460781

Luca Moscardelli, Vittorio Bilò, Michele Flammini, Gianpiero Monaco

Publication date: 8 January 2016

Published in: Web and Internet Economics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-48995-6_9

zbMATH Keywords

network congestion gamesapproximate Nash equilibria computationShapley cost sharing value

Mathematics Subject Classification ID

Cooperative games (91A12) Games involving graphs (91A43) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Software, source code, etc. for problems pertaining to game theory, economics, and finance (91-04)

Related Items (2)

Computing approximate Nash equilibria in network congestion games with polynomially decreasing cost functions ⋮ On approximate pure Nash equilibria in weighted congestion games with polynomial latencies

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improved approximation algorithms for directed Steiner forest
• How easy is local search?
• Potential games
• A class of games possessing pure-strategy Nash equilibria
• On Approximate Nash Equilibria in Network Design
• The Price of Stability for Network Design with Fair Cost Allocation
• On the impact of combinatorial structure on congestion games
• The complexity of pure Nash equilibria
• Approximation Algorithms for Directed Steiner Problems
• Efficient Computation of Approximate Pure Nash Equilibria in Congestion Games
• Equilibrium points in n -person games

This page was built for publication: Computing Approximate Nash Equilibria in Network Congestion Games with Polynomially Decreasing Cost Functions