In 1999, the seminal paper of Noam Nisan and Amir Ronen[1] drew the attention of the Theoretical Computer Science community to designing algorithms for selfish (strategic) users.
The payments should be carefully chosen as to motivate all participants to act as the algorithm designer wishes.
[2] The other two papers cited in the 2012 Gödel Prize for fundamental contributions to Algorithmic Game Theory introduced and developed the concept of "Price of Anarchy".
Equilibria are found in several fields related to the Internet, for instance financial interactions and communication load-balancing[citation needed].
Rephrasing problems in terms of games allows the analysis of Internet-based interactions and the construction of mechanisms to meet specified demands.
Of special importance is the complexity class PPAD, which includes many problems in algorithmic game theory.
Algorithmic mechanism design considers the optimization of economic systems under computational efficiency requirements.
[7] In contrast, correlated equilibria can be computed efficiently using linear programming,[8] as well as learned via no-regret strategies.