Sep 2026· Proceedings of the Thirty-Fifth International Joint Conference on Artificial Intelligence· pp. 527-535· 0 citations· 49 references
Abstract
Understanding when fair allocation mechanisms lead to stable coalition structures is fundamental for designing robust multi-agent systems. We investigate the compatibility between stable allocations in transferable utility (TU) games and the stability of coalition structures in induced hedonic games, where agents' preferences over coalitions are derived from payoffs assigned by a fixed allocation rule applied to all subgames of the TU game. We analyze FX-FE strong Nash stability (SNS) in induced hedonic games, which captures a strong form of robustness under free-exit and free-entry conditions. We show that any efficient allocation rule ensuring core membership for the grand coalition induces a hedonic game that guarantees the existence of an FX-FE strong Nash stable partition. Examining the Shapley value, we further show that when it lies outside the core, the resulting hedonic game may or may not possess FX-FE strongly Nash stable partitions, highlighting a sensitive interaction between Shapley-based fairness and coalition-level stability. Our framework bridges SHAP methodology from explainable AI with hedonic coalition theory, providing theoretical foundations for understanding when fair allocation mechanisms shape coalition-level incentives in a way that ensures strategic stability in team formation and multi-agent systems.
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 o...
Jaber Valizadeh, Dongmo Zhang, Omar Mubin· Proceedings of the Thirty-Fi...· 0 citations
The random-order interpretation of the Shapley value specifies both a terminal allocation and a payment path: each entrant is paid her marginal contribution at the time of entry. We embed this path in a finite dynamic entry problem in which a selected player may accept immediately or defer and allow another outsider to...
Hedonic games are a central model of coalition formation, yet most of their general subclasses are marked by negative results: stable outcomes often fail to exist, and deciding their existence is typically computationally hard. The most notable exception is the class of hedonic games with the common ranking property (H...
Buğra Çaşkurlu, A. Eser· Proceedings of the Thirty-Fi...· 0 citations
Aggregate performance in smart mobility systems depends heavily on the emergent behavior of selfish, resource-sharing agents that participate within the systems. As a result, recent work has focused on how a system designer can leverage incentives to influence behavior so that system cost (e.g., traffic congestion) is...
Colton Hill, Brandon C. Collins, Philip N. Brown· 0 citations
Distributed network security requires multiple defenders to make coupled resource allocation and coordination decisions under limited budgets, connectivity-dependent risks, and non-negligible coordination costs. We develop a mathematical framework for jointly optimizing defensive resource allocation and coalition forma...
Ru-Fan Bai, Shuo-Tian Lin, Xin-Yang Liu et al.· Mathematics· 0 citations
We consider a resource allocation problem with strategic agents that have private stochastic satisfaction functions and local constraints. To achieve a global optimal solution, we propose an incentive mechanism that induces a game among the agents. For the payment function of the mechanism, we construct a family of qua...
Shaya Garjani, M. Shokri, Hamed Kebriaei· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.