In this paper, we present a more simple and independent proof of Reny's theorem (1998), on the existence of a Nash equilibrium in discontinue game, with a better-reply secure game in a Hausdorff topological vector space stronger than Reny's one. We will get the equivalence if the payoff function...

We consider a standard two-player all-pay auction with private values, where the valuation for the object is private information to each bidder. The crucial feature is that one bidder is favored by the allocation rule in the sense that he need not bid as much as the other bidder to win the...

We consider a two-player all-pay auction with symmetric independent private values that are uniformly distributed. The designer chooses the size of a head start that is given to one of the players. The designer’s objective is to maximize a convex combination of the expected highest effort and...

We consider two-player, perfectly discriminatory, common-value contests (or all-pay auctions), in which one player knows the value of the contested object with certainty, and the other knows only its prior distribution. We show, among other things, that in equilibrium the players win with equal...