We study what kind of equilibria of which mechanisms are ex post renegotiation-proof (EPRP), i.e., robust against the possibility of ex post renegotiation under a variety of renegotiation procedures, and which social choice functions are EPRP implementable. In complete information environments...

In the present paper we consider the allocation of costs in connection networks. Agents have connection demands in form of pairs of locations they want to have connected. Connections between locations are costly to build. The problem is to allocate costs of networks satisfying all connection...

This paper considers marriage problems, roommate problems with nonempty core, and college admissions problems with responsive preferences. All stochastically stable matchings are shown to be contained in the set of matchings which are most robust to one-shot deviation.

We prove existence of stationary Markov perfect equilibria in an infinite-horizon model of legislative policy making in which the policy outcome in one period determines the status quo for the next. We allow for a multidimensional policy space and arbitrary smooth stage utilities, and we assume...

Agents with single-peaked preferences share a resource coming from different suppliers; each agent is connected to only a subset of suppliers. Examples include workload balancing, sharing earmarked funds, and rationing utilities after a storm.

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 for all cardinal representations of the preference profile. Unlike Maskinʼs...

We study a social choice model with partially honest agents, and we show that strategy-proofness is a necessary and sufficient condition to achieve secure implementation. This result provides a behavioral foundation for the rectangularity property; and it offers as a by-product a revelation...

We uncover a new necessary condition for implementation in iteratively undominated strategies by mechanisms that satisfy the “best element property” where for each agent, there exists a strategy profile that gives him the highest payoff in the mechanism. This class includes finite and...

We characterize the boundaries of the set of transfers (extremal transfers) implementing a given allocation rule without imposing any assumptions on the agentʼs type space or utility function besides quasi-linearity. Exploiting the concept of extremal transfers allows us to obtain an exact...

In this paper, we examine the optimal mechanism design of selling an indivisible object to one regular buyer and one publicly known buyer, where inter-buyer resale cannot be prohibited. The resale market is modeled as a stochastic ultimatum bargaining game between the two buyers. We fully...