Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
149
Voted
SAGT
2010
Springer
181
views
Game Theory
»
more
SAGT 2010
»
On the Complexity of Pareto-optimal Nash and Strong Equilibria
15 years 2 months ago
Download
www-i1.informatik.rwth-aachen.de
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...
Martin Hoefer, Alexander Skopalik
claim paper
Read More »