We study the effect of prebidding and postbidding in first-price auctions with a single prize under incomplete information. All the bidders' values are private information except bidder 1's value which is commonly known. Bidder 1 places his bid either before (prebidding auction) or after...

We study two-player common-value all-pay auctions (contests) with asymmetric information under the assumption that one of the players has an information advantage over his opponent and both players are budget-constrained. We generalize the results for all-pay auctions with complete information,...

Under standard assumptions about players'cost functions, we show that a Tullock contest with asymmetric information has a pure strategy equilibrium. Next we study Tullock contests in which players have a common value and a common state-independent linear cost function. A two-player contest in...

We study two-player common-value all-pay auctions in which the players have ex-ante asymmetric information represented by finite partitions of the set of possible values of winning. We consider two families of such auctions: in the first, one of the players has an information advantage...

In a general model of common-value second-price auctions with differential information, we show equivalence between the following characteristics of a bidder: (i) having a dominant strategy; (ii) possessing superior information; (iii) being immune from winner's curse. When a dominant strategy...

We analyze a repeated first-price auction in which the types of the players are determined before the first round. It is proved that if every player is using either a belief-based learning scheme with bounded recall or a generalized fictitious play learning scheme, then for sufficiently large...

We analyze a repeated first-price auction in which the types of the players are determined before the first round. It is proved that if every player is using either a belief-based learning scheme with bounded recall or a generalized fictitious play learning scheme, then for sufficiently large...

We study two-player common-value all-pay auctions (contests) with asymmetric information under the assumption that one of the players has an information advantage over his opponent. We characterize the unique equilibrium in these contests, and examine the role of information in determining the...

We study two-player common-value all-pay auctions (contests) with asymmetric information under the assumption that one of the players has an information advantage over his opponent and both players are budget-constrained. We generalize the results for all-pay auctions with complete information,...

We analyze a repeated first-price auction in which the types of the players are determined before the first round. It is proved that if every player is using either a belief-based learning scheme with bounded recall or generalized fictitious play learning scheme, then for sufficiently large...