We introduce a general class of simplicity concepts that vary the foresight abilities required of agents in extensive-form games, and use it to provide characterizations of simple mechanisms in social choice environments with and without transfers. We show that obvious strategy-proofness—an...

We introduce a general class of simplicity standards that vary the foresight abilities required of agents in extensive-form games. Rather than planning for the entire future of a game, agents are presumed to be able to plan only for those histories they view as simple from their current...

We introduce a general class of simplicity standards that vary the foresight abilities required of agents in extensive-form games. Rather than planning for the entire future of a game, agents are presumed to be able to plan only for those histories they view as simple from their current...

Many institutions use matching algorithms to allocate resources to individuals. Examples include the assignment of doctors, students and military cadets to hospitals, schools and branches, respectively. Oftentimes, agents' ordinal preferences are highly correlated, motivating the use of...

Allocation and exchange of discrete resources such as kidneys, school seats, and many other resources for which agents have single-unit demand is conducted via direct mechanisms without monetary transfers. Incentive compatibility and efficiency are primary concerns in designing such mechanisms....