We study the effectiveness of iterated elimination of strictly-dominated actions in random games. We show that dominance solvability of games is vanishingly small as the number of at least one player's actions grows. Furthermore, conditional on dominance solvability, the number of iterations...

We study the impacts of incomplete information on centralized one-to-one matching markets. We focus on the commonly used Deferred Acceptance mechanism (Gale and Shapley, 1962). We show that many complete-information results are fragile to a small infusion of uncertainty about others' preferences

We examine friendships and study partnerships among university students over several years. At the aggregate level, connections increase over time, but homophily on gender and ethnicity is relatively constant across time, university residences, and different network layers. At the individual...

The experimental literature on repeated games has largely focused on settings where players discount the future identically. In applications, however, interactions often occur between players whose time preferences differ. We study experimentally the effects of discounting differentials in...