A tournament is a simultaneous n-player game that is built on a two-player game g. We generalize Arad and Rubinstein's model assuming that every player meets each of his opponents twice to play a (possibly) asymmetric game g in alternating roles (using sports terminology, once "at home" and once...

We propose a two-player bargaining game where each player simultaneously proposes a set of lotteries on a finite set of alternatives. If the two sets have elements in common the outcome is selected by the uniform probability measure over the intersection. If otherwise the sets do not intersect...

We test the turnout predictions of the standard two-party, private value, costly voting model through a large-scale, real effort experiment. We do this by recruiting 1,200 participants through Amazon's Mechanical Turk and employing a 2 x 2 between subjects design encompassing small (N=30) and...

In the single-peaked domain, the median rules (Moulin, 1980) are of special interest. They are, essentially, the unique strategy-proof rules as well as the unique Nash implementable ones under complete information. We show that, under mild assumptions on admissible priors, they are also...