This paper studies the application of the notion of secure implementation (Cason, Saijo, Sjöström, and Yamato, 2006; Saijo, Sjöström, and Yamato, 2007) to the problem of allocating indivisible objects with monetary transfers. We propose a new domain-richness condition, termed as minimal...

We consider situations where a society tries to efficiently allocate several homogeneous and indivisible goods among agents. Each agent receives at most one unit of the good. For example, suppose that a government wishes to allocate a fixed number of licenses to operate in its country to private...

Negotiation involves determining not only an agreement's price, but also its content, which typically has many aspects. We model such negotiations and provide conditions under which negotiation leads to efficient outcomes, even in the face of substantial asymmetric information regarding the...

Goods and services---public housing, medical appointments, schools---are often allocated to individuals who rank them similarly but differ in their preference intensities. We characterize optimal allocation rules when individual preferences are known and when they are not. Several insights...

We develop a model of assignment games with pairwise-identitydependent externalities. A concept of conjectural equilibrium is proposed, and the universal conjecture is shown to be the necessary and sufficient condition for the general existence of equilibrium. We then apply the solution concept...

This article explores the impact of procedural information on the behavior of applicants under two of the most commonly used school admissions procedures: the Gale-Shapley mechanism and the Boston mechanism. In a lab experiment, I compare the impact of information about the mechanism,...

I study a central authority's ability to commit to a publicly announced mechanism in a one-to-one agent-object matching model. The authority announces a strategy-proof mechanism and then privately selects a mechanism to initiate a matching. An agent's observation in form of the final matching...

We develop a theory of negotiation in which deals have multiple dimensions that can be bundled together. We use theory and experiments to show that in such settings efficient trade is possible even with substantial asymmetric information. The benefits of identifying areas of mutual gain guide...

We study decentralized task coordination. Tasks are of varying complexity and agents asymmetric: agents capable of completing high-level tasks may also take on tasks originally contracted by lower-level agents, facilitating system-wide cost reductions. We suggest a family of decentralized...

We conduct an incentivized lab experiment to test participants' ability to understand the DA matching mechanism and the strategyproofness property, conveyed in different ways. We find that while many participants can (using a novel GUI) learn DA's mechanics and calculate its outcomes, such...