On Bounded Rationality And Computational Complexity (1994) [1 citations — 0 self]
by
Christos H. Papadimitriou
,
Mihalis Yannakakis
Indiana University
Add To MetaCart
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@TECHREPORT{Papadimitriou94onbounded,
author = {Christos H. Papadimitriou and Mihalis Yannakakis},
title = {On Bounded Rationality And Computational Complexity},
institution = {Indiana University},
year = {1994}
}
author = {Christos H. Papadimitriou and Mihalis Yannakakis},
title = {On Bounded Rationality And Computational Complexity},
institution = {Indiana University},
year = {1994}
}
Bookmarks
OpenURL
Abstract:
It has been hoped that computational approaches can help resolve some wellknown paradoxes in game theory. We prove that if the repeated prisoner's dilemma is played by finite automata with less than exponentially (in the number of rounds) many states, then cooperation can be achieved in equilibrium (while with exponentially many states, defection is the only equilibrium). We furthermore prove a generalization to arbitrary games and all Pareto optimal strategy pairs within the pure individually rational region.
