DSpace Repository

Repeated Games Played in a Network

Show simple item record

dc.creator Kinateder, Markus
dc.date 2007-10-30T13:19:49Z
dc.date 2007-10-30T13:19:49Z
dc.date 2006-11-23
dc.date.accessioned 2017-01-31T00:57:44Z
dc.date.available 2017-01-31T00:57:44Z
dc.identifier http://hdl.handle.net/10261/1704
dc.identifier.uri http://dspace.mediu.edu.my:8181/xmlui/handle/10261/1704
dc.description Delayed perfect monitoring in an infinitely repeated discounted game is modelled by letting the players form a connected and undirected network. Players observe their immediate neighbors' behavior only, but communicate over time the repeated game's history truthfully throughout the network. The Folk Theorem extends to this setup, although for a range of discount factors strictly below 1, the set of sequential equilibria and the corresponding payoff set may be reduced. A general class of games is analyzed without imposing restrictions on the dimensionality of the payoff space. This and the bilateral communication structure allow for limited results under strategic communication only. As a by-product this model produces a network result; namely, the level of cooperation in this setup depends on the network's diameter, and not on its clustering coefficient as in other models.
dc.language eng
dc.relation UFAE and IAE Working Papers
dc.relation 674.06
dc.rights openAccess
dc.subject Repeated Game
dc.subject Network
dc.subject Delayed Perfect Monitoring
dc.subject Communication
dc.title Repeated Games Played in a Network
dc.type Documento de trabajo


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Advanced Search

Browse

My Account