English
Related papers

Related papers: Testing Stability Properties in Graphical Hedonic …

200 papers

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…

Computer Science and Game Theory · Computer Science 2025-03-11 Martin Bullinger , René Romen

A key question in cooperative game theory is that of coalitional stability, usually captured by the notion of the \emph{core}--the set of outcomes such that no subgroup of players has an incentive to deviate. However, some coalitional games…

Computer Science and Game Theory · Computer Science 2010-10-21 Yoram Bachrach , Edith Elkind , Reshef Meir , Dmitrii Pasechnik , Michael Zuckerman , Joerg Rothe , Jeffrey S. Rosenschein

Nguyen et al. [1] introduced altruistic hedonic games in which agents' utilities depend not only on their own preferences but also on those of their friends in the same coalition. We propose to extend their model to coalition formation…

Computer Science and Game Theory · Computer Science 2023-01-16 Anna Maria Kerkmann , Simon Cramer , Jörg Rothe

To verify the robustness of a program or protocol, it is common in the computer science community to rely on the theoretical framework of game theory. In particular, if one seeks to enforce a desired property, or specification, despite an…

Computer Science and Game Theory · Computer Science 2026-05-20 Léonard Brice

Hedonic games formalize coalition formation scenarios where players evaluate an outcome based on the coalition they are contained in. Due to a large number of possible coalitions, compact representations of these games are crucial. We…

Computer Science and Game Theory · Computer Science 2022-02-01 Anja Rey , Lisa Rey

Hedonic games provide a general model of coalition formation, in which a set of agents is partitioned into coalitions, with each agent having preferences over which other players are in her coalition. We prove that with additively separable…

Computer Science and Game Theory · Computer Science 2017-06-05 Dominik Peters

We study coalition formation in the framework of fractional hedonic games (FHGs). The objective is to maximize social welfare in an online model where agents arrive one by one and must be assigned to coalitions immediately and irrevocably.…

Computer Science and Game Theory · Computer Science 2025-10-22 Martin Bullinger , René Romen , Alexander Schlenga

We consider the coalition formation games with an additional component, `noisy preferences'. Moreover, such noisy preferences are available only for a sample of coalitions. We propose a multiplicative noise model and obtain the prediction…

Computer Science and Game Theory · Computer Science 2023-01-25 Prashant Trivedi , Nandyala Hemachandra

Rational verification is the problem of determining which temporal logic properties will hold in a multi-agent system, under the assumption that agents in the system act rationally, by choosing strategies that collectively form a…

Multiagent Systems · Computer Science 2021-07-27 Julian Gutierrez , Lewis Hammond , Anthony W. Lin , Muhammad Najib , Michael Wooldridge

In this paper, we study a variant of hedonic games, called \textsc{Seat Arrangement}. The model is defined by a bijection from agents with preferences for each other to vertices in a graph $G$. The utility of an agent depends on the…

Computer Science and Game Theory · Computer Science 2025-07-30 Hans L. Bodlaender , Tesshu Hanaka , Lars Jaffke , Hirotaka Ono , Yota Otachi , Tom C. van der Zanden

We study strategic games on weighted directed graphs, where the payoff of a player is defined as the sum of the weights on the edges from players who chose the same strategy augmented by a fixed non-negative bonus for picking a given…

Computer Science and Game Theory · Computer Science 2016-04-19 Sunil Simon , Dominik Wojtczak

We conduct a computational analysis of fair and optimal partitions in additively separable hedonic games. We show that, for strict preferences, a Pareto optimal partition can be found in polynomial time while verifying whether a given…

Computer Science and Game Theory · Computer Science 2015-02-06 Haris Aziz , Felix Brandt , Hans Georg Seedig

In studies of social dynamics, cohesion refers to a group's tendency to stay in unity, which -- as argued in sociometry -- arises from the network topology of interpersonal ties between members of the group. We follow this idea and propose…

Social and Information Networks · Computer Science 2016-12-28 Jiamou Liu , Ziheng Wei

Coordination games have been of interest to game theorists, economists, and ecologists for many years to study such problems as the emergence of local conventions and the evolution of cooperative behavior. Approaches for understanding the…

Computer Science and Game Theory · Computer Science 2025-07-09 John S. McAlister , Nina H. Fefferman

The model of congestion games is widely used to analyze games related to traffic and communication. A central property of these games is that they are potential games and hence posses a pure Nash equilibrium. In reality it is often the case…

Computer Science and Game Theory · Computer Science 2011-11-17 Sergey Kuniavsky , Rann Smorodinsky

Concurrent stochastic games (CSGs) are an ideal formalism for modelling probabilistic systems that feature multiple players or components with distinct objectives making concurrent, rational decisions. Examples include communication or…

Logic in Computer Science · Computer Science 2020-07-27 Marta Kwiatkowska , Gethin Norman , David Parker , Gabriel Santos

In the game theory literature, there appears to be little research on equilibrium selection for normal-form games with an infinite strategy space and discontinuous utility functions. Moreover, many existing selection methods are not…

Computer Science and Game Theory · Computer Science 2018-09-24 Yuke Li , A. Stephen Morse

We study hedonic games with dichotomous preferences. Hedonic games are cooperative games in which players desire to form coalitions, but only care about the makeup of the coalitions of which they are members; they are indifferent about the…

Computer Science and Game Theory · Computer Science 2015-09-24 Haris Aziz , Paul Harrenstein , Jérôme Lang , Michael Wooldridge

We study strategic games on weighted directed graphs, in which the payoff of a player is defined as the sum of the weights on the edges from players who chose the same strategy, augmented by a fixed non-negative integer bonus for picking a…

Computer Science and Game Theory · Computer Science 2021-03-15 Krzysztof R. Apt , Sunil Simon , Dominik Wojtczak

Fractional hedonic games are coalition formation games where a player's utility is determined by the average value they assign to the members of their coalition. These games are a variation of graph hedonic games, which are a class of…

Computer Science and Game Theory · Computer Science 2023-10-10 Tesshu Hanaka , Airi Ikeyama , Hirotaka Ono