Advances in Contests
Friday, Jan. 6, 2017 10:15 AM – 12:15 PM
Hyatt Regency Chicago, Michigan 1A & 1B
- Chair: Ron Siegel, Pennsylvania State University
All-Pay Auctions With Ties
AbstractWe study the symmetric, two-player, complete information all-pay auction in which a tie ensues if neither player outbids the other by more than a given amount. In the event of a tie, each player receives an identical fraction of the winning prize. Thus players engage in competition over two margins: losing versus tying, and tying versus winning. Two pertinent parameters are the margin required for victory, and the value of tying relative to winning. We fully characterize the set of Nash equilibria for the entire parameter space. For much of the parameter space, there is a unique Nash equilibrium which is also symmetric. Equilibria typically involve randomizing over multiple disjoint intervals, so that in essence players randomize between attempting to tie and attempting to win. In equilibrium, expected bids and payoffs are non-monotonic in both the margin required for victory and the relative value of tying.
'Risk-Taking in Contests-The Impact of Fund-Manager Compensation on Investor Welfare
AbstractWe analyze the effect of different patent protection policies in a dynamic perpetual race. Each firm continuously decides how much to invest in R&D to improve their technology. At any point in time,<br />
the firm with the better technology receives a higher market share and higher profits. <br />
We characterize equilibrium R&D efforts as a function of the strength of patent protection, i.e., the rate at which a firm is allowed to use technologies developed by the rival firm. The effort-maximizing patent protection level is typically intermediate and we discuss its relation to industry-specific parameters such as the speed and randomness of research progress.
Ranking Disclosure Policies in All-Pay Auctions With Incomplete Information
AbstractIn this paper, we study information disclosure policies in all-pay auctions with incomplete information. There are two symmetric players whose values can be high or low, which are their private information. The contest organizer observes the players’ values ex post, and she can commit ex ante to four different symmetric information policies exhaustively. First, she can always disclose publicly the types of the players regardless. Second, she can conceal the types of the players regardless. Third, she can disclose publicly the players’ types if and only both are of high type. Fourth, she can disclose publicly the players’ types if and only both are of low type. We characterize explicitly the unique equilibrium for every scenario. Based on the equilibrium analysis, we are able to completely rank the four disclosure policies by the expected effort induced and players’ expected payoffs. We find that the full concealment policy extracts the highest aggregate expected efforts, which is followed by the policy of disclosing types if and only if both are high, and the policy of disclosing types if and only if both are low induces the least total expected effort. The players enjoy the highest expected payoffs under the policy of disclosing types when both are low, and all other three policies render the same expected payoffs to the players.
- C7 - Game Theory and Bargaining Theory
- D4 - Market Structure, Pricing, and Design