On Repeated Games with Complete Information
- 1 February 1986
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Mathematics of Operations Research
- Vol. 11 (1) , 147-160
- https://doi.org/10.1287/moor.11.1.147
Abstract
We consider N person repeated games with complete information and standard signalling. We first prove several properties of the sets of feasible payoffs and Nash equilibrium payoffs for the n-stage game and for the λ-discounted game. In the second part we determine the set of equilibrium payoffs for the Prisoner's Dilemma corresponding to the critical value of the discount factor.Keywords
All Related Versions
This publication has 0 references indexed in Scilit: