Loading…

Communication in repeated network games with imperfect monitoring

I consider repeated games with private monitoring played on a network. Each player has a set of neighbors with whom he interacts: a player's payoff depends on his own and his neighbors' actions only. Monitoring is private and imperfect: each player observes his stage payoff but not the act...

Full description

Saved in:
Bibliographic Details
Published in:Games and economic behavior 2014-09, Vol.87, p.136-160
Main Author: Laclau, M.
Format: Article
Language:English
Subjects:
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-c502t-24aa892fe4af0014066eb2a9dca3fbf750c58112cb2bda66288f520c61d2ebbd3
cites cdi_FETCH-LOGICAL-c502t-24aa892fe4af0014066eb2a9dca3fbf750c58112cb2bda66288f520c61d2ebbd3
container_end_page 160
container_issue
container_start_page 136
container_title Games and economic behavior
container_volume 87
creator Laclau, M.
description I consider repeated games with private monitoring played on a network. Each player has a set of neighbors with whom he interacts: a player's payoff depends on his own and his neighbors' actions only. Monitoring is private and imperfect: each player observes his stage payoff but not the actions of his neighbors. Players can communicate costlessly at each stage: communication can be public, private or a mixture of both. Payoffs are assumed to be sensitive to unilateral deviations. First, for any network, a folk theorem holds if some Joint Pairwise Identifiability condition regarding payoff functions is satisfied. Second, a necessary and sufficient condition on the network topology for a folk theorem to hold for all payoff functions is that no two players have the same set of neighbors not counting each other. •I consider repeated games on a network with private monitoring and local interaction.•A player's payoff depends on his own and his neighbors' actions only.•Monitoring is private: each player observes his stage payoff only.•Players can communicate costlessly at each stage, publicly or privately.•A folk theorem holds if and only if no two players have the same neighbors.
doi_str_mv 10.1016/j.geb.2014.04.009
format article
fullrecord <record><control><sourceid>proquest_hal_p</sourceid><recordid>TN_cdi_hal_primary_oai_HAL_halshs_01109156v1</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0899825614000864</els_id><sourcerecordid>1613945660</sourcerecordid><originalsourceid>FETCH-LOGICAL-c502t-24aa892fe4af0014066eb2a9dca3fbf750c58112cb2bda66288f520c61d2ebbd3</originalsourceid><addsrcrecordid>eNp9kUFLAzEQhYMoWKs_wNuCFw-2TrKbdIOnUtQKBS96DtnsbJvaTWqy2-K_N6XiwYMwEAjfe7yZR8g1hTEFKu7X4yVWYwa0GEMakCdkQEHCiBWT_JQMoJRyVDIuzslFjGsA4GwCAzKd-bbtnTW6s95l1mUBt6g7rDOH3d6Hj2ypW4zZ3narzLZbDA2aLmu9s50P1i0vyVmjNxGvft4heX96fJvNR4vX55fZdDEyHFiXcmhdStZgoRtIMUEIrJiWtdF5UzUTDoaXlDJTsarWQrCybDgDI2jNsKrqfEjujr4rvVHbYFsdvpTXVs2nC5X-4ioqoGlnysWOJvz2iG-D_-wxdqq10eBmox36PioqaC4LLgQk9OYPuvZ9cMlSJa9c8qJgIlH0SJngYwzY_IagoA4dqLVKHahDBwrSgEyah6MG02F2FoOKxqIzWNuQrqhqb_9RfwOjL44P</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1563954426</pqid></control><display><type>article</type><title>Communication in repeated network games with imperfect monitoring</title><source>International Bibliography of the Social Sciences (IBSS)</source><source>ScienceDirect Freedom Collection</source><creator>Laclau, M.</creator><creatorcontrib>Laclau, M.</creatorcontrib><description>I consider repeated games with private monitoring played on a network. Each player has a set of neighbors with whom he interacts: a player's payoff depends on his own and his neighbors' actions only. Monitoring is private and imperfect: each player observes his stage payoff but not the actions of his neighbors. Players can communicate costlessly at each stage: communication can be public, private or a mixture of both. Payoffs are assumed to be sensitive to unilateral deviations. First, for any network, a folk theorem holds if some Joint Pairwise Identifiability condition regarding payoff functions is satisfied. Second, a necessary and sufficient condition on the network topology for a folk theorem to hold for all payoff functions is that no two players have the same set of neighbors not counting each other. •I consider repeated games on a network with private monitoring and local interaction.•A player's payoff depends on his own and his neighbors' actions only.•Monitoring is private: each player observes his stage payoff only.•Players can communicate costlessly at each stage, publicly or privately.•A folk theorem holds if and only if no two players have the same neighbors.</description><identifier>ISSN: 0899-8256</identifier><identifier>EISSN: 1090-2473</identifier><identifier>DOI: 10.1016/j.geb.2014.04.009</identifier><language>eng</language><publisher>Duluth: Elsevier Inc</publisher><subject>Communication ; Communications technology ; Economic analysis ; Economic behaviour ; Economics and Finance ; Folk theorem ; Game theory ; Games ; Humanities and Social Sciences ; Imperfect private monitoring ; Internet ; Management science ; Network topologies ; Networks ; Repeated games ; Studies ; Theorems</subject><ispartof>Games and economic behavior, 2014-09, Vol.87, p.136-160</ispartof><rights>2014 Elsevier Inc.</rights><rights>Copyright Academic Press Sep 2014</rights><rights>Distributed under a Creative Commons Attribution 4.0 International License</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c502t-24aa892fe4af0014066eb2a9dca3fbf750c58112cb2bda66288f520c61d2ebbd3</citedby><cites>FETCH-LOGICAL-c502t-24aa892fe4af0014066eb2a9dca3fbf750c58112cb2bda66288f520c61d2ebbd3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>230,314,780,784,885,27924,27925,33223,33224</link.rule.ids><backlink>$$Uhttps://shs.hal.science/halshs-01109156$$DView record in HAL$$Hfree_for_read</backlink></links><search><creatorcontrib>Laclau, M.</creatorcontrib><title>Communication in repeated network games with imperfect monitoring</title><title>Games and economic behavior</title><description>I consider repeated games with private monitoring played on a network. Each player has a set of neighbors with whom he interacts: a player's payoff depends on his own and his neighbors' actions only. Monitoring is private and imperfect: each player observes his stage payoff but not the actions of his neighbors. Players can communicate costlessly at each stage: communication can be public, private or a mixture of both. Payoffs are assumed to be sensitive to unilateral deviations. First, for any network, a folk theorem holds if some Joint Pairwise Identifiability condition regarding payoff functions is satisfied. Second, a necessary and sufficient condition on the network topology for a folk theorem to hold for all payoff functions is that no two players have the same set of neighbors not counting each other. •I consider repeated games on a network with private monitoring and local interaction.•A player's payoff depends on his own and his neighbors' actions only.•Monitoring is private: each player observes his stage payoff only.•Players can communicate costlessly at each stage, publicly or privately.•A folk theorem holds if and only if no two players have the same neighbors.</description><subject>Communication</subject><subject>Communications technology</subject><subject>Economic analysis</subject><subject>Economic behaviour</subject><subject>Economics and Finance</subject><subject>Folk theorem</subject><subject>Game theory</subject><subject>Games</subject><subject>Humanities and Social Sciences</subject><subject>Imperfect private monitoring</subject><subject>Internet</subject><subject>Management science</subject><subject>Network topologies</subject><subject>Networks</subject><subject>Repeated games</subject><subject>Studies</subject><subject>Theorems</subject><issn>0899-8256</issn><issn>1090-2473</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2014</creationdate><recordtype>article</recordtype><sourceid>8BJ</sourceid><recordid>eNp9kUFLAzEQhYMoWKs_wNuCFw-2TrKbdIOnUtQKBS96DtnsbJvaTWqy2-K_N6XiwYMwEAjfe7yZR8g1hTEFKu7X4yVWYwa0GEMakCdkQEHCiBWT_JQMoJRyVDIuzslFjGsA4GwCAzKd-bbtnTW6s95l1mUBt6g7rDOH3d6Hj2ypW4zZ3narzLZbDA2aLmu9s50P1i0vyVmjNxGvft4heX96fJvNR4vX55fZdDEyHFiXcmhdStZgoRtIMUEIrJiWtdF5UzUTDoaXlDJTsarWQrCybDgDI2jNsKrqfEjujr4rvVHbYFsdvpTXVs2nC5X-4ioqoGlnysWOJvz2iG-D_-wxdqq10eBmox36PioqaC4LLgQk9OYPuvZ9cMlSJa9c8qJgIlH0SJngYwzY_IagoA4dqLVKHahDBwrSgEyah6MG02F2FoOKxqIzWNuQrqhqb_9RfwOjL44P</recordid><startdate>20140901</startdate><enddate>20140901</enddate><creator>Laclau, M.</creator><general>Elsevier Inc</general><general>Academic Press</general><general>Elsevier</general><scope>AAYXX</scope><scope>CITATION</scope><scope>8BJ</scope><scope>FQK</scope><scope>JBE</scope><scope>1XC</scope><scope>BXJBU</scope></search><sort><creationdate>20140901</creationdate><title>Communication in repeated network games with imperfect monitoring</title><author>Laclau, M.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c502t-24aa892fe4af0014066eb2a9dca3fbf750c58112cb2bda66288f520c61d2ebbd3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2014</creationdate><topic>Communication</topic><topic>Communications technology</topic><topic>Economic analysis</topic><topic>Economic behaviour</topic><topic>Economics and Finance</topic><topic>Folk theorem</topic><topic>Game theory</topic><topic>Games</topic><topic>Humanities and Social Sciences</topic><topic>Imperfect private monitoring</topic><topic>Internet</topic><topic>Management science</topic><topic>Network topologies</topic><topic>Networks</topic><topic>Repeated games</topic><topic>Studies</topic><topic>Theorems</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Laclau, M.</creatorcontrib><collection>CrossRef</collection><collection>International Bibliography of the Social Sciences (IBSS)</collection><collection>International Bibliography of the Social Sciences</collection><collection>International Bibliography of the Social Sciences</collection><collection>Hyper Article en Ligne (HAL)</collection><collection>HAL-SHS: Archive ouverte en Sciences de l'Homme et de la Société</collection><jtitle>Games and economic behavior</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Laclau, M.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Communication in repeated network games with imperfect monitoring</atitle><jtitle>Games and economic behavior</jtitle><date>2014-09-01</date><risdate>2014</risdate><volume>87</volume><spage>136</spage><epage>160</epage><pages>136-160</pages><issn>0899-8256</issn><eissn>1090-2473</eissn><abstract>I consider repeated games with private monitoring played on a network. Each player has a set of neighbors with whom he interacts: a player's payoff depends on his own and his neighbors' actions only. Monitoring is private and imperfect: each player observes his stage payoff but not the actions of his neighbors. Players can communicate costlessly at each stage: communication can be public, private or a mixture of both. Payoffs are assumed to be sensitive to unilateral deviations. First, for any network, a folk theorem holds if some Joint Pairwise Identifiability condition regarding payoff functions is satisfied. Second, a necessary and sufficient condition on the network topology for a folk theorem to hold for all payoff functions is that no two players have the same set of neighbors not counting each other. •I consider repeated games on a network with private monitoring and local interaction.•A player's payoff depends on his own and his neighbors' actions only.•Monitoring is private: each player observes his stage payoff only.•Players can communicate costlessly at each stage, publicly or privately.•A folk theorem holds if and only if no two players have the same neighbors.</abstract><cop>Duluth</cop><pub>Elsevier Inc</pub><doi>10.1016/j.geb.2014.04.009</doi><tpages>25</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 0899-8256
ispartof Games and economic behavior, 2014-09, Vol.87, p.136-160
issn 0899-8256
1090-2473
language eng
recordid cdi_hal_primary_oai_HAL_halshs_01109156v1
source International Bibliography of the Social Sciences (IBSS); ScienceDirect Freedom Collection
subjects Communication
Communications technology
Economic analysis
Economic behaviour
Economics and Finance
Folk theorem
Game theory
Games
Humanities and Social Sciences
Imperfect private monitoring
Internet
Management science
Network topologies
Networks
Repeated games
Studies
Theorems
title Communication in repeated network games with imperfect monitoring
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-29T14%3A49%3A28IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_hal_p&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Communication%20in%20repeated%20network%20games%20with%20imperfect%20monitoring&rft.jtitle=Games%20and%20economic%20behavior&rft.au=Laclau,%20M.&rft.date=2014-09-01&rft.volume=87&rft.spage=136&rft.epage=160&rft.pages=136-160&rft.issn=0899-8256&rft.eissn=1090-2473&rft_id=info:doi/10.1016/j.geb.2014.04.009&rft_dat=%3Cproquest_hal_p%3E1613945660%3C/proquest_hal_p%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c502t-24aa892fe4af0014066eb2a9dca3fbf750c58112cb2bda66288f520c61d2ebbd3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=1563954426&rft_id=info:pmid/&rfr_iscdi=true