Previous month Previous day Next day Next month
See by year See by month See by week See Today Search Jump to month


Thursday, April 10, 2014, 11:00am


Matt Weinberg1Matt Weinberg

Grad Student, MIT

"Algorithms for Strategic Agents"

Abstract: In traditional algorithm design, no incentives come into play: the input is given, and your algorithm must produce a correct output. How much harder is it to solve the same problem when the input is not given directly, but instead reported by strategic agents (who may choose to lie) whose incentives may not align with your own? This talk will present a recent series of results on black-box reductions from mechanism to algorithm design. That is, we show how to solve optimization problems while properly incentivizing strategic agents using only black-box access to an algorithm for (a modified version of) the same optimization problem when the input is directly given.

Bio: Matt Weinberg is a PhD candidate at the Massachusetts Institute of Technology, where he is advised by Costis Daskalakis. His research lies mostly at the intersection of Computer Science and Economics, including Algorithmic Game Theory, Online Algorithms, and Applied Probability. He obtained his B.A. in Math from Cornell University.

Hosted by: TCS Search Committee


Location Tech L324
Thursday, April 10, 2014 at 11:00am
Contact Amanda Zarate at or 847-491-3451

  Download as iCal file