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 propose a new abstract definition of equilibrium in the spirit of competitive equilibrium: a
profile of alternatives and a public ordering (expressing prestige, price, or a social norm) …

In many economic contexts, agents from the same population team up to better exploit their
human capital. In such contexts (often called “roommate matching problems”), stable …

The aim of this paper is to propose a new solution concept for the roommate problem with
strict preferences. We introduce maximum irreversible matchings and consider almost stable …

We propose a model where agents are matched in pairs in order to undertake a project.
Agents have preferences over both the partner and the project they are assigned to. These …

We initiate the study of matching roommates and rooms wherein the preferences of agents
over other agents and rooms are complementary and represented by Leontief utilities. In this …

We study one-sided matching problem, also known as roommate problem, where a group of
people need to be paired in order to be assigned to certain rooms. We assume that number …

We study competitive equilibria in generalized matching problems. We show that, if there is
a competitive matching, then it is unique and the core is a singleton consisting of the …

This paper deals with roommate problems (Gale and Shapley, Am Math Mon 69 (1): 9–15,
1962) that are solvable, ie, have a non-empty core (set of stable matchings). We study rank …

Your college roommate is more than simply someone with whom you share a refrigerator;
they may significantly influence your educational achievement, health, and attitudes. It's no …