We study two-sided many-to-one matching markets with interdependent valuations and im-perfect information held by one side of the market. The other side has common and known preferences over potential mates. In this setting, pairwise stability does not imply group stabil-ity: mechanisms that are stable with respect to deviations by pairs of agents may be vulnerable to deviations by groups. We formalize a notion of group stability and construct a “modified serial dictatorship ” mechanism that implements group stable matchings. We further discuss the robustness of our notion of stability and examine efficiency properties of modified serial dictatorship
The static matching models have been applied to real-life markets such as hospital intern markets, s...
The static matching models have been applied to real-life markets such as hospital intern markets, s...
We develop a theory of stability in many-to-many matching markets. We give conditions under which th...
Pairwise-stable matching mechanisms are practically used and per-form very well in the real world tw...
We introduce a new dynamic framework to analyze two-sided matching interactions that occur repeatedl...
In two-sided matching markets with interdependent values the matching outcome has infor-mational con...
We study strategy-profness in many-to many matching markets. We prove that when firms have acyclica...
We study strategy-profness in many-to many matching markets. We prove that when firms have acyclica...
We study strategy-profness in many-to many matching markets. We prove that when firms have acyclica...
We study the existence of group strategy-proof stable rules in many to-many matching markets. We sho...
Stability of matchings was proved to be a new cooperative equilibrium concept in Sotomayor (Dynamics...
In a decentralized setting the game-theoretical predictions are that only strong blockings are allow...
Stability of matchings was proved to be a new cooperative equilibrium concept in Sotomayor (Dynamics...
In a decentralized setting the game-theoretical predictions are that only strong blockings are allow...
Ostrovsky (2008) [9] develops a theory of stability for a model of matching in exogenously given net...
The static matching models have been applied to real-life markets such as hospital intern markets, s...
The static matching models have been applied to real-life markets such as hospital intern markets, s...
We develop a theory of stability in many-to-many matching markets. We give conditions under which th...
Pairwise-stable matching mechanisms are practically used and per-form very well in the real world tw...
We introduce a new dynamic framework to analyze two-sided matching interactions that occur repeatedl...
In two-sided matching markets with interdependent values the matching outcome has infor-mational con...
We study strategy-profness in many-to many matching markets. We prove that when firms have acyclica...
We study strategy-profness in many-to many matching markets. We prove that when firms have acyclica...
We study strategy-profness in many-to many matching markets. We prove that when firms have acyclica...
We study the existence of group strategy-proof stable rules in many to-many matching markets. We sho...
Stability of matchings was proved to be a new cooperative equilibrium concept in Sotomayor (Dynamics...
In a decentralized setting the game-theoretical predictions are that only strong blockings are allow...
Stability of matchings was proved to be a new cooperative equilibrium concept in Sotomayor (Dynamics...
In a decentralized setting the game-theoretical predictions are that only strong blockings are allow...
Ostrovsky (2008) [9] develops a theory of stability for a model of matching in exogenously given net...
The static matching models have been applied to real-life markets such as hospital intern markets, s...
The static matching models have been applied to real-life markets such as hospital intern markets, s...
We develop a theory of stability in many-to-many matching markets. We give conditions under which th...