We study the existence of group strategy-proof stable rules in many-to-many matching markets under responsiveness of agents' preferences. We show that when firms have acyclical preferences over workers the set of stable matchings is a singleton, and the worker-optimal stable mechanism is a...

Gale and Shapley (1962) proposed that there is a similar game to the marriage problem called "the roommate problem". And, they showed that unlike the marriage problem, the roommate problem may have unstable solutions. In other words, the stability theorem fails for the roommate problem. 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 location. We assume that number of rooms are limited and thus no student can live by himself. Each student has strict preferences over their...

We study preferences over procedures in the presence of naive agents. We employ a school choice setting following Pathak and Sönmez (2008) who show that sophisticated agents are better off under the Boston mechanism than under a strategy-proof mechanism if some agents are sincere. We use lab...

We consider one-to-one matching problems under two modalities of uncertainty that differ in the way types are assigned to agents. Individuals have preferences over the possible types of the agents from the opposite market side and initially know the "name" but not the "type" of the other...

We consider one-to-one matching problems under two modalities of uncertainty that differ in the way types are assigned to agents. Individuals have preferences over the possible types of the agents from the opposite market side and initially know the “name” but not the ”type” of the other...