AIConfPaper
IJCAI 20260 citations

Stability and Efficiency in Hedonic Project Games

Jaber Valizadeh, Dongmo Zhang, Omar Mubin

Abstract

We introduce Hedonic Project Games, a model in which agents choose projects with divisible rewards while holding subjective preferences over coalition composition. This framework captures a fundamental trade-off absent from existing models: agents care simultaneously about who they collaborate with and what they work on. We study three stability notions: classical Nash Stability and two refinements, Joining Stability and Leaving Stability, which account for the welfare of both the deviating agent and the affected coalition members. We evaluate the efficiency of stable outcomes using the Price of Anarchy and Price of Stability, comparing the social welfare of stable outcomes to that of an optimal allocation. While stable outcomes may not exist in general, we identify broad and natural preference classes in which stability and efficiency improve significantly. In particular, under monotonic-decreasing preferences in coalition size, Nash and joining stability coincide and are guaranteed to exist, whereas leaving stability may fail. Under per-capita non-decreasing preferences, socially optimal outcomes are always Nash stable and coincide with leaving stability, although equilibrium inefficiency remains unbounded. Experiments on synthetic and real-world data support the theoretical efficiency results.

Agent-based and Multi-agent Systems: Agent theories and modelsAgent-based and Multi-agent Systems: Coordination and cooperationAgent-based and Multi-agent Systems: Resource allocationGame Theory and Economic Paradigms: Cooperative gamesGame Theory and Economic Paradigms: Noncooperative games
BibTeX
@inproceedings{ijcai2026_stabilityandeffi,
  title = {Stability and Efficiency in Hedonic Project Games},
  author = {Jaber Valizadeh and Dongmo Zhang and Omar Mubin},
  booktitle = {IJCAI 2026},
  year = {2026}
}
Stability and Efficiency in Hedonic Project Games · IJCAI 2026