The study of matching problems typically assumes that agents precisely know their preferences over the goods to be assigned. Within applied contexts, this assumption stands out as particularly counterfactual. Parents typically do invest a large amount of time and resources to find the best...

We propose a way to compare the extent of preference misrepresentation between two strategies. We define a preference revelation mechanism to be monotone strategyproof if declaring a “more truthful” preference ordering dominates (with respect to the true preferences) declaring a “less...

A mechanism implements a social choice correspondence f in mixed Nash equilibrium if at any preference profile, the set of all pure and mixed Nash equilibriumoutcomes coincides with the set of f-optimal alternatives at that preference profile. This definition generalizes Maskin’s definition of...

A mechanism implements a social choice correspondence f in mixed Nash equilibrium if at any preference profile, the set of all pure and mixed Nash equilibrium outcomes coincides with the set of f-optimal alternatives at that preference profile. This definition generalizes Maskin's definition of...

This note studies the problem of implementing social choice correspondences in environments where individuals have doubts about the rationality of their opponents. We postulate the concept of "-minimax regret as our solution concept and show that social choice correspondences that are Maskin...