Algorithmic game theory: Difference between revisions

Revision as of 05:46, 15 March 2020

Revision as of 00:36, 17 April 2020

Line 2:

'''Algorithmic game theory''' is an area in the intersection of [[game theory]] and [[computer science]], with the objective of understanding and design of algorithms in [[Strategy (game theory)|strategic]] environments.

Typically, in Algorithmic Game Theory problems, the input to a given algorithm is distributed among many players who have a personal interest in the output. In those situations, the [[agent (grammareconomics)|agent]]s might not report the input truthfully because of their own personal interests. We can see Algorithmic Game Theory from two perspectives:

* ''Analysis'': look at the current implemented algorithms and analyze them using Game Theory tools: calculate and prove properties on their [[Nash equilibria]], [[price of anarchy]], best-response dynamics ...