In hedonic games, a set of n agents, having preferences over all possible coalition
structures, needs to agree on a stable outcome. In this work, we initiate the study of hedonic …

We study the problem of allocating indivisible items to agents with additive valuations, under
the additional constraint that bundles must be connected in an underlying item graph …

We study the fair division problem consisting in allocating one item per agent so as to avoid
(or minimize) envy, in a setting where only agents connected in a given network may …

Finding an envy-free allocation of indivisible resources to agents is a central task in many
multiagent systems. Often, non-trivial envy-free allocations do not exist and determining …

The housing market [24] is one of the most investigated model for multi-agent resource
allocation. In traditional housing markets, each agent is endowed with a single unit of an …

Core-selection is a crucial property of rules in the literature of resource allocation. It is also
desirable, from the perspective of mechanism design, to address the incentive of agents to …

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 …

Social networks play a central role in the transactions and decision making of individuals by
correlating the behaviors and preferences of connected agents. We introduce a notion of …

The classical house allocation problem involves assigning $ n $ houses (or items) to $ n $
agents according to their preferences. A key criterion in such problems is satisfying some …

We study the problem of allocating indivisible objects to a set of rational agents where each
agent's final utility depends on the intrinsic valuation of the allocated item as well as the …