Behavioral implementation studies implementation when agents' choices need not be rational. All existing papers of this literature, however, fail to handle a large class of choice behaviors because they rely on a well-known condition called Unanimity. This condition says, roughly speaking, that...

Behavioral implementation studies implementation when agents' choices need not be rational. All existing papers of this literature, however, fail to handle a large class of choice behaviors because they rely on a well-known condition called Unanimity. This condition says, roughly speaking, that...

We derive a necessary and a sufficient condition for Nash implementation with a procedurally fair mechanism. Our result has a nice analogue with the path-braking result of Maskin [Nash equilibrium and welfare optimality, Rev. Econ. Stud. 66 (1999) 23-38.], and therefore, it allows us to give a...

Often preferences of agents are such that any sensible goal of the collective must admit a tie between all alternatives. The standard formulation in mechanism design demand that in this case all alternatives are equilibrium outcomes of the social choice mechanism. However, as far as the idea of...

Agents are farsighted when they consider the ultimate consequences of their actions. We re-examine the classical questions of implementation theory under complete information in a setting with transfers, where farsighted coalitions are considered fundamental behavioral units, and the equilibrium...

Interviewing is a decisive stage of most processes that match candidates to firms and organizations. This paper studies how and why a candidate's interview outcome depends on the other candidates interviewed by the same evaluator. We use large-scale data from high-stakes admission and hiring...

Traditionally, economic models have attributed procrastination to present bias. However, procrastination may also arise when individuals derive anticipatory utility from holding motivated, overly optimistic beliefs about the workload they need to complete. This study provides a rigorous...

We study rotation programs within the standard implementation framework under complete information. A rotation program is a myopic stable set whose states are arranged circularly, and agents can effectively move only between two consecutive states. We provide characterizing conditions for the...

Numerous simple proofs of the celebrated Gibbard-Satterthwaite theorem (Gibbard, 1977, Satterthwaite, 1975) has been given in the literature. These are based on a number of different intuitions about the most fundamental reason for the result. In this paper we derive the Gibbard-Satterthwaite...

We study rotation programs within the standard implementation framework under complete information. A rotation program is a myopic stable set whose states are arranged circularly, and agents can effectively move only between two consecutive states. We provide characterizing conditions for the...