We analyze bankruptcy problems with an indivisible object, where real owners and outside traders want to allocate an indivisible object among them with monetary compensation. The object might be a company that has gone bankrupt or a house left by a parent who has died, and so on. We show that...

We study a many-to-one matching problem between institutions and individuals where an institution can possibly be matched to more than one individual. The matching market contains some couples who view pairs of jobs as complements. Institutions' preferences over sets of individuals are assumed...

We propose a solution to the trade-off between Pareto efficiency and stability in matching markets. We define a matching to be essentially stable if any claim initiates a chain of reassignments that ultimately results in the initial claimant losing the object she claimed to a third agent. Our...

I introduce a stability notion, dynamic stability, for two-sided dynamic matching markets where (i) matching opportunities arrive over time, (ii) matching is one-to-one, and (iii) matching is irreversible. The definition addresses two conceptual issues. First, since not all agents are available...

Deferred Acceptance (DA), a widely implemented algorithm, is meant to improve allocations: under classical preferences, it induces preference-concordant rankings. However, recent evidence shows that—in both real, large-stakes applications and experiments—participants frequently play...

I study costly information acquisition in a two-sided matching problem, such as matching applicants to schools. Applicant's utility is a sum of common and idiosyncratic components. The idiosyncratic component is unknown to applicants but can be learned at a cost. When applicants are assigned...

We study efficient and stable mechanisms in matching markets when the number of agents is large and individuals' preferences and priorities are drawn randomly. When agents' preferences are uncorrelated, then both efficiency and stability can be achieved in an asymptotic sense via standard...

We consider the multi-object allocation problem with monetary transfers where each agent obtains at most one object (unit-demand). We focus on allocation rules satisfying individual rationality, no subsidy, efficiency, and strategy-proofness. Extending the result of Morimoto and Serizawa (2015),...

Despite the truthful dominant strategy, participants in strategy-proof mechanisms submit manipulated preferences. In our model, participants dislike rejections and enjoy the confirmation from getting what they declared most desirable. Formally, the payoff from a match decreases in its position...

In 56 developing and developed countries, blood component donations by volunteer non-remunerated donors can only meet less than 50% of the demand. In these countries, blood banks rely heavily on replacement donor programs that provide blood to patients in return for donations made by their close...