Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
156 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Stability in Online Coalition Formation (2312.09119v1)

Published 14 Dec 2023 in cs.GT and cs.DS

Abstract: Coalition formation is concerned with the question of how to partition a set of agents into disjoint coalitions according to their preferences. Deviating from most of the previous work, we consider an online variant of the problem, where agents arrive in sequence and whenever an agent arrives, they have to be assigned to a coalition immediately and irrevocably. The scarce existing literature on online coalition formation has focused on the objective of maximizing social welfare, a demanding requirement, even in the offline setting. Instead, we seek to achieve stable coalition structures in an online setting, and focus on stability concepts based on deviations by single agents. We present a comprehensive picture in additively separable hedonic games, leading to dichotomies, where positive results are obtained by deterministic algorithms and negative results even hold for randomized algorithms.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (39)
  1. J. Alcalde and P. Revilla. Researching with whom? Stability and manipulation. Journal of Mathematical Economics, 40(8):869–887, 2004.
  2. M. Aleksandrov and T. Walsh. Strategy-proofness, envy-freeness and Pareto efficiency in online fair division with additive utilities. In Proceedings of the 16th Pacific Rim International Conference on Artificial Intelligence (PRICAI), pages 527–541. Springer, 2019.
  3. H. Aziz and R. Savani. Hedonic games. In F. Brandt, V. Conitzer, U. Endriss, J. Lang, and A. D. Procaccia, editors, Handbook of Computational Social Choice, chapter 15. Cambridge University Press, 2016.
  4. Computing desirable partitions in additively separable hedonic games. Artificial Intelligence, 195:316–334, 2013.
  5. Fractional hedonic games. ACM Transactions on Economics and Computation, 7(2):1–29, 2019.
  6. Core in a simple coalition formation game. Social Choice and Welfare, 18:135–153, 2001.
  7. Nash stable outcomes in fractional hedonic games: Existence, efficiency and computation. Journal of Artificial Intelligence Research, 62:315–371, 2018.
  8. Hedonic games with fixed-size coalitions. In Proceedings of the 36th AAAI Conference on Artificial Intelligence (AAAI), pages 9287–9295, 2022.
  9. Causes of stability in dynamic coalition formation. In Proceedings of the 37th AAAI Conference on Artificial Intelligence (AAAI), pages 5499–5506, 2023.
  10. A. Bogomolnaia and M. O. Jackson. The stability of hedonic coalition structures. Games and Economic Behavior, 38(2):201–230, 2002.
  11. Single-agent dynamics in additively separable hedonic games. In Proceedings of the 36th AAAI Conference on Artificial Intelligence (AAAI), pages 4867–4874, 2022.
  12. Reaching individually stable coalition structures. ACM Transactions on Economics and Computation, 11(1–2):4:1–65, 2023.
  13. M. Bullinger. Pareto-optimality in cardinal hedonic games. In Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems (AAMAS), pages 213–221, 2020.
  14. M. Bullinger. Boundaries to single-agent stability in additively separable hedonic games. In Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science (MFCS), pages 26:1–26:15, 2022.
  15. M. Bullinger and R. Romen. Online coalition formation under random arrival or coalition dissolution. In Proceedings of the 31st Annual European Symposium on Algorithms (ESA), pages 27:1–27:18, 2023.
  16. M. Bullinger and W. Suksompong. Topological distance games. In Proceedings of the 37th AAAI Conference on Artificial Intelligence (AAAI), pages 5549–5556, 2023.
  17. Local core stability in simple symmetric fractional hedonic games. In Proceedings of the 18th International Conference on Autonomous Agents and Multiagent Systems (AAMAS), pages 574–582, 2019.
  18. K. Cechlárová and A. Romero-Medina. Stability in coalition formation games. International Journal of Game Theory, 29:487–494, 2001.
  19. D. Dimitrov and S. C. Sung. On top responsiveness and strict core stability. Journal of Mathematical Economics, 43(2):130–134, 2007.
  20. Simple priorities and core stability in hedonic games. Social Choice and Welfare, 26(2):421–433, 2006.
  21. L. Doval. Dynamically stable matching. Theoretical Economics, 17(2):687–724, 2022.
  22. J. H. Drèze and J. Greenberg. Hedonic coalitions: Optimality and stability. Econometrica, 48(4):987–1003, 1980.
  23. Price of pareto optimality in hedonic games. Artificial Intelligence, 288:103357, 2020.
  24. Online ad assignment with free disposal. In Proceedings of the 5th International Conference on Web and Internet Economics (WINE), pages 374–385, 2009.
  25. Strategyproof mechanisms for additively separable and fractional hedonic games. Journal of Artificial Intelligence Research, 70:1253–1279, 2021a.
  26. On the online coalition structure generation problem. Journal of Artificial Intelligence Research, 72:1215–1250, 2021b.
  27. Strategyproof mechanisms for friends and enemies games. Artificial Intelligence, 302:103610, 2022.
  28. M. Gairing and R. Savani. Computing stable outcomes in symmetric additively separable hedonic games. Mathematics of Operations Research, 44(3):1101–1121, 2019.
  29. D. Gale and L. S. Shapley. College admissions and the stability of marriage. The American Mathematical Monthly, 69(1):9–15, 1962.
  30. Z. Huang and T. Tröbst. Online matching. In F. Echenique, N. Immorlica, and V. V. Vazirani, editors, Online and Matching-Based Market Design. Cambridge University Press, 2023.
  31. How to match when all vertices arrive online. In Proceedings of the 50th Annual ACM Symposium on Theory of Computing (STOC), pages 17–29, 2018.
  32. An optimal algorithm for on-line bipartite matching. In Proceedings of the 22nd Annual ACM Symposium on Theory of Computing (STOC), pages 352–358, 1990.
  33. T. Morrill. The roommates problem revisited. Journal of Economic Theory, 145(5):1739–1756, 2010.
  34. M. Olsen. Nash stability in additively separable hedonic games and community structures. Theory of Computing Systems, 45:917–925, 2009.
  35. Online hypergraph matching with delay. Operations Research, 70(4):2194 – 2212, 2022.
  36. S. C. Sung and D. Dimitrov. Computational complexity in additive hedonic games. European Journal of Operational Research, 203(3):635–639, 2010.
  37. Y. Wang and S. C. Wong. Two-sided online bipartite matching and vertex cover: Beating the greedy algorithm. In Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming (ICALP), pages 1070–1081, 2015.
  38. G. J. Woeginger. A hardness result for core stability in additive hedonic games. Mathematical Social Sciences, 65(2):101–104, 2013.
  39. A. C.-C. Yao. Probabilistic computations: Toward a unified measure of complexity. In Proceedings of the 18th Symposium on Foundations of Computer Science (FOCS), pages 222–227. IEEE Computer Society Press, 1977.
Citations (3)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now
X Twitter Logo Streamline Icon: https://streamlinehq.com

Tweets