Randomized algorithms
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Algorithms, games, and the internet
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
Tight bounds for worst-case equilibria
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
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
How much can taxes help selfish routing?
Proceedings of the 4th ACM conference on Electronic commerce
Pricing network edges for heterogeneous selfish users
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Designing Networks for Selfish Users is Hard
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Exponentially Many Steps for Finding a Nash Equilibrium in a Bimatrix Game
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Edge Pricing of Multicommodity Networks for Heterogeneous Selfish Users
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Tolls for Heterogeneous Selfish Users in Multicommodity Networks and Generalized Congestion Games
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Algorithms for selfish agents mechanism design for distributed computation
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
On the price of heterogeneity in parallel systems
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Non-preemptive Coordination Mechanisms for Identical Machine Scheduling Games
SIROCCO '08 Proceedings of the 15th international colloquium on Structural Information and Communication Complexity
On the Equilibria and Efficiency of the GSP Mechanism in Keyword Auctions with Externalities
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Eliciting Coordination with Rebates
Transportation Science
A Stackelberg strategy for routing flow over time
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
| Hi-index | 0.00 |
Recently there has been a lot of interest in problems at the intersection of Game Theory, Economics, and Computer Science. For example, there are interesting developments concerning algorithms for equilibria and cost sharing, algorithmic mechanism design, and the efficiency of systems with selfish users [25]. In this note, I will focus on the last area and in particular on the price of anarchy of task allocation, selfish routing, and congestion games. I will discuss the issues of this area, mention the central results, and suggest some open problems, some of them close in spirit to competitive analysis.