SAGT
2010
Springer
13 years 10 months ago
2010
Springer
We consider the computational complexity of coalitional solution concepts in scenarios related to load balancing such as anonymous and congestion games. In congestion games, Paret...
CORR
2008
Springer
13 years 11 months ago
2008
Springer
We study social cost losses in Facility Location games, where n selfish agents install facilities over a network and connect to them, so as to forward their local demand (expressed...
ESA
2010
Springer
14 years 20 days ago
2010
Springer
Bottleneck congestion games properly model the properties of many real-world network routing applications. They are known to possess strong equilibria