Fault Reporting in Partially Known Networks and Folk Theorems - Archive ouverte HAL Access content directly
Journal Articles Operations Research Year : 2011

Fault Reporting in Partially Known Networks and Folk Theorems

(1)
1

Abstract

We consider a group of players who perform tasks repeatedly. The players are nodes of a communication network and observe their neighbors' actions. Players have partial knowledge of the network and only know their set of neighbors. We study the existence of protocols for fault reporting: whenever a player chooses a faulty action, the communication protocol starts and the output publicly reveals the identity of the faulty player. We consider two setups. In the first one, players do not share authentication keys. We show that existence of a protocol for fault reporting is equivalent to the 2-vertex-connectedness of the network: no single vertex deletion disconnects the graph. In the second setup, we allow players to share authentication keys. We show that existence of a distribution of the keys and of a protocol for fault reporting is equivalent to the 2-edge-connectedness of the network: no single edge deletion disconnects the graph. We give applications to the implementation of socially optimal outcomes in repeated games.
Not file

Dates and versions

hal-00632806 , version 1 (15-10-2011)

Identifiers

Cite

Tristan Tomala. Fault Reporting in Partially Known Networks and Folk Theorems. Operations Research, 2011, 59 (3), pp.754-763. ⟨10.1287/opre.1110.0936⟩. ⟨hal-00632806⟩

Collections

HEC CNRS
92 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More