Bounding the Cost of Stability in Games over Interaction Networks

@inproceedings{Meir2013BoundingTC,
  title={Bounding the Cost of Stability in Games over Interaction Networks},
  author={Reshef Meir and Yair Zick and Edith Elkind and Jeffrey S. Rosenschein},
  booktitle={AAAI},
  year={2013}
}
We study the stability of cooperative games played over an interaction network, in a model that was introduced by Myerson (1977). We show that the cost of stability of such games (i.e., the subsidy required to stabilize the game) can be bounded in terms of natural parameters of their underlying interaction networks. Specifically, we prove that if the treewidth of the interaction network H is k, then the relative cost of stability of any game played over H is at most k + 1, and if the pathwidth… CONTINUE READING
Highly Cited
This paper has 18 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

Explore Further: Topics Discussed in This Paper

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…