Three all-pay auction models are examined. The first is a symmetric two-player binary-signal all-pay auction with correlated signals and interdependent valuations. The first chapter provides a complete characterization of each form of equilibrium and gives conditions for their existence. The main finding is that there generically exists a unique equilibrium. The unique equilibrium can only be one of four forms of equilibria. I apply my all-pay auction model to elections, where a candidate that receives good news from the polls behaves in a rationally overconfident manner and reduces her equilibrium effort. Consequently, the other candidate can win the election in an upset. The second chapter extends Chapter 1\u27s model to N signals. In com...
We study two-stage all-pay auctions with two identical prizes. In each stage, players compete for on...
This paper analyzes all-pay auctions where the bidders have affiliated values for the object for sal...
We analyze (non-deterministic) contests with anonymous contest success functions. There is no restri...
This paper analyzes all-pay auctions where the bidders have affiliated values for the object for sal...
We analyze all-pay auctions with affiliated values and binary signals. We analyze the unique symmetr...
An all pay, common value auction is proposed as a model of contests. The common value of the prize i...
We consider all-pay auctions in the presence of interdependent, affiliated valuations and private bu...
This paper considers all-pay contests in which the relationship between bids and allocations reflect...
In the first chapter, ¡°All-Pay Auctions with Resale¡±, I study equilibria of first- and second-pric...
In a (first price) all-pay auction, bidders simultaneously submit bids for an item. All players forf...
We extend the war of attrition and all-pay auction analysis of Krishna and Morgan (1997) to a stocha...
ABSTRACT. We re-visit the two-bidder, all-pay auction of Amann and Leininger (1996) allowing for int...
We study equilibria of first- and second-price all-pay auctions with resale when players’ signals ar...
Consider an all-pay auction with interdependent, affiliated valuations and private budget constraint...
We analyze (non-deterministic) contests with anonymous contest success functions. There is no restri...
We study two-stage all-pay auctions with two identical prizes. In each stage, players compete for on...
This paper analyzes all-pay auctions where the bidders have affiliated values for the object for sal...
We analyze (non-deterministic) contests with anonymous contest success functions. There is no restri...
This paper analyzes all-pay auctions where the bidders have affiliated values for the object for sal...
We analyze all-pay auctions with affiliated values and binary signals. We analyze the unique symmetr...
An all pay, common value auction is proposed as a model of contests. The common value of the prize i...
We consider all-pay auctions in the presence of interdependent, affiliated valuations and private bu...
This paper considers all-pay contests in which the relationship between bids and allocations reflect...
In the first chapter, ¡°All-Pay Auctions with Resale¡±, I study equilibria of first- and second-pric...
In a (first price) all-pay auction, bidders simultaneously submit bids for an item. All players forf...
We extend the war of attrition and all-pay auction analysis of Krishna and Morgan (1997) to a stocha...
ABSTRACT. We re-visit the two-bidder, all-pay auction of Amann and Leininger (1996) allowing for int...
We study equilibria of first- and second-price all-pay auctions with resale when players’ signals ar...
Consider an all-pay auction with interdependent, affiliated valuations and private budget constraint...
We analyze (non-deterministic) contests with anonymous contest success functions. There is no restri...
We study two-stage all-pay auctions with two identical prizes. In each stage, players compete for on...
This paper analyzes all-pay auctions where the bidders have affiliated values for the object for sal...
We analyze (non-deterministic) contests with anonymous contest success functions. There is no restri...