Path coalitional games

We present a general framework to model strategic aspects and stable and fair resource allocations in networks via variants and generalizations of path coalitional games. In these games, a coalition of edges or vertices is successful if it can enable an s-t path. We present polynomial-time algorithms to compute and verify least core payoffs of cost-based generalizations of path coalitional games and their duals, thereby settling a number of open problems. The least core payoffs of path coalitional games are completely characterized and a polynomial-time algorithm for computing the nucleolus of edge path coalitional games on undirected series-parallel graphs is presented.

[1]  Toshihide Ibaraki,et al.  Algorithmic Aspects of the Core of Combinatorial Optimization Games , 1999, Math. Oper. Res..

[2]  Ron Lavi,et al.  Algorithmic Mechanism Design , 2008, Encyclopedia of Algorithms.

[3]  L. Shapley,et al.  QUASI-CORES IN A MONETARY ECONOMY WITH NONCONVEX PREFERENCES , 1966 .

[4]  Churlzu Lim,et al.  Algorithms for Network Interdiction and Fortification Games , 2008 .

[5]  Vladimir Gurvich,et al.  On Short Paths Interdiction Problems: Total and Node-Wise Limited Interdiction , 2008, Theory of Computing Systems.

[6]  Chris Snijders,et al.  Axiomatization of the Nucleolus , 1995, Math. Oper. Res..

[7]  Vito Fragnelli,et al.  On shortest path games , 2000, Math. Methods Oper. Res..

[8]  Rahul Savani,et al.  Wiretapping a hidden network , 2009, WINE.

[9]  E. Kohlberg.  On the Nucleolus of a Characteristic Function Game , 1971 .

[10]  Frank Nebel.  Shortest Path Games: Computational Complexity of Solution Concepts , 2010 .

[11]  Michael Wooldridge,et al.  On the computational complexity of weighted voting games , 2009, Annals of Mathematics and Artificial Intelligence.

[12]  Alan Washburn,et al.  Two-Person Zero-Sum Games for Network Interdiction , 1995, Oper. Res..

[13]  Felix Brandt,et al.  Monotone cooperative games and their threshold versions , 2010, AAMAS.

[14]  Xiaotie Deng,et al.  Algorithmic Cooperative Game Theory , 2008 .

[15]  Ely Porat,et al.  Path disruption games , 2010, AAMAS.

[16]  B. Peleg,et al.  Introduction to the Theory of Cooperative Games , 1983 .

[17]  L. S. Shapley,et al.  Geometric Properties of the Kernel, Nucleolus, and Related Solution Concepts , 1979, Math. Oper. Res..