2014
DOI: 10.1016/j.geb.2014.04.009
|View full text |Cite
|
Sign up to set email alerts
|

Communication in repeated network games with imperfect monitoring

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
7
0

Year Published

2014
2014
2024
2024

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 15 publications
(7 citation statements)
references
References 38 publications
0
7
0
Order By: Relevance
“…This paper is also related to the literature on repeated games on networks, where the network models the monitoring structure and/or the communication possibilities. See, among others, Ben-Porath and Kahneman (1996), Laclau (2012Laclau ( , 2014, Renault and Tomala (1998), Tomala (2011) and Wolitzky (2015). This literature characterizes the networks for which folk theorems obtain.…”
Section: Figure 1 Illustration Of the Difficultiesmentioning
confidence: 99%
“…This paper is also related to the literature on repeated games on networks, where the network models the monitoring structure and/or the communication possibilities. See, among others, Ben-Porath and Kahneman (1996), Laclau (2012Laclau ( , 2014, Renault and Tomala (1998), Tomala (2011) and Wolitzky (2015). This literature characterizes the networks for which folk theorems obtain.…”
Section: Figure 1 Illustration Of the Difficultiesmentioning
confidence: 99%
“…19 this approach is in contrast to the standard approach of enforcing cooperation on networks via contagion strategies in which players learn information through the network by being defected on when punishment is underway. Kandori 1992;ellison 1994;Wolitzky 2013; acemoglu and Wolitzky 2016. 20 Balmaceda and escobar 2017; Jackson, rodriguez-Barraquer, and tan 2012; lippert and spagnolo 2011; ali and miller 2013.…”
Section: A Model Of Interactions In Weak Statesmentioning
confidence: 99%
“…matching is, by assumption, independent of g. it can be shown that all results here continue to hold if players are more likely to play a neighbor in g, as long as the probability of playing a network neighbor is not precisely 1.27 e.g., okuno-fujiwara and Postelwaite 1995. 28 e.g.,Kandori 1992. …”
mentioning
confidence: 99%
“…There are other works that share similarities with our paper, in that agents are located in a network and each agent only observes the actions chosen by his neighbors. Ben‐Porath and Kahneman (), Renault and Tomala (), Haag and Lagunoff (), and Laclau (, ) are examples. Despite these similarities, they pay little attention to the stability of equilibria.…”
Section: Introductionmentioning
confidence: 99%