Edith Elkind- Coalitional Games on Sparse Social Networks

Explore coalitional games on social networks in this 48-minute lecture by Edith Elkind at the Hausdorff Center for Mathematics. Delve into the characterization of graph families with polynomially many feasible coalitions and examine the complexity of computing solution concepts and parameters in these games. Discover the connection between coalitional games on social networks and the synergy coalition group representation, including new complexity results. Investigate topics such as TU coalitional games, games on networks, stability and fairness in coalitional games, algorithms for optimal partition and Shapley value, and the characteristics of sparse networks. Gain insights into condensed graphs, bounds in terms of weight and number, and the efficiency of algorithms in synergy coalition groups.

TU Coalitional Games
Games on Networks
Exploiting the Structure of I?
Trees?
This Work: Bounding the # of Connected Coalitions
Results (mostly not mine)
Reminder: Stability in (Superadditive) Coalitional Games
Reminder: Stability in Coalitional Games
Reminder: Fairness in Coalitional Games
Algorithms: Optimal Partition
Algorithms: Shapley Value Demange games: poly-many summands
Algorithms: Least Core
Q2: What Do Sparse Networks Look Like?
Condensed Graphs
Bounds in Terms of N.
Bounds in Terms of Weight
Weights Are Not Enough
Q3: Is This About Graphs?
Q3: Do Synergy Coalition Groups Admit Efficient Algorithms?
Beyond TU Games