A decision maker, named Alice, wants to know if an expert has significant information about payoff-relevant probabilities of future events. The expert, named Bob, either knows this probability almost perfectly or knows nothing about it. Hence, both Alice and the uninformed expert face...

We study a class of chip strategies in repeated games of incomplete information. This class generalizes the strategies studied by Möbius (2001) in the context of a favor-exchange model and the strategies studied in our companion paper Olszewski and Safronov (2017). In two-player games, if...

We study chip-strategy equilibria in two-player repeated games. Intuitively, in these equilibria players exchange favors by taking individually suboptimal actions if these actions create a "gain" for the opponent larger than the player's "loss" from taking them. In exchange, the player who...

We provide conditions that simplify applying Reny's (1999) better-reply security to Bayesian games, and use these conditions to prove the existence of equilibria for classes of games in which payoff discontinuities arise only at "ties." These games include a general version of all-pay contests,...

Many sales, sports, and research contests are put in place to maximize contestants' performance. We investigate and provide a complete characterization of the prize structures that achieve this objective in settings with many contestants. The contestants may be ex-ante asymmetric in their...