Tim Roughgarden studies the interaction between algorithms, economic incentives and computational limits. His work on selfish routing, including collaboration with Éva Tardos, asks how much efficiency is lost when network users minimize their own delays.[ref]
His Intrinsic Robustness of the Price of Anarchy by Tim Roughgarden develops a framework in which certain inefficiency bounds persist beyond a particular equilibrium description. The proof controls the aggregate cost of specified unilateral deviations, making the bound applicable to broader patterns of behavior such as appropriate learning outcomes.[ref]
Intrinsic Robustness of the Price of Anarchy by Tim Roughgarden. Introduction and robust price-of-anarchy framework
This distinction is useful: proving that an optimal outcome exists, that an equilibrium exists and that observed adaptive behavior stays efficient are three different claims. A robustness argument states which behavioral conditions are actually sufficient for its guarantee. Columbia's institutional profile identifies algorithmic game theory and the design and limitations of algorithms as his research areas.[ref]
Tim Roughgarden, portrait identified by the linked author, institutional or Commons source
. Articles by others on the same topic
Tim Roughgarden is a prominent computer scientist and professor known for his work in algorithm design, game theory, and the intersection of computer science and economics. He has made significant contributions to algorithmic game theory, including concepts related to pricing, network routing, and auction design. Roughgarden has held academic positions at institutions such as Stanford University and Columbia University. He is also recognized for his efforts in educating others about algorithms and game theory through his teaching and writing.