Edith Elkind- Coalitional Games on Sparse Social Networks

Edith Elkind- Coalitional Games on Sparse Social Networks

Hausdorff Center for Mathematics via YouTube Direct link

TU Coalitional Games

1 of 20

1 of 20

TU Coalitional Games

Class Central Classrooms beta

YouTube videos curated by Class Central.

Classroom Contents

Edith Elkind- Coalitional Games on Sparse Social Networks

Automatically move to the next video in the Classroom when playback concludes

  1. 1 TU Coalitional Games
  2. 2 Games on Networks
  3. 3 Exploiting the Structure of I?
  4. 4 Trees?
  5. 5 This Work: Bounding the # of Connected Coalitions
  6. 6 Results (mostly not mine)
  7. 7 Reminder: Stability in (Superadditive) Coalitional Games
  8. 8 Reminder: Stability in Coalitional Games
  9. 9 Reminder: Fairness in Coalitional Games
  10. 10 Algorithms: Optimal Partition
  11. 11 Algorithms: Shapley Value Demange games: poly-many summands
  12. 12 Algorithms: Least Core
  13. 13 Q2: What Do Sparse Networks Look Like?
  14. 14 Condensed Graphs
  15. 15 Bounds in Terms of N.
  16. 16 Bounds in Terms of Weight
  17. 17 Weights Are Not Enough
  18. 18 Q3: Is This About Graphs?
  19. 19 Q3: Do Synergy Coalition Groups Admit Efficient Algorithms?
  20. 20 Beyond TU Games

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.