It is known that on some social choice and economic domains, a social choice function is coalition strategy-proof if and only if it is Maskin monotonic (e.g. Muller and Satterthwaite, 1977). This paper studies the foundation of those results. I provide a set of conditions which is sufficient for...

This paper discusses an aspect of computational complexity in social choice theory. We consider the problem of designing voting rules, which is formulated in terms of simple games. We prove that it is an NP-complete problem to decide whether a given simple game is stable, or not.

In a matching problem between students and schools, a mechanism is said to be robustly stable if it is stable, strategy-proof, and immune to a combined manipulation, where a student first misreports her preferences and then blocks the matching that is produced by the mechanism. We find that even...

This paper studies the problem of assigning a set of indivisible objects to a set of agents when monetary transfers are not allowed and agents reveal only ordinal preferences, but random assignments are possible. We offer two characterizations of the probabilistic serial mechanism, which assigns...

A new mechanism was introduced in New York City and Boston to assign students to public schools. This mechanism was advocated for its superior fairness property, besides others. We introduce a new framework for school-choice problems and two notions of fairness in lottery design based on ex-ante...

Online labor markets provide new opportunities for behavioral research, but conducting economic experiments online raises important methodological challenges. This particularly holds for interactive designs. In this paper, we provide a methodological discussion of the similarities and...

Online labor markets provide new opportunities for behavioral research, but conducting economic experiments online raises important methodological challenges. This particularly holds for interactive designs. In this paper, we provide a methodological discussion of the similarities and...

This paper defines the concept of feedback Kant-Nash equilibrium for a discrete-time model of resource exploitation by infinitely-lived Kantian and Nashian players, where we define Kantian agents as those who act in accordance with the categorical imperative. We revisit a well-known dynamic...

Players in a committee, council, or electoral college often wield asymmetric numbers of votes. Binary decision environments are then conventionally modeled as weighted voting games. We introduce weighted committee games in order to describe decisions on three or more alternatives in similarly...

Many real-life applications of house allocation problems are dynamic. For example, in the case of on-campus housing for college students, each year freshmen apply to move in and graduating seniors leave. Each student stays on campus for a few years only. A student is a newcomer in the beginning...