We study the formation of stable outcomes via simple dynamics in cardinal hedonic games,
where the utilities of agents change over time depending on the history of the coalition …

We introduce a class of strategic games in which agents are assigned to nodes of a topology
graph and the utility of an agent depends on both the agent's inherent utilities for other …

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 study a variant of hedonic games, called hedonic seat arrangements in the literature,
where the goal is not to partition the agents into coalitions but to assign them to vertices of a …

We consider the problem of partitioning n agents in an undirected social network into k
almost equal in size (differing by at most one) groups, where the utility of an agent for a …

We study four NP-hard optimal seat arrangement problems [Bodlaender et al., 2020a], which
each have as input a set of n agents, where each agent has cardinal preferences over other …

Coalition formation considers the question of how to partition a set of $ n $ agents into
disjoint coalitions according to their preferences. We consider a cardinal utility model with …

Social distance games have been extensively studied as a coalition formation model where
the utilities of agents in each coalition were captured using a utility function $ u $ that took …

Arabic topic detection is a Natural Language Processing (NLP) task that aims to assign a
topic or a set of topics to a new document based on its content and selected features …

A group of n agents with numerical preferences for each other are to be assigned to the n
seats of a dining table. We study two natural topologies: circular (cycle) tables and panel …