Network Bargaining: Using Approximate Blocking Sets to Stabilize Unstable Instances
We study a network extension to the Nash bargaining game, as introduced by Kleinberg and Tardos , where the set of players corresponds to vertices in a graph G = (V,E) and each edge ij ∈ E represents a possible deal between players i and j. We reformulate the problem as a cooperative game and study the following question: Given a game with an empty core (i.e. an unstable game) is it possible, through minimal changes in the underlying network, to stabilize the game? We show that by removing edges in the network that belong to a blocking set we can find a stable solution in polynomial time. This motivates the problem of finding small blocking sets. While it has been previously shown that finding the smallest blocking set is NP-hard , we show that it is possible to efficiently find approximate blocking sets in sparse graphs.
KeywordsExtreme Point Cooperative Game Vertex Cover Bargaining Game Sparse Graph
Unable to display preview. Download preview PDF.
- 1.Bateni, M., Hajiaghayi, M., Immorlica, N., Mahini, H.: The Cooperative Game Theory Foundations of Network Bargaining Games. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010, Part I. LNCS, vol. 6198, pp. 67–78. Springer, Heidelberg (2010)CrossRefGoogle Scholar
- 3.Chalkiadakis, G., Elkind, E., Wooldridge, M.: Computational Aspects of Cooperative Game Theory. Synthesis Lectures on Artificial Intelligence and Machine Learning. Morgan & Claypool Publishers (2011)Google Scholar
- 5.Faigle, U., Kern, W., Kuipers, J.: An efficient algorithm for nucleolus and prekernel computation in some classes of tu-games. Tech. Rep. 1464, U. of Twente (1998)Google Scholar
- 6.Kleinberg, J.M., Tardos, É.: Balanced outcomes in social exchange networks. In: Proceedings of ACM Symposium on Theory of Computing, pp. 295–304 (2008)Google Scholar
- 7.Könemann, J., Larson, K., Steiner, D.: Network bargaining: Using approximate blocking sets to stabilize unstable instances. Tech. Rep. submit/0522859, arXiV (full version, 2012)Google Scholar
- 8.Lau, L.C., Ravi, R., Singh, M.: Iterative Methods in Combinatorial Optimization. Cambridge University Press (2011)Google Scholar
- 10.Peleg, B., Sudhölter, P.: Introduction to the Theory of Cooperative Games. Springer (2003)Google Scholar