TY - GEN

T1 - Bounding the cost of stability in games over interaction networks

AU - Meir, Reshef

AU - Zick, Yair

AU - Elkind, Edith

AU - Rosenschein, Jeffrey S.

PY - 2013

Y1 - 2013

N2 - 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 κ + 1, and if the pathwidth of H is κ′, then the relative cost of stability is at most κ ′, We show that these bounds are tight for all κ ≥ 2 and all κ ′ ≥ 1, respectively.

AB - 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 κ + 1, and if the pathwidth of H is κ′, then the relative cost of stability is at most κ ′, We show that these bounds are tight for all κ ≥ 2 and all κ ′ ≥ 1, respectively.

UR - http://www.scopus.com/inward/record.url?scp=84893385229&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:84893385229

SN - 9781577356158

T3 - Proceedings of the 27th AAAI Conference on Artificial Intelligence, AAAI 2013

SP - 690

EP - 696

BT - Proceedings of the 27th AAAI Conference on Artificial Intelligence, AAAI 2013

T2 - 27th AAAI Conference on Artificial Intelligence, AAAI 2013

Y2 - 14 July 2013 through 18 July 2013

ER -