Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated

The Nash-threats folk theorem with communication and approximate common knowledge in two player games

15 references·4 citing·41 second hop

FromToDepth

this work references cited by second hop

References

1984Noncooperative Collusion under Imperfect Price Information2,002 cited
2006Repeated Games and Reputations814 cited
1994The Folk Theorem with Imperfect Public Information768 cited
1986Multistage Games with Communication588 cited
1994Cooperation in the Prisoner's Dilemma with Anonymous Random Matching455 cited
1986An Approach to Communication Equilibria384 cited
1998Private Observation, Communication and Collusion334 cited
1998Communication in Repeated Games with Imperfect Private Monitoring254 cited
2002A Robust Folk Theorem for the Prisoner's Dilemma219 cited
2002Introduction to Repeated Games with Private Monitoring175 cited
2002The Repeated Prisoner's Dilemma with Imperfect Private Monitoring169 cited
2002Repeated Games with Almost-Public Monitoring156 cited
1997Efficiency in Repeated Prisoner's Dilemma with Private Monitoring146 cited
1996Communication in Repeated Games with Private Monitoring114 cited
2002Belief-Based Equilibria in the Repeated Prisoners' Dilemma with Private Monitoring99 cited

Cited by

Only edges whose both ends are imported exist here. Widen the year window, or show the whole map. Back to the work

2009

How Robust Is the Folk Theorem?*

33 cited

2004Coordination Failure in Repeated Games with Almost-Public Monitoring31 cited

2019Communication and cooperation in repeated games29 cited

2008A limit characterization of belief-free equilibrium payoffs in repeated games28 cited