Representation of finite games as network congestion games

DOI10.1007/S00182-012-0363-5zbMATH Open1362.91010OpenAlexW2108785983MaRDI QIDQ378323FDOQ378323

Authors: Igal Milchtaich 

Publication date: 11 November 2013

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

Full work available at URL: https://hal.inria.fr/hal-00644369/file/12-PID2137393.pdf

Recommendations

• scientific article; zbMATH DE number 7042529
• Congestion network problems and related games
• Complexity of pure Nash equilibria in player-specific network congestion games
• Computing approximate Nash equilibria in network congestion games
• Computing Approximate Nash Equilibria in Network Congestion Games
• Network topology and equilibrium existence in weighted network congestion games
• Finite horizon mean field games on networks
• Games with congestion-averse utilities
• Network flow problems and permutationally concave games

zbMATH Keywords

potential gamescongestion gamesnetwork gamesgame isomorphism

Mathematics Subject Classification ID

Noncooperative games (91A10) (n)-person games, (n>2) (91A06) Games involving graphs (91A43)

Cites Work

• Non-cooperative games
• A class of games possessing pure-strategy Nash equilibria
• Potential games
• Congestion games with player-specific payoff functions
• Weighted congestion games with separable preferences
• Random-player games
• Network topology and equilibrium existence in weighted network congestion games

Cited In (6)

• Congestion network problems and related games
• Monotonicity of equilibria in nonatomic congestion games
• Dynamics of large cooperative pulsed-coupled networks
• Traffic congestion pricing via network congestion game approach
• Internalization of social cost in congestion games
• Congestion games with variable demands

This page was built for publication: Representation of finite games as network congestion games

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