Subruk's Site
Subruk's Site
Home
Publications
Students
Teaching
Contact
Light
Dark
Automatic
Parameterized Complexity
The Complexity of Optimizing Atomic Congestion
Atomic congestion games are a classic topic in network design, routing, and algorithmic game theory, and are capable of modeling congestion and flow optimization tasks in various application areas. While both the price of anarchy for such games as …
Cite
×