Atomic Congestion Games Among Coalitions

DOI10.1007/11786986_50zbMath1223.91015OpenAlexW1855439694WikidataQ59818626 ScholiaQ59818626MaRDI QIDQ3613791

Dimitris Fotakis, Spyros C. Kontogiannis, Paul G. Spirakis

Publication date: 12 March 2009

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11786986_50

zbMATH Keywords

coalitionsgame theoryprice of anarchyconvergence to equilibriaatomic congestion games

Mathematics Subject Classification ID

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

Related Items (22)

Cost-Sharing in Generalised Selfish Routing ⋮ Partition Equilibrium Always Exists in Resource Selection Games ⋮ Concurrent imitation dynamics in congestion games ⋮ Strong equilibrium in cost sharing connection games ⋮ The structure and complexity of Nash equilibria for a selfish routing game ⋮ A Glimpse at Paul G. Spirakis ⋮ Rationality Authority for Provable Rational Behavior ⋮ Social context congestion games ⋮ Equilibria for two parallel links: the strong price of anarchy versus the price of anarchy ⋮ Characterizing the existence of potential functions in weighted congestion games ⋮ Equilibrium and potential in coalitional congestion games ⋮ Selfish Bin Packing ⋮ Strong Nash equilibrium in games with common and complementary local utilities ⋮ Collusion in Atomic Splittable Routing Games ⋮ Selfish bin packing ⋮ Stackelberg strategies and collusion in network games with splittable flow ⋮ Atomic congestion games: fast, myopic and concurrent ⋮ Stackelberg Strategies and Collusion in Network Games with Splittable Flow ⋮ Coordinating oligopolistic players in unrelated machine scheduling ⋮ On the Existence of Pure Nash Equilibria in Weighted Congestion Games ⋮ Atomic Congestion Games: Fast, Myopic and Concurrent ⋮ Strong price of anarchy

This page was built for publication: Atomic Congestion Games Among Coalitions