The Structure and Complexity of Nash Equilibria for a Selfish Routing Game
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
The Mathematics of Internet Congestion Control (Systems and Control: Foundations and Applications)
The Mathematics of Internet Congestion Control (Systems and Control: Foundations and Applications)
The complexity of pure Nash equilibria
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Bottleneck links, variable demand, and the tragedy of the commons
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
On selfish routing in internet-like environments
IEEE/ACM Transactions on Networking (TON)
Convergence time to Nash equilibrium in load balancing
ACM Transactions on Algorithms (TALG)
Strong and Pareto Price of Anarchy in Congestion Games
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Strong and correlated strong equilibria in monotone congestion games
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
Bottleneck Routing Games in Communication Networks
IEEE Journal on Selected Areas in Communications
Computing pure Nash and strong equilibria in bottleneck congestion games
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part II
Bottleneck congestion games with logarithmic price of anarchy
SAGT'10 Proceedings of the Third international conference on Algorithmic game theory
On the complexity of pareto-optimal nash and strong equilibria
SAGT'10 Proceedings of the Third international conference on Algorithmic game theory
On the inefficiency of equilibria in linear bottleneck congestion games
SAGT'10 Proceedings of the Third international conference on Algorithmic game theory
On the quality and complexity of pareto equilibria in the job scheduling game
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
The max k-cut game and its strong equilibria
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Demand allocation games: integrating discrete and continuous strategy spaces
WINE'11 Proceedings of the 7th international conference on Internet and Network Economics
On the Existence of Pure Nash Equilibria in Weighted Congestion Games
Mathematics of Operations Research
Optimal Cost Sharing for Resource Selection Games
Mathematics of Operations Research
| Hi-index | 0.00 |
We provide an axiomatic framework for the the well studied lexicographical improvement property and derive new results on the existence of strong Nash equilibria for a very general class of congestion games with bottleneck objectives. This includes extensions of classical load-based models, routing games with splittable demands, scheduling games with malleable jobs, and more.