mlsanityData to 14 Oct 2026

Metric Hedonic Games on the Line

arXiv 2602.05888 ↗First posted 5 Feb 2026cs.GT cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

Hedonic games are fundamental models for investigating the formation of coalitions among a set of strategic agents, where every agent has a certain utility for every possible coalition of agents it can be part of. To avoid the intractability of defining exponentially many utilities for all possible coalitions, many variants with succinct representations of the agents' utility functions have been devised and analyzed, e.g., modified fractional hedonic games by Monaco et al. [JAAMAS 2020]. We extend this by studying a novel succinct variant that is related to modified fractional hedonic games. In our model, each agent has a fixed type-value and an agent's cost for some given coalition is based on the differences between its value and those of the other members of its coalition. This allows to model natural situations like athletes forming training groups with similar performance levels or voters that partition themselves along a political spectrum. In particular, we investigate natural variants where an agent's cost is defined by distance thresholds, or by the maximum or average value difference to the other agents in its coalition. For these settings, we study the existence of stable coalition structures, their properties, and their quality in terms of the price of anarchy and the price of stability. Further, we investigate the impact of limiting the maximum number of coalitions. Despite the simple setting with metric distances on a line, we uncover a rich landscape of models, partially with counter-intuitive behavior. Also, our focus on both swap stability and jump stability allows us to study the influence of fixing the number and the size of the coalitions. Overall, we find that stable coalition structures always exist but that their properties and quality can vary widely.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 11 of its 38 references that are in the map. First posted on arXiv 5 Feb 2026.

Builds on

11 of 38 references.

References · 11

  1. 2017Fast Exact k-Means, k-Medians and Bregman Divergence Clustering in 1Dcited by 15
  2. 2017Fractional Hedonic Gamescited by 10
  3. 2018Schelling Segregation with Strategic Agentscited by 5
  4. 2019Schelling Games on Graphscited by 5
  5. 2019Convergence and Hardness of Strategic Schelling Segregationcited by 5
  6. 2020Topological Influence and Locality in Swap Schelling Gamescited by 4
  7. 2020Modified Schelling Gamescited by 4
  8. 2018Stable Outcomes in Modified Fractional Hedonic Gamescited by 3
  9. 2019Pareto optimal coalitions of fixed sizecited by 3
  10. 2023Constant Approximation for Individual Preference Stable Clusteringcited by 3
  11. 2024Friend- and Enemy-oriented Hedonic Games With Strangers Full Versioncited by 1

Built on by

Not cited yet.