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 investigate the implications of imposing balanced consistency and balanced cost reduction in the context of sequencing problems. Balanced consistency requires that the effect on the payoff from the departure of one agent to another agent should be equal between any two agents. On the other...

We analyze a discrete-time search problem in which committee members inspect alternatives sequentially over a finite search horizon. A collective decision to stop searching and accept the current alternative is reached when it is supported by a threshold number of individual votes. We...

We investigate the implications of imposing balanced consistency and balanced cost reduction in the context of sequencing problems. Balanced consistency requires that the effect on the payoff from the departure of one agent to another agent should be equal between any two agents. On the other...

This paper studies a decentralized, dynamic matching and bargaining market: buyers and sellers are matched into pairs. Traders exit the market at a constant rate, inducing search costs (frictions). All price offers are made by sellers. Despite the fact that sellers have all the bargaining power...

This paper shows that all perfect Bayesian equilibria of a dynamic matching game with two-sided incomplete information of independent private values variety converge to competitive equilibria. Buyers purchase a bundle of heterogeneous, indivisible goods and sellers own one unit of an indivisible...

Steady state equilibria in heterogeneous agent matching models with search frictions have been shown to exist in Shimer and Smith (2000) under the assumption of a quadratic search technology. We extend their analysis to the commonly investigated linear search technology. -- Search ; Matching ;...

This paper provides a search theoretic model with endogenous job creation, and homogenous workers and firms. The model introduces bidding costs and allows the current employer to make a counteroffer with probability q when the worker receives an outside offer. In equilibrium, a higher level of...