1 / 19

Contests with multiple rounds

Contests with multiple rounds. Huseyin Yildirim. Heriberto Gonzalez November 2007. Outline. Introduction Motivation The Model An extension Conclusions Future Extensions. Introduction.

maik
Download Presentation

Contests with multiple rounds

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Contests with multiple rounds Huseyin Yildirim Heriberto Gonzalez November 2007

  2. Outline Introduction Motivation The Model An extension Conclusions Future Extensions

  3. Introduction There is a growing strand in contest literature recognizing that contests where one player moves before the other. Dixit (1987). Strategies differ when players can precommit their efforts. The social cost associated with the rent seeking depends on which party moves first in sequential contest. Baik and Shogren (1992) and Leininger (1993) have endogenized the order of the moves in which players simultaneously decide and commit. They find that the Stackelberg play where the underdog leads is the unique equilibrium.

  4. Motivation These results rest on the assumption that agents can take action only once. There are many contests in which players can exert effort multiple times without pre-announcing, i.e., Presidential candidates visiting the same state multiple times; firms participating in research; and, athletes competing in multiple categories.

  5. Objective Extend the analysis by Dixit (1987) and capture the three main elements present in some contests: players can exert effort in multiple period before the contest concludes; they do so by observing their rival’s recent effort in an intermediate stage; and, the probability of winning depends on the cumulative effort levels

  6. The Model Two agents i=1,2 expend irreversible effort in two periods, t=1,2 and once these become common knowledge , they simultaneously choose whether to add to the previous amount in period 2 or not. Let ; and assume the logit form pi(X1,X2)= where

  7. The Model Thus, agent i’s expected payoff at the end of period 2 is given by Both symmetric and asymmetric players are considered Player 1 is the favorite and 2 the underdog by assuming that

  8. The Model Some facts about one-shot reaction function Fact 1. Given Xj, pi(.) is strictly concave in Xi Fact 2. Ri(Xj) strictly increases if the pair (Xi,Xj) is such that fi(Xi)>fj(Xj), reaches its maximum if fi(Xi)=fj(Xj), and strictly decreases if fi(Xi)<fj(Xj) Fact 3. Given that Xj= Rj(Xi), pi(.) is strictly concave in Xi,

  9. The Model The typical case,

  10. The Model • Recalling, • When there is an asymmetry between agents, given the opportunity to move first, the favorite overcommits to his effort compared to the Cournot-Nash equilibrium while the opposite holds for the underdog.

  11. The Model • When agents can exert effort in both periods, in order to find effort levels in a SPE, agent i solves the following program, conditional on the first period choices and conjecturing j’s second period amount, • or equivalently, • The solution is

  12. The Model • The continuation equilibrium occurs at the intersection of these truncated reaction function, thus second period equilibrium strategies: • If a player finds himself above his reaction function, then he will exert no further effort. Otherwise, it is best for the agent to add to his first period amount up to his reaction function.

  13. The Model • Based on these strategies, the equilibrium outcomes: • Refer to Fig.1 When contestants are unevenly matched, the equilibrium outcomes entail an element of leadership by the favorite in the sense of being on the underdog’s reaction function. • The finding by Biak and Shoegren (1992) and Leininger (1993) no longer holds.

  14. The Model • In settings where contestants can exert effort multiple times, the outcome with the underdog’s leadership can never be an equilibrium. • When the contestants are evenly matched, the unique outcome coincides with that of a one-shot Cournot-Nash play. No contestant is able to gain a strategic advantage by taking early action, even though the action is irreversible. • The observation that the flexibility of multiple actions makes the favorite more aggressive is consistent with the predictions of other racing models. In particular, Harris and Vickers (1987).

  15. An Extension • In some cases, players might have discretion over whether or not to release such information to the rival. • A period 0 is introduced in which each player simultaneously decides and commits to whether to release (R) or not release (NR) the information about his first period effort to the rival. • There are four subgames in period 0: (R,R), (R,NR), (NR,R) and (NR,NR). • Weakly dominated strategies are eliminated.

  16. An Extension • The result from this new setting, • This is significant in two respects: • It identifies cases where even without an institutional disclosure requirement, players will voluntarily supply information regarding their early actions. • It implies that although the ability to release information typically benefits the favorite, it hurts the underdog.

  17. If agents choose (R,R) continuation subgame coincides with the setting analyzed • if agents choose (NR,NR), then given Xj , the best for agent i is to choose (x1i,x2i ) such that he ends up on his reaction function. Since this is true for both agents, the unique equilibrium outcome is (XN1,XN2 ) • If (Rf,NRu), since the favorite’s first period effort is observed by both, his second period reaction function is X1=max{x11,R1(X2)} whereas the underdog has X2=R2(X1), it is best for the favorite to choose his Stackelberg leader effort in the first period and engender the outcome Sfav. • If (Ru,NRf) the continuation equilibrium is the solution to X2=max{x12,R2(X1)} and X1 = R1(X2). Unlike the favorite, the underdog is strictly below his reaction function and therefore has an incentive to increase his effort along with the favorite in the second period. Hence, the unique equilibrium outcome in this case is (XN1,XN2 ). An Extension

  18. Conclusions • The Stackelberg outcome in which the underdog leads can never be an equilibrium. • The Cournot-Nash outcome is the only equilibrium outcome in which both agents might exert effort multiple times, but all yield the same outcome. • In the Stackelberg outcome, the underdog can allocate the follower amount between the periods. • When players have the flexibility of exerting effort multiple times the favorite act more aggressively. • The favorite is more likely to win when the contest consists of multiple rounds.

  19. Future Extensions • The possibility of partial disclosure of first period efforts has not been considered. • There is no discounting. The author expects discounting to strengthen the result that the favorite leads by taking early action and the underdog follows, when multiple actions are feasible. • The author conjectures that extending the model to more than two periods would not change the outcomes. This is because all the outcomes are sustained as equilibria at which all actions are taken only in the first period.

More Related