Incentives, truthfulness and Algorithmic Game Theory

Aaron Roth has an insightful entry on incentive compatibility, truthfulness and computation. He concludes:

It seems that there is a rich theory of incentive compatible computation waiting to be discovered, and that algorithmic game theory will prove to fit in nicely with the rest of theoretical computer science as a discipline that studies the fundamental abilities and limits of computation.

Comments

Popular posts from this blog

Smart Lotteries in School Choice Ex-ante Pareto-Improvement with Ex-post Stability

Fair budgets from ranked ballots: PB-EAR

Proportionally Representative Clustering