Predictions under common knowledge of payoffs may differ from those under arbitrarily, but finitely, many orders of mutual knowledge; Rubinstein's (1989)Email game is a seminal example. Weinstein and Yildiz (2007) showed that the discontinuity in the example generalizes: for all types with...

Restricting attention to economic environments, we study implementation under perturbed better-response dynamics (BRD). A social choice function (SCF) is implementable in stochastically stable strategies of perturbed BRD whenever the only outcome supported by the stochastically stable strategies...

The majority runoff system is widely used around the world. Yet, our understanding of its properties and of voters’ behavior is limited. In this paper, we fully characterize the set of strictly perfect voting equilibria in large three-candidate majority runoff elections. Considering all...

We study the possibilities for agenda manipulation under strategic voting for two prominent sequential voting procedures: the amendment procedure and the suc- cessive procedure. We show that a well known result for tournaments, namely that the successive procedure is (weakly) more manipulable...

This paper investigates rationalizable implementation of social choice functions (SCFs) in incomplete information environments. We identify weak interim rationalizable monotonicity (weak IRM) as a novel condition and show that weak IRM is a necessary and almost sufficient condition for...

We introduce a learning framework in which a principal seeks to determine the ability of a strategic agent. The principal assigns a test consisting of a finite sequence of tasks. The test is adaptive: each task that is assigned can depend on the agent's past performance. The probability of...