This paper studies the identification of best response functions in binary games without making strong parametric assumptions about the payoffs. The best response function gives the utility maximizing response to a decision of the other players. This is analogous to the response function in the...

This article uses the model proposed by Chiappori, Levitt, and Groseclose to test for mixed-strategy Nash equilibria in a game between a kicker and a goalkeeper in the situation of a penalty kick in soccer. The main contribution of this article is to develop an alternative testing methodology on...

We introduce a new zero-sum matrix game for modeling search in structured domains. In this game, one player tries to find a "bug" while the other tries to hide it. Both players exploit the structure of the "search" domain. Intuitively, this search game is a mathematical generalization of the...

This paper offers the generalization that competitive promotions are mixed strategies. First an empirical regularity is established that promotions are independent across competitors. This regularity is then elaborated on in the context of a promotion game. The promotion game is linked to...

We examine whether the predictions of minimax in zero-sum games holds under highly incentivized conditions with highly informed informed decision makers. We examine data from 3455 National Football League (NFL) games from the 2000 season through the 2012 season. We categorize every relevant play...

In a mixed-strategy Nash equilibrium, changing one player's payoffs affects only the other player's equilibrium strategy mix. This `Payoff Irrelevance Proposition' (PIP) appears to undercut the main foundations of economic policy analysis since, allegedly, equilibrium behavior will not respond...