Difference between revisions of "Algorithmic game theory"
From Wiki @ Karl Jones dot com
Karl Jones (Talk | contribs) (Created page with "'''Algorithmic game theory''' is an area in the intersection of game theory and algorithm design, whose objective is to design algorithms in strategic environments. =...") |
Karl Jones (Talk | contribs) (→See also) |
||
| Line 12: | Line 12: | ||
* [[Algorithm]] | * [[Algorithm]] | ||
| + | * [[Algorithm design]] | ||
| + | * [[Auction Theory]] | ||
| + | * [[Game theory]] | ||
| + | * [[Load balancing (computing)]] | ||
| + | * [[Mechanism design]] | ||
| + | * [[Multi-agent system]] | ||
| + | * [[Voting in game theory]] | ||
== External links == | == External links == | ||
Latest revision as of 15:51, 4 May 2016
Algorithmic game theory is an area in the intersection of game theory and algorithm design, whose objective is to design algorithms in strategic environments.
Description
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 agents might not report the input truthfully because of their own personal interests.
On top of the usual requirements in classical algorithm design, say polynomial-time running time, good approximation ratio, the designer must also care about incentive constraints.
See also
- Algorithm
- Algorithm design
- Auction Theory
- Game theory
- Load balancing (computing)
- Mechanism design
- Multi-agent system
- Voting in game theory
External links
- Algorithmic game theory @ Wikipedia
