= Tim Roughgarden
{c}
<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.<How Bad is Selfish Routing? by Tim Roughgarden and Éva Tardos>[Abstract and routing model]{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.<Intrinsic Robustness of the Price of Anarchy by Tim Roughgarden>[Introduction and robust price-of-anarchy framework]{ref}
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.https://www.cs.columbia.edu/2019/tim-roughgarden-and-david-knowles-join-the-department/[Tim Roughgarden research description]{ref}
\Image[https://www.cs.columbia.edu/wp-content/uploads/2019/04/Newsletter_Headshots_Tim.jpg]
{title=Tim Roughgarden, portrait identified by the linked author, institutional or Commons source}
{height=240}
Back to article page
