Network topology and equilibrium existence in weighted network congestion games

DOI10.1007/s00182-014-0443-9zbMath1388.91071OpenAlexW3124816968MaRDI QIDQ495752

Igal Milchtaich

Publication date: 15 September 2015

Published in: International Journal of Game Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00182-014-0443-9

zbMATH Keywords

congestion gamesnetwork gamesexistence of pure-strategy equilibriumfinite improvement property

Mathematics Subject Classification ID

Noncooperative games (91A10) Games involving graphs (91A43)

Related Items

Representation of finite games as network congestion games ⋮ A polynomial-time algorithm for detecting the possibility of Braess paradox in directed graphs ⋮ Non-cooperative queueing games on a network of single server queues ⋮ Internalization of social cost in congestion games ⋮ Weighted congestion games with separable preferences

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Best response equivalence
• The influence of neighbourhood and choice on the complexity of finding pure Nash equilibria
• Network topology and the efficiency of equilibrium
• Pure Nash equilibria in player-specific and weighted congestion games
• The directed subgraph homeomorphism problem
• Strong equilibrium in congestion games
• Network structure and strong equilibrium in route selection games.
• Potential games
• Congestion games with player-specific payoff functions
• Equilibrium points of nonatomic games
• Implementability of correlated and communication equilibrium outcomes in incomplete information games
• Selfish unsplittable flows
• On the Complexity of Pure-Strategy Nash Equilibria in Congestion and Local-Effect Games
• The complexity of pure Nash equilibria
• Topological Uniqueness of the Nash Equilibrium for Selfish Routing with Atomic Users
• Topological Conditions for Uniqueness of Equilibrium in Networks
• Approximation and Online Algorithms
• Theory of Matroids
• Atomic resource sharing in noncooperative networks