Indexed metadata
On Repeated Games with Complete Information
Sylvain Sorin
Source 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.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.