Algorithmic mechanism design

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

Algorithmic mechanism design (AMD) lies at the intersection of economic game theory and computer science.

Noam Nisan and Amir Ronen, from the Hebrew University of Jerusalem, first coined "Algorithmic mechanism design" in a research paper published in 1999.[1][2]

It combines ideas such as utility maximization and mechanism design from economics, rationality and Nash equilibrium from game theory, with such concepts as complexity and algorithm design from discrete mathematics and theoretical computer science. Examples of topics include networking, peering, online auctions and exchanges, online advertising, and search engine's page ranking.

Algorithmic mechanism design differs from classical economic mechanism design in several respects. It typically employs the analytic tools of theoretical computer science, such as worst case analysis and approximation ratios, in contrast to classical mechanism design in economics which often makes distributional assumptions about the agents. It also considers computational constraints to be of central importance: mechanisms that cannot be efficiently implemented in polynomial time are not considered to be viable solutions to a mechanism design problem. This often, for example, rules out the classic economic mechanism, the Vickrey–Clarke–Groves auction.

See also[edit]

References and notes[edit]

  1. ^ Nisan, Noam; Ronen, Amir (1999), "Algorithmic mechanism design", Proceedings of the Thirty-first Annual ACM Symposium on Theory of Computing: 129–140, doi:10.1145/301250.301287, ISBN 978-1581130676.
  2. ^ Nisan, Noam; Ronen, Amir (2001). "Algorithmic Mechanism Design". Games and Economic Behavior. 35 (1–2): 166–196. doi:10.1006/game.1999.0790.

Further reading[edit]