Power and stability in connectivity games

@inproceedings{Bachrach2008PowerAS,
  title={Power and stability in connectivity games},
  author={Yoram Bachrach and Jeffrey S. Rosenschein and Ely Porat},
  booktitle={AAMAS},
  year={2008}
}
We consider computational aspects of a game theoretic approach to network reliability. Consider a network where failure of one node may disrupt communication between two other nodes. We model this network as a simple coalitional game, called the vertex Connectivity Game (CG). In this game, each agent owns a vertex, and controls all the edges going to and from that vertex. A coalition of agents wins if it fully connects a certain subset of vertices in the graph, called the primary vertices. We… CONTINUE READING
Highly Cited
This paper has 34 citations. REVIEW CITATIONS

Similar Papers

Loading similar papers…