Network topology and equilibrium existence in weighted network congestion games

DOI10.1007/S00182-014-0443-9zbMATH Open1388.91071OpenAlexW3124816968MaRDI QIDQ495752FDOQ495752

Authors: 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

Recommendations

• Representation of finite games as network congestion games
• On the existence of pure Nash equilibria in weighted congestion games
• On the existence of pure Nash equilibria in weighted congestion games
• On the complexity of pure-strategy Nash equilibria in congestion and local-effect games
• The complexity of pure equilibria in mix-weighted congestion games on parallel links

zbMATH Keywords

congestion gamesnetwork gamesexistence of pure-strategy equilibriumfinite improvement property

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• The directed subgraph homeomorphism problem
• Potential games
• Title not available (Why is that?)
• Best response equivalence
• Selfish unsplittable flows
• Theory of Matroids
• Congestion games with player-specific payoff functions
• The complexity of pure Nash equilibria
• Equilibrium points of nonatomic games
• Pure Nash equilibria in player-specific and weighted congestion games
• Network structure and strong equilibrium in route selection games.
• Approximation and Online Algorithms
• Atomic resource sharing in noncooperative networks
• Network topology and the efficiency of equilibrium
• Topological Uniqueness of the Nash Equilibrium for Selfish Routing with Atomic Users
• Topological Conditions for Uniqueness of Equilibrium in Networks
• Strong equilibrium in congestion games
• On the complexity of pure-strategy Nash equilibria in congestion and local-effect games
• Title not available (Why is that?)
• Implementability of correlated and communication equilibrium outcomes in incomplete information games
• The influence of neighbourhood and choice on the complexity of finding pure Nash equilibria

Cited In (7)

• 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
• Network design with weighted players
• Weighted congestion games with separable preferences
• Network structure and strong equilibrium in route selection games.
• Internalization of social cost in congestion games
• Representation of finite games as network congestion games

This page was built for publication: Network topology and equilibrium existence in weighted network congestion games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q495752)