Consistency and population sensitivity properties in marriage and roommate markets

We consider one-to-one matching markets in which agents can either be matched as pairs or remain single. In these so-called roommate markets agents are consumers and resources at the same time. Klaus (Games Econ Behav 72:172-186, 2011) introduced two new "population sensitivity” properties that capture the effect newcomers have on incumbent agents: competition sensitivity and resource sensitivity. On various roommate market domains (marriage markets, no-odd-rings roommate markets, solvable roommate markets), we characterize the core using either of the population sensitivity properties in addition to weak unanimity and consistency. On the domain of all roommate markets, we obtain two associated impossibility result

Consistency and population sensitivity properties in marriage and rommate markets

We consider one-to-one matching markets in which agents can either be matched as pairs or remain single. In these so-called roommate markets agents are consumers and resources at the same time. Klaus (Games Econ Behav 72:172-186, 2011) introduced two new "population sensitivity" properties that capture the effect newcomers have on incumbent agents: competition sensitivity and resource sensitivity. On various roommate market domains (marriage markets, no-odd-rings roommate markets, solvable roommate markets),we characterize the core using either of the population sensitivity properties in addition to weak unanimity and consistency. On the domain of all roommate markets, we obtain two associated impossibility results

Competition and Resource Sensitivity in Marriage and Roommate Markets

We consider one-to-one matching markets in which agents can either be matched as pairs or remain single. In these so-called roommate markets agents are consumers and resources at the same time. We investigate two new properties that capture the effect newcomers have on incumbent agents. Competition sensitivity focuses on newcomers as additional consumers and requires that some incumbents will suffer if competition is caused by newcomers. Resource sensitivity focuses on newcomers as additional resources and requires that this is beneficial for some incumbents. For solvable roommate markets, we provide the first characterizations of the core using either competition or resource sensitivity. On the domain of all roommate markets, we obtain two associated impossibility results.core; matching; competition sensitivity; resource sensitivity; roommate market

Competition and Resource Sensitivity in Marriage and Roommate Markets

We consider one-to-one matching markets in which agents can either be matched as pairs or remain single. In these so-called roommate markets agents are consumers and resources at the same time. We investigate two new properties that capture the effect a newcomer has on incumbent agents. Competition sensitivity focuses on the newcomer as additional consumer and requires that some incumbents will suffer if competition is caused by a newcomer. Resource sensitivity focuses on the newcomer as additional resource and requires that this is beneficial for some incumbents. For solvable roommate markets, we provide the first characterizations of the core using either competition or resource sensitivity. On the domain of all roommate markets, we obtain two associated impossibility results.Core, Matching, Competition Sensitivity, Resource Sensitivity, Roommate Market.

Competition and Resource Sensitivity in Marriage and Roommate Markets

We consider one-to-one matching markets in which agents can either be matched as pairs or remain single. In these so-called roommate markets agents are consumers and resources at the same time. We investigate two new properties that capture the effect a newcomer has on incumbent agents. Competition sensitivity focuses on the newcomer as additional consumer and requires that some incumbents will suffer if competition is caused by a newcomer. Resource sensitivity focuses on the newcomer as additional resource and requires that this is beneficial for some incumbents. For solvable roommate markets, we provide the first characterizations of the core using either competition or resource sensitivity. On the class of all roommate markets, we obtain two associated impossibility results.microeconomics ;

Competition and resource sensitivity in marriage and roommate markets

We consider one-to-one matching in which agents can either be matched as pairs or remain single. In these so-called roommate markets agents are consumers and resources at the same time. We investigate two new properties that capture the effect a newcomer has on incumbent agents. Competition sensitivity focuses on the newcomer as additional consumer and requires that some incumbents will suffer if competition is caused by a newcomer. Resource sensitivity focuses on the newcomer as additional resource and requires that this is beneficial for some incumbents. Our main results are two characterizations of the core by unanimity, Maskin monotonicity, and either competition or resource sensitivity for solvable roommate markets and two associated impossibility results on the general domain. JEL classification: C78, D63

A new solution concept for the roommate problem

Abstract 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 matchings (Abraham et al., 2006) and maximum stable matchings (Tan 1990, 1991b). These solution concepts are all core consistent. We find that almost stable matchings are incompatible with the other two concepts. Hence, to solve the roommate problem we propose matchings that lie at the intersection of the maximum irreversible matchings and maximum stable matchings, which we call Q -stable matchings. We construct an efficient algorithm for computing one element of this set for any roommate problem. We also show that the outcome of our algorithm always belongs to an absorbing set (Inarra et al., 2013)

A new solution for the roommate problem: The Q-stable matchings

The aim of this paper is to propose a new solution for the roommate problem with strict preferences. We introduce the solution of maximum irreversibility and consider almost stable matchings (Abraham et al. [2])and maximum stable matchings (Ta [30] [32]). We find that almost stable matchings are incompatible with the other two solutions. Hence, to solve the roommate problem we propose matchings that lie at the intersection of the maximum irreversible matchings and maximum stable matchings, which are called Q-stable matchings. These matchings are core consistent and we offer an effi cient algorithm for computing one of them. The outcome of the algorithm belongs to an absorbing set.This research is supported by the Spanish Ministry of Science and Innovation (ECO2010- 17049 and ECO2012-31346), co-funded by ERDF, by Basque Government IT-568-13 and by the Government of Andalusia Project for Excellence in Research (P07.SEJ.02547). P eter Bir o also acknowledges the support from the Hungarian Academy of Sciences under its Momentum Programme (LD-004/2010), and the Hungarian Scientific Research Fund,OTKA, grant no.K108673

A new solution for the roommate problem

The aim of this paper is to propose a new solution for the roommate problem with strict references. We introduce the solution of maximum ir reversibility and consider almost stable matchings (Abraham et al. [2]) and maximum stable m atchings (Tan [30] [32]). We find that almost stable matchings are incompatible with the o ther two solutions. Hence, to solve the roommate problem we propose matchings that lie at t he intersection of the maximum irreversible matchings and maximum stable matchings , which are called Q-stable matchings. These matchings are core consistent and we offer an efficient algorithm for computing one of them. The outcome of the algorithm belongs to an ab sorbing set