A compound game is an (n + 1) player game based on n two-person subgames. In each of these subgames player 0 plays against one of the other players. Player 0 is regulated, so that he must choose the same strategy in all n subgames. We show that every fictitious play process approaches the set of...

We study a two-stage all-pay auction with two identical prizes. In each stage, the players compete for one prize. Each player may win either one or two prizes. We analyze the unique subgame-perfect equilibrium of our model with two players where each player’s marginal values for the prizes are...