Algorithmic game theory: Difference between revisions

Content deleted Content added
No reason, you can delete it.
Tag: Reverted
m Rollback edit(s) by 205.122.102.98 (talk): non-constructive (RW 16)
Line 5:
 
* ''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 ...
* ''Design'': design games that have both good game-theoretical and algorithmic properties. Yup. This area is called [[algorithmic mechanism design]].
 
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.