Abstract:

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. In this note, I focus on the last area and in particular on the price of anarchy of task allocation, selfish routing, and congestion games. I discuss the issues of this area, mention the central results, and suggest some open problems, some of them close in spirit to competitive analysis.

Postscript

Pdf

BibTeX