I study a mechanism design problem in which a designer allocates a single good to one of several agents, and the mechanism is followed by an aftermarket -- a post-mechanism game played between the agent who acquired the good and third-party market participants. The designer has preferences over...

Mechanisms used to derive optimal allocations are generally designed under the premise that agents fully know their preferences. It is often impossible to duplicate these optimal allocations when agents imperfectly observe object characteristics. I present a crowdsourcing mechanism to...

We study subgame-perfect implementation (SPI) mechanisms that have been proposed as a solution to incomplete contracting problems. We show that these mechanisms — which are based on off-equilibrium arbitration clauses that impose large fines for lying and the inappropriate use of arbitration...

We propose a notion of core for school choice problems. We say that a coalition of students is able to enforce a subassignment among them if, given their priorities at schools, other students together cannot exclude any of them from her assignment. An assignment is in the core if no coalition of...

In this paper, we allow budget-augmenting negative prizes in all-pay auctions with incomplete information, which in general entail endogenous participation of contestants, and investigate effort-maximizing rank-order-based prize allocation rule. We find that at the optimum, the adoption of...

This paper considers an implementation problem with bounded rationality of the agents. Bounded rationality presented here means that the agent might choose the agent's best response which is different from the agent's dominant strategy. To describe such a behavior, this paper introduces a new...

In the context of priority-based allocation of objects, we formulate methods to compare assignments in terms of their stability. We introduce three basic properties that a reasonable stability comparison should satisfy. We show that, for any stability comparison satisfying the three properties,...

We study the design of self-enforcing mechanisms that rely on neither a trusted third party (e.g., court, trusted mechanism designer) nor a long-term relationship. Instead, we use a smart contract written on blockchains as a commitment device. We design the digital court, a smart contract that...

We derive the revenue maximizing allocation of m units among n symmetric agents who have unit demand, and who take costly actions that influence their values before participating in the mechanism. The allocation problem with costly actions can be represented by a reduced form model where agents...