Cooperative congestion games: existence of a Nash-stable coalition structure

DOI10.1007/s11590-021-01847-5zbMath1506.91011OpenAlexW4205764287MaRDI QIDQ2091226

V. V. Gusev

Publication date: 1 November 2022

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-021-01847-5

zbMATH Keywords

congestion gamespotential gamescoalition structureNash stability

Mathematics Subject Classification ID

Cooperative games (91A12) Potential and congestion games (91A14)

Cites Work

• Unnamed Item
• Unnamed Item
• A biased random-key genetic algorithm for road congestion minimization
• Characterizing the existence of potential functions in weighted congestion games
• On best response dynamics in weighted congestion games with polynomial delays
• Pure Nash equilibria in player-specific and weighted congestion games
• A dynamic programming approach to the complete set partitioning problem
• Strong equilibrium in congestion games
• The price of anarchy for non-atomic congestion games with symmetric cost maps and elastic demands.
• Potential games
• Congestion games with player-specific payoff functions
• Nash-stable coalition partition and potential functions in games with coalition structure
• Potential functions for finding stable coalition structures
• Axiomatizations of the normalized Banzhaf value and the Shapley value
• A geometric approach to the price of anarchy in nonatomic congestion games
• A class of games possessing pure-strategy Nash equilibria
• Exact Price of Anarchy for Polynomial Congestion Games

This page was built for publication: Cooperative congestion games: existence of a Nash-stable coalition structure