Representation of finite games as network congestion games

DOI10.1007/s00182-012-0363-5zbMath1362.91010OpenAlexW2108785983MaRDI QIDQ378323

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

zbMATH Keywords

congestion gamespotential gamesnetwork gamesgame isomorphism

Mathematics Subject Classification ID

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

Related Items (4)

Dynamics of large cooperative pulsed-coupled networks ⋮ Congestion Games with Variable Demands ⋮ Traffic congestion pricing via network congestion game approach ⋮ Internalization of social cost in congestion games

Cites Work

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

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