In a dynamic contest where it is costly to compete, a player who is behind must decide whether to surrender or to keep fighting in the face of bleak odds. We experimentally examine the game theoretic prediction of last stand behavior in a multi-battle contest with a winning prize and losing...

In a dynamic contest where it is costly to compete, a player who is behind must decide whether to surrender or to keep fighting in the face of bleak odds. We experimentally examine the game theoretic prediction of last stand behavior in a multi-battle contest with a winning prize and losing...

This article examines behavior in the two-player, constant-sum Colonel Blotto game with asymmetric resources in which players maximize the expected number of battlefields won. The experimental results support all major theoretical predictions. In the auction treatment, where winning a...

This article examines behavior in the two-player, constant-sum Colonel Blotto game with asymmetric resources in which players maximize the expected number of battlefields won. The experimental results support all major theoretical predictions. In the auction treatment, where winning a...