Morimitsu Kurino

Publications22
h-index9
Citations327
Highly Influential Citations35
Claim Author Page
Author pages are created from data sourced from our academic publisher partnerships and public sources.

Recommended Authors

  • Onur Kesten
  • 42 Publications, 1,053 Citations
  • T. Sönmez
  • 85 Publications, 8,356 Citations
  • A. Roth
  • 354 Publications, 36,812 Citations
  • M. Ünver
  • 69 Publications, 2,735 Citations
  • Publications
  • Influence
Two axiomatic approaches to the probabilistic serial mechanism
This paper studies the problem of assigning a set of indivisible objects to a set of agents when monetary transfers are not allowed and agents reveal only ordinal preferences, but random assignments… Expand
  • 78
  • 12
  • PDF
College admissions with entrance exams: Centralized versus decentralized
TLDR
We theoretically and experimentally study a college admissions problem in which colleges accept students by ranking students' efforts in entrance exams. Expand
  • 41
  • 6
  • PDF
An experimental study on the incentives of the probabilistic serial mechanism
TLDR
We report an experiment on the Probabilistic Serial (PS) mechanism, a recently discovered alternative to the widely used Random Serial Dictatorship mechanism, has attractive fairness and efficiency properties if people report their preferences truthfully. Expand
  • 44
  • 4
  • PDF
An Experimental Study on the Incentives of the Probabilistic Serial Mechanism
We report an experiment on the Probabilistic Serial (PS) mechanism for allocating indivisible goods. The PS mechanism, a recently discovered alternative to the widely used Random Serial Dictatorship… Expand
  • 11
  • 3
House allocation with overlapping generations
Many real-life applications of house allocation problems are dynamic. For example, each year college freshmen move in and seniors move out of on-campus housing. Each student stays on campus for only… Expand
  • 42
  • 2
  • PDF
Fair and Efficient Assignment via the Probabilistic Serial Mechanism
This paper studies the problem of assigning a set of indivisible objects to a set of agents when monetary transfers are not allowed. We offer two characterizations of the prominent lottery assignment… Expand
  • 16
  • 2
  • PDF
Second-best incentive compatible allocation rules for multiple-type indivisible objects
We consider the problem of allocating several types of indivisible goods when preferences are separable and monetary transfers are not allowed. Our finding is that the coordinatewise application of… Expand
  • 12
  • 2
  • PDF
Credibility, efficiency, and stability: a theory of dynamic matching markets
We introduce a dynamic framework to analyze two-sided matching interactions that occur repeatedly over time, such as teacher–student matching or hospital–intern markets in Britain. We propose a… Expand
  • 11
  • 1
  • PDF
On the (im)possibility of improving upon the student-proposing deferred acceptance mechanism
This paper studies a general school choice problem with or without outside options. The Gale-Shapley student-proposing deferred acceptance mechanism (DA) has played a central role not only in theory… Expand
  • 16
  • 1
  • PDF
Strategy-proof improvements upon deferred acceptance: A maximal domain for possibility
TLDR
We show that no strategy-proof mechanism Pareto improves upon DA whether students have outside options or not. Expand
  • 5
  • 1