A folk theorem for stochastic games with private almost-perfect monitoring (Q2016219): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Learning-by-Doing, Organizational Forgetting, and Industry Dynamics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discounted Dynamic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A folk theorem for stochastic games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Belief-Free Equilibria in Repeated Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: A robust folk theorem for the prisoner's dilemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: The folk theorem for irreducible stochastic games with imperfect public monitoring / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Folk Theorem for Games with Private Almost-Perfect Monitoring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive Methods in Discounted Stochastic Games: An Algorithm for<i>δ</i>→ 1 and a Folk Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4437142 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The repeated prisoner's dilemma with imperfect private monitoring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Noncooperative Stochastic Games / rank
 
Normal rank

Latest revision as of 15:07, 8 July 2024

scientific article
Language Label Description Also known as
English
A folk theorem for stochastic games with private almost-perfect monitoring
scientific article

    Statements

    A folk theorem for stochastic games with private almost-perfect monitoring (English)
    0 references
    0 references
    19 June 2014
    0 references
    A stochastic game on infinite horizon is considered where each player gets a noisy information about the others' moves. Under suitable technical hypotheses, which include in particular the conditions that (1) the initial condition will be `forgotten' in a precise sense, (2) the information about the others' moves is sufficiently informative, and (3) the discount factor is sufficiently close to 1, it is shown that every individually rational feasible discounted payoff is attainable, thereby establishing a version of the `folk theorem'.
    0 references
    folk theorem
    0 references
    stochastic game
    0 references
    almost-perfect monitoring
    0 references
    discounted payoff
    0 references

    Identifiers