Three well-known matching mechanisms designed to solve the college admissions problems are analyzed in the experimental laboratory in different informational settings.We observe that when the level of information is significantly increased, the proportion of schools and teachers that submit their true preferences decreases. This affects largely the efficiency and stability of the Gale–Shapley and the Boston mechanisms. The TTC mechanism is less sensitive to information and outperforms the other two mechanisms in terms of efficiency and stability, and it is as successful as them in extracting private information.info:eu-repo/semantics/publishedVersio
We propose novel approaches and tests for estimating student preferences with data from centralized ...
We propose novel approaches to estimating student preferences with data from matching mechanisms, es...
Unsophisticated applicants can be at a disadvantage under manipulable and hence strategically demand...
We analyze two well-known matching mechanisms—the Gale-Shapley, and the Top Trading Cycles (TTC) me...
We analyze two well-known matching mechanisms—the Gale-Shapley, and the Top Trading Cycles (TTC) me...
We present an experimental study where we analyze three well-known matching mechanisms—the Boston, t...
We analyze two well-known matching mechanisms—the Gale-Shapley, and the Top Trading Cycles (TTC) me...
This article explores the impact of procedural information on the behavior of applicants under two o...
We present an experimental study where we analyze three well-known matching mechanisms the Boston, ...
Students participating in centralized admissions procedures do not typically have access to the info...
Students participating in centralized admissions procedures do not typically have access to the info...
Students participating in centralized admissions procedures do not typically have access to the info...
Students participating in centralized admissions procedures do not typically have access to the info...
This thesis consists of three independent essays on the design of matching markets, with a primary g...
Using a combination of experimental, theoretical, computational and empirical methods, my dissertati...
We propose novel approaches and tests for estimating student preferences with data from centralized ...
We propose novel approaches to estimating student preferences with data from matching mechanisms, es...
Unsophisticated applicants can be at a disadvantage under manipulable and hence strategically demand...
We analyze two well-known matching mechanisms—the Gale-Shapley, and the Top Trading Cycles (TTC) me...
We analyze two well-known matching mechanisms—the Gale-Shapley, and the Top Trading Cycles (TTC) me...
We present an experimental study where we analyze three well-known matching mechanisms—the Boston, t...
We analyze two well-known matching mechanisms—the Gale-Shapley, and the Top Trading Cycles (TTC) me...
This article explores the impact of procedural information on the behavior of applicants under two o...
We present an experimental study where we analyze three well-known matching mechanisms the Boston, ...
Students participating in centralized admissions procedures do not typically have access to the info...
Students participating in centralized admissions procedures do not typically have access to the info...
Students participating in centralized admissions procedures do not typically have access to the info...
Students participating in centralized admissions procedures do not typically have access to the info...
This thesis consists of three independent essays on the design of matching markets, with a primary g...
Using a combination of experimental, theoretical, computational and empirical methods, my dissertati...
We propose novel approaches and tests for estimating student preferences with data from centralized ...
We propose novel approaches to estimating student preferences with data from matching mechanisms, es...
Unsophisticated applicants can be at a disadvantage under manipulable and hence strategically demand...