We investigate strategic behavior in a centralized matching clearinghouse based on the Gale–Shapley deferred acceptance algorithm. To do so, we conduct a laboratory experiment to test the degree to which agents strategically misrepresent their preferences by submitting a “truncation” of their true preferences. Our experimental design uses a restricted environment in which a particular form of truncation is always a best response. We find that subjects do not truncate their preferences more often when truncation is profitable. They do, however, truncate their preferences less often when truncation is dangerous – that is, when there is a risk of “over-truncating” and remaining unmatched. Our findings suggest that behavioral insights can play ...
Within artificial intelligence, the sub-field of multi-agent systems studies the foundations of agen...
Motivated by growing evidence of agents' mistakes in strategically simple environments, we propose a...
Mechanisms which implement stable matchings are often observed to work well in practice, even in env...
We investigate strategic behavior in a centralized matching clearinghouse based on the Gale–Shapley ...
Since no stable matching mechanism can induce truth-telling as a dominant strategy for all participa...
We study the performance of two-sided matching clearinghouses in the laboratory. Our experimental d...
In this paper we explore how the balance of agents on the two sides of a matching market impacts the...
We modify the stable matching problem by allowing agents' preferences to depend on the endogenous ac...
We study comparative statics of manipulations by women in the men-proposing deferred acceptance mech...
We experimentally study the Gale and Shapley, 1962 mechanism, which is utilized in a wide set of app...
We consider two–sided many–to–many matching markets in which each worker may work for multiple firms...
This paper discusses the strategic manipulation of stable matching mechanisms. We provide a model of...
This thesis is divided into three chapters. In the first chapter, I study the use of an alternative ...
Starting with the celebrated work by Gale and Shapley (1962), the literature on matching theory and ...
We present an experimental study where we analyze three well-known matching mechanisms—the Boston, t...
Within artificial intelligence, the sub-field of multi-agent systems studies the foundations of agen...
Motivated by growing evidence of agents' mistakes in strategically simple environments, we propose a...
Mechanisms which implement stable matchings are often observed to work well in practice, even in env...
We investigate strategic behavior in a centralized matching clearinghouse based on the Gale–Shapley ...
Since no stable matching mechanism can induce truth-telling as a dominant strategy for all participa...
We study the performance of two-sided matching clearinghouses in the laboratory. Our experimental d...
In this paper we explore how the balance of agents on the two sides of a matching market impacts the...
We modify the stable matching problem by allowing agents' preferences to depend on the endogenous ac...
We study comparative statics of manipulations by women in the men-proposing deferred acceptance mech...
We experimentally study the Gale and Shapley, 1962 mechanism, which is utilized in a wide set of app...
We consider two–sided many–to–many matching markets in which each worker may work for multiple firms...
This paper discusses the strategic manipulation of stable matching mechanisms. We provide a model of...
This thesis is divided into three chapters. In the first chapter, I study the use of an alternative ...
Starting with the celebrated work by Gale and Shapley (1962), the literature on matching theory and ...
We present an experimental study where we analyze three well-known matching mechanisms—the Boston, t...
Within artificial intelligence, the sub-field of multi-agent systems studies the foundations of agen...
Motivated by growing evidence of agents' mistakes in strategically simple environments, we propose a...
Mechanisms which implement stable matchings are often observed to work well in practice, even in env...