Recursive Methods in Discounted Stochastic Games: An Algorithm for δ→ 1 and a Folk Theorem - HEC Paris - École des hautes études commerciales de Paris Access content directly
Journal Articles Econometrica Year : 2011

Recursive Methods in Discounted Stochastic Games: An Algorithm for δ→ 1 and a Folk Theorem

Abstract

We present an algorithm to compute the set of perfect public equilibrium payoffs as the discount factor tends to 1 for stochastic games with observable states and public (but not necessarily perfect) monitoring when the limiting set of (long-run players') equilibrium payoffs is independent of the initial state. This is the case, for instance, if the Markov chain induced by any Markov strategy profile is irreducible. We then provide conditions under which a folk theorem obtains: if in each state the joint distribution over the public signal and next period's state satisfies some rank condition, every feasible payoff vector above the minmax payoff is sustained by a perfect public equilibrium with low discounting.

Keywords

Dates and versions

hal-00609191 , version 1 (18-07-2011)

Identifiers

Cite

Nicolas Vieille, Johannes Hörner, Takuo Sugaya, Satoru Takahashi. Recursive Methods in Discounted Stochastic Games: An Algorithm for δ→ 1 and a Folk Theorem. Econometrica, 2011, 79 (4), pp.1277-1318. ⟨10.3982/ECTA9004⟩. ⟨hal-00609191⟩

Collections

HEC CNRS
148 View
0 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More