Repeated Proximity Games
We consider repeated games of complete information and imperfect monitoring, where the observation structure is given by a directed graph, i.e. all what a player learns are the actions taken by his neighbours on the graph. We prove that a generalized folk theorem holds if and only if the graph is 2-connected: this means that manipulation of information transmission by one player is impossible if and only if no player is essential for communication. We finally extend this result to the contexts of correlated equilibrium, sequential equilibrium and finitely repeated games.
To our knowledge, this item is not available for
download. To find whether it is available, there are three
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a search for a similarly titled item that would be available.
|Date of creation:||1997|
|Date of revision:|
|Contact details of provider:|| Postal: France; Universite de Paris I - Pantheon- Sorbonne, 12 Place de Pantheon-75005 Paris, France|
Phone: + 33 44 07 81 00
Fax: + 33 1 44 07 83 01
Web page: http://cermsem.univ-paris1.fr/
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:fth:pariem:97.14. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Thomas Krichel)
If references are entirely missing, you can add them using this form.