strategy(in(contests(–an(introduc4on(faculty.haas.berkeley.edu/rjmorgan/phdba279b/contests -...

34
Strategy in Contests – An Introduc4on by Kai A. Konrad, Working Paper, January 2007* presenta4on for PHDBA 279B by Aisling ScoH and GianCarlo Moschini * Now available as a book : Kai A. Konrad, Strategy and Dynamics in Contests, Oxford University Press, 2009. 1

Upload: others

Post on 25-Jul-2020

8 views

Category:

Documents


0 download

TRANSCRIPT

Page 1: Strategy(in(Contests(–An(Introduc4on(faculty.haas.berkeley.edu/rjmorgan/phdba279b/Contests - FINAL2.pdf · Strategy(in(Contests(–An(Introduc4on(by(Kai(A.(Konrad,(Working(Paper,(January(2007*

Strategy  in  Contests  –  An  Introduc4on  by  Kai  A.  Konrad,  Working  Paper,  January  2007*    presenta4on  for  PHDBA  279B  by  Aisling  ScoH  and  GianCarlo  Moschini  

*  Now  available  as  a  book  :          Kai  A.  Konrad,  Strategy  and  Dynamics  in  Contests,  Oxford  University  Press,  2009.  

  1  

Page 2: Strategy(in(Contests(–An(Introduc4on(faculty.haas.berkeley.edu/rjmorgan/phdba279b/Contests - FINAL2.pdf · Strategy(in(Contests(–An(Introduc4on(by(Kai(A.(Konrad,(Working(Paper,(January(2007*

Introduction • What  is  a  contest?  

•  Game  where  players  have  opportunity  to  expend  resources  in  order  to  affect  probabili4es  of  winning  prizes  

• A  lot  of  theore4cal  progress  •  Less  empirical  work  and  open  ques4ons    

•  Importance:  apply  auc4on  theory  to  many  different  contexts  •  In  all  3  contests  

•  Players  exert  costly  irreversible  efforts  while  compe4ng  for  a  prize    •  A  player’s  probability  of  winning  the  prize  depends  on  the  players’  rela4ve  expenditures    

•  Each  contest  defines  the  exact  probability  differently  •  Contest  Success  Func4on  (CSF)  maps  vector  of  contestants’  expenditures  to  probability  of  winning      

2  

Page 3: Strategy(in(Contests(–An(Introduc4on(faculty.haas.berkeley.edu/rjmorgan/phdba279b/Contests - FINAL2.pdf · Strategy(in(Contests(–An(Introduc4on(by(Kai(A.(Konrad,(Working(Paper,(January(2007*

A contest

•  Strategic  game  among  n  contestants  •  A  prize  is  allocated,  contestants  value  the  prize    •  Each  player  makes  an  “effort”                          at  a  cost    •  The  vector  of  all  efforts                                                              determines  contestants’  probability  of  winning  •  Payoff  to  contestants:  •  The  “contest  success  func4on”                                                        can  take  alterna4ve  forms            

0ix ≥

1 2( , ,..., )nx x x x≡

1 2 1 2( , ,..., ) ( , ,..., ) ( )i n i n i i ix x x p x x x v C xπ = −

1 2( , ,..., )i np x x x

3  

> =0 , 1,2,...,iv i n

( )i iC x

Page 4: Strategy(in(Contests(–An(Introduc4on(faculty.haas.berkeley.edu/rjmorgan/phdba279b/Contests - FINAL2.pdf · Strategy(in(Contests(–An(Introduc4on(by(Kai(A.(Konrad,(Working(Paper,(January(2007*

3 Contests •  3  Canonical  Contests:    

•  All-­‐pay  Auc4on  •  Lobby  and  Military    

•  Tournament  •  Principal-­‐Agent,  Labor,  and  contract  design  

•  Tullock  (or  loHery)  Contest    •  R&D  races,  Poli4cal  contests,  and  Rent-­‐seeking  compe44ons    

•  Tullock  and  Tournaments  usually  have  pure  strategy  equilibria  •  Excep4ons  exist    

• All-­‐pay  usually  has  non-­‐degenerate  mixed  strategy  equilibria  • Different  cases  seek  to  maximize  or  minimize  contest  effort  expenditure  

4  

Page 5: Strategy(in(Contests(–An(Introduc4on(faculty.haas.berkeley.edu/rjmorgan/phdba279b/Contests - FINAL2.pdf · Strategy(in(Contests(–An(Introduc4on(by(Kai(A.(Konrad,(Working(Paper,(January(2007*

Examples •  Promo4onal  compe44on  (Friedman  1958)    

•  Expend  resources  on  adver4sing  in  order  to  compete      •  CSF:  share  in  total  market  •  Can  change  the  total  market  size  indica4ng  that  efforts  increase  public  good  

•  Internal  labor  markets    •  Rela4ve  performance  schemes  (Lazear  and  Rosen  1981  and  Rosen  1986)  

•  Li4ga4on  •  Legal  system  determines  rules  of  the  game,  but  each  group  allocates  effort    •  Entry  decision,  rule  of  fees,  informa4on  assymetries    

•  Beauty  Contests  •  Olympic  games  (Steward  and  Wu  1997)    

•  Rent  Seeking  and  influence  ac4vi4es      •  Bureaucrats  and  regulators  (Tullock  1967,  Kruger  1974,  and  Posner  1975)  •  Status  seeking  (Congleton  1989,  Konrad  1990  and  Konrad  1992)    

5  

Page 6: Strategy(in(Contests(–An(Introduc4on(faculty.haas.berkeley.edu/rjmorgan/phdba279b/Contests - FINAL2.pdf · Strategy(in(Contests(–An(Introduc4on(by(Kai(A.(Konrad,(Working(Paper,(January(2007*

…and Examples • Campaigning  and  commiHee  bribing  

•  Different  from  adver4sing  because  payoffs  are  discon4nuous    

•  Sports    (Hoehn  and  Szymanski  1999  and  Szymanski  2003)  •  Role  of  entry  fees,  homogeneous  par4cipants,  and  prize  number  and  structure  

•  Intra  and  Inter  group  contests    • Military  conflict  

•  Rela4onship  between  numerical  superiority  and  baHle  success  is  loose    •  Informa4onal  assyme4res  (Clark  and  Konrad  2006)  

• R&D  contests  (Fullerton  and  McAfee  1999)    •  Firms  expend  effort  to  get  monopoly  rent  from  patent  or  first  developing  product    

6  

Page 7: Strategy(in(Contests(–An(Introduc4on(faculty.haas.berkeley.edu/rjmorgan/phdba279b/Contests - FINAL2.pdf · Strategy(in(Contests(–An(Introduc4on(by(Kai(A.(Konrad,(Working(Paper,(January(2007*

First-Price All-Pay Auction (complete information)

•  Illustrate  with  special  case  of  two  players  with                                                  ,                                            and        

1

( , ) 1 2

0

i j

i i j i j

i j

if x x

p x x if x x

if x x

⎧ >⎪

= =⎨⎪ <⎩

1 2 0v v≥ > ( )i iC x x=

•  There  is  no  equilibrium  in  pure  strategies:  

•  There  is  a  mixed-­‐strategy  equilibrium  described  by  cumula4ve  distribu4on  func4ons  

                             and                            ,    on  the  support                              ,  with  the  property  that    

         

   

                                           

   

2v 1v

1 1( )F x 2 2( )F x [ ]20,v

[ ]1 1 2 1 1 1 1 2 1 2( ) ( ) , 0,x F x v x v v x vπ = − = − ∀ ∈

[ ]2 2 1 2 2 2 2 2( ) ( ) 0 , 0,x F x v x x vπ = − = ∀ ∈

0

7  

•  Recall  contestants’  payoff:   1 2 1 2( , ,..., ) ( , ,..., ) ( )i n i n i i ix x x p x x x v C xπ = −

Page 8: Strategy(in(Contests(–An(Introduc4on(faculty.haas.berkeley.edu/rjmorgan/phdba279b/Contests - FINAL2.pdf · Strategy(in(Contests(–An(Introduc4on(by(Kai(A.(Konrad,(Working(Paper,(January(2007*

… First-Price All-Pay Auction

2v

1

2

11 vv

−1 1( )F x

2 2( )F x

ix

•  Equilibrium  mixed  strategies:  

[ ]11 2

21 1

1 2

0,( )

1

x for x vvF x

for x v

⎧ ∈⎪= ⎨⎪ >⎩

[ ]2 22 2

1 12 2

2 2

1 0,( )

1

v x for x vv vF x

for x v

⎧ ⎡ ⎤− + ∈⎪ ⎢ ⎥= ⎣ ⎦⎨⎪ >⎩

•  NOTE:      ◊  Inefficiency:  highest  valua4on  contestant  does  not  always  get  the  prize  

                                   ◊  Expected  efforts  are                                    and                                                à              21 2vEx =

22

212vExv

= 1 2 2Ex Ex v+ <

•  More  than  2  contestants:                                                                                                  à    same  as  case  of  

                                                                                                                                       à    con4nuum  of  equilibria      

1 2 3 ... 0nv v v v≥ > ≥ ≥ > 2n =

1 2 1... ... 0j j nv v v v v+= = = > ≥ ≥ > 8  

Page 9: Strategy(in(Contests(–An(Introduc4on(faculty.haas.berkeley.edu/rjmorgan/phdba279b/Contests - FINAL2.pdf · Strategy(in(Contests(–An(Introduc4on(by(Kai(A.(Konrad,(Working(Paper,(January(2007*

All-Pay Auction with liquidity constraints

•  Contestants  might  be  constrained  in  their  efforts  (e.g.,  limits  on  campaign  contribu4ons)  

•  Applica4on  to  R&D  contests  with  liquidity  constraints  

     n  contestant  all  value  the  prize  equally  at    

     each  contestant’s  effort  limited  by  the  fund  availability          .    Assume    

v

w 1 2 3 ... nw w w w> > ≥ ≥

     Equilibrium  mixed  strategies:  

[ )11 2

1 1

1 2

0,( )1

x for x wF x vfor x w

⎧ ∈⎪= ⎨⎪ ≥⎩

[ )2 22 2

2 2

2 2

1 0,( )

1

w x for x wv vF x

for x w

⎧ ⎡ ⎤− + ∈⎪ ⎢ ⎥= ⎣ ⎦⎨⎪ ≥⎩

v

1

21 wv

−1 1( )F x

2 2( )F x

ix2w

2wv

9  

Page 10: Strategy(in(Contests(–An(Introduc4on(faculty.haas.berkeley.edu/rjmorgan/phdba279b/Contests - FINAL2.pdf · Strategy(in(Contests(–An(Introduc4on(by(Kai(A.(Konrad,(Working(Paper,(January(2007*

•  Contestants  know  their  own  valua4on  and  the  distribu4on                      from  which  all    valua4ons  are  drawn.    Example:  case  of                            and                                    .  

       With  bid  func4ons                                ,  the  contestant’s  payoff  is      

       FOC:      

All-Pay Auction with incomplete information

2n = [ ]0,1iv ∈

( )x vξ=

•  If                    is  the  uniform  distribu4on,    

     the  symmetric  equilibrium  is:        

( )1( ) ( )i i i i ix F x v xπ ξ −= −

( )F v

( )1

1( ) 0 ( ) 1 0i i i ii

dx F x vdxξ

π ξ−

−ʹ′ ʹ′= → − =

2

2vx =

( )F v

1

1 2

ix

iv

( )vξ

•  Note:  here  contestant  with  highest  valua4on  

       always  wins  prize  (inefficiency  noted  earlier  disappears)  

10  

Page 11: Strategy(in(Contests(–An(Introduc4on(faculty.haas.berkeley.edu/rjmorgan/phdba279b/Contests - FINAL2.pdf · Strategy(in(Contests(–An(Introduc4on(by(Kai(A.(Konrad,(Working(Paper,(January(2007*

•  Can  nest  alterna4ve  legal  fee  shining  rules  in  the  Contest  framework.  Example:  

 

•  American  system:                                    and                                          (standard  contest)  

•  Bri4sh  rule  (loser  pays  all  costs):                                        and    

All-Pay Auction and models of litigation

if wins

if wins( , , ) i i ji i j i

i j

v bx dx ix x v

ax tx jπ

− −⎧⎪= ⎨

− −⎪⎩

1a b= = 0d t= =

1a t= = 0b d= =

•  In  an  all-­‐pay  auc4on  with  incomplete  informa4on,  the  expected  total  effort  by    

     contestants  is  higher  under  the  Bri4sh  system  than  the  American  system  

       -­‐-­‐  see  prof.  Morgan’s  lecture  notes  on  Auc4ons  

   11  

Page 12: Strategy(in(Contests(–An(Introduc4on(faculty.haas.berkeley.edu/rjmorgan/phdba279b/Contests - FINAL2.pdf · Strategy(in(Contests(–An(Introduc4on(by(Kai(A.(Konrad,(Working(Paper,(January(2007*

All-Pay Auction with additive noise (tournament)

•  Includes  a  random  element  (addi4ve  noise)  to  the  contest  success  func4on          Effort  produces  a  “performance”                                          ;  success  func4on  (for  n=2)  is       1

( , ) 1 2

0

i i j j

i i j i i j j

i i j j

if x x

p x x if x x

if x x

ε ε

ε ε

ε ε

⎧ + > +⎪

= + = +⎨⎪ + < +⎩

ε= +i i iy x

•  Define                                            and  assume  it  has  distribu4on                        on                

       Suppose  both  contenders  value  winning  equally  (                          )  and  loser  gets    

       payoff  to  contestants:    

         

       op4mality:                                                                                                                        where      

         

2 1ε ε ε≡ − ( )G ε [ ],e e−

i Wv b= Lb

( , ) 1 ( , ) ( )i i i j W i i j L ip x x b p x x b C xπ ⎡ ⎤= + − −⎣ ⎦

( )( , )

( )i i jW L i

i

p x xb b C x

x∂

ʹ′− =∂

( , ) ( )i i j i j

i i

p x x G x xx x

∂ ∂ −=

∂ ∂

12  

Page 13: Strategy(in(Contests(–An(Introduc4on(faculty.haas.berkeley.edu/rjmorgan/phdba279b/Contests - FINAL2.pdf · Strategy(in(Contests(–An(Introduc4on(by(Kai(A.(Konrad,(Working(Paper,(January(2007*

… tournament

•  In  a  symmetric  NE  both  contestant  spend  same  effort  and  win  with  prob  

       the  equilibrium  solves          

       -­‐-­‐  note:  increased  dispersion  of  noise  or  reduc4on  in  win  reward  reduce  effort  

         

1 2

( ) *(0) ( )W LG b b C xʹ′ ʹ′× − =

13  

•  Contest  design  problem:  choose                and                to  max  obj  func4on,  e.g.,    

•  Par4cipa4on  constraint  at  symmetric  NE  requires    

•  Hence  designer  problem  is  to  max  

•  Can  implement  the  efficient  solu4on  sa4sfying      

         

Wb Lb ( )2 W Lx b bϕ − −

*1 1 ( )2 2W Lb b C x+ ≥

( )2 2 ( )x C xϕ −

( )* *2 ( )x C xϕʹ′ ʹ′=

•  Note  role  of  randomness  in  all  the  serngs  considered  so  far  

Page 14: Strategy(in(Contests(–An(Introduc4on(faculty.haas.berkeley.edu/rjmorgan/phdba279b/Contests - FINAL2.pdf · Strategy(in(Contests(–An(Introduc4on(by(Kai(A.(Konrad,(Working(Paper,(January(2007*

Standard Tullock

•  Contest  success  func4on:            •  If  r=1  loHery  contest  •  If  r>0,  allows  for  general  types  of  contests  •  As                                      the  above  func4on  converges  to  contest  success  func4on  converges  to  no  noise  tournament  

•  Imperfectly  discrimina4ng  

!"#$%&'(' )&*&!(' )&+,&)&!-. /&,,#0% +0' 1+)'*+0 234546 +0'7 &0 8+9!&:;)+97

<+=(+9 2344>6 +)%# %;9?(- @;9!A(9 0(B+!&?( +%8(:!% #@ !#;90+*(0!%7 A&BA$

)&BA!&0B &0 8+9!&:;)+9 !A( 89#,)(* #@ %+,#!+B(7 #9 !A( '&%&0:(0!&?(% !# 89#?&'(

A()8 !# :#$"#9C(9% &@ !A(- +9( 9&?+)% &0 + !#;90+*(0!7 +0' A#" %;:A 89#,)(*%

:#;)' &0 !A(#9- ,( 9(';:(' ,- +0 +889#89&+!( '(%&B0 #@ !A( !#;90+*(0!7 +0'

:#0%&'(9 %#*( (*8&9&:+) +88)&:+!&#0%.

D#!( !A+! !A( !#;90+*(0! !;90% &0!# !A( +))$8+- +;:!&#0 &@ !A( ! ,(:#*(%'(B(0(9+!(. E(0:(7 !A( +))$8+- +;:!&#0 "&!A#;! 0#&%( &0 !A( 89(?&#;% %(:$

!&#0 :+0 ,( %((0 +% !A( )&*&!&0B :+%( #@ !A( !#;90+*(0!. FA&% :#0?(9B(0:(7

A#"(?(97 &% 0#! + %*##!A 89#:(%%. G@ !A( '&%8(9%&#0 #@ ! ,(:#*(% %*+))(9+0' %*+))(97 + 8;9( %!9+!(B- (H;&)&,9&;* '&%+88(+9% +! %#*( 8#&0!. I&J('

%!9+!(B- (H;&)&,9&+ !A+! :+0 (*(9B( &0 !A&% :+%( +9( '(%:9&,(' @#9 %#*( :+%(%

&0 KA( +0' /+)( 2LMMM6.

!"# $%& $'(()*+ *),-&.-

N(9A+8% !A( *#%! 8#8;)+9 :#0!(%! %;::(%% @;0:!&#0 !A+! A+% ,((0 %;BB(%!('

+0' ;%(' &0 %(?(9+) +9(+% #@ (:#0#*&:% +%%;*(% !A+! + :#0!(%!+0! "O% 89#,+$,&)&!- #@ "&00&0B !A( :#0!(%! (H;+)% !A( 9+!&# ,(!"((0 !A&% :#0!(%!+0!O% #"0

(P#9! +0' !A( %;* #@ (P#9!%7 #9 + ?+9&+0! #@ !A&%. Q#*( (J+*8)(% +0' (+9)-

9(@(9(0:(% &0 !A( :#0!(J! #@ 89#*#!&#0+) :#*8(!&!&#0 +0' &0 *&)&!+9- +88)&$

:+!&#0% A+?( ,((0 '&%:;%%(' &0 KA+8!(9 3.

$%& .-/,0/10 $'(()*+ *),-&.- 1A&)( F;))#:C 2345M6 "+% 0#! !A( R9%! !#

+0+)-%( :#0!(%!% "&!A !A&% 8+9!&:;)+9 %!9;:!;9( &0 (:#0#*&: +88)&:+!&#0%7 !A(

@#))#"&0B :#0!(%! %;::(%% @;0:!&#0 &% !-8&:+))- +!!9&,;!(' !# A&* +% A( "+% !A(

R9%! !# ;%( &! !# %!;'- !A( 89#,)(* #@ 9&?+) 9(0!$%((C(9% "A# (J8(0' 9(%#;9:(%

!# &0S;(0:( !A( 8#)&:- #;!:#*( &0 !A(&9 @+?#9.

#!!$!% &&&$"" #

!#!"!#$!" #

!$&@ $%&!$!% &&&$"" ' '

(() #!A(9"&%(.2T46

U#9 * # (7 !A&% @;0:!&#0 A+% +)%# ,((0 :+))(' !A( V)#!!(9- :#0!(%!OW !A( "&089#,+,&)&!- (H;+)% !A( %A+9( #@ (J8(0'&!;9( #@ + :#0!(%!+0! &0 !A( !#!+) (J$

8(0'&!;9(7 )&C( &0 + )#!!(9- &0 "A&:A #0( *#0(!+9- ;0&! ,;-% #0( )#!!(9-

!&:C(!7 +0' &0 "A&:A !A( "&00(9 &% '9+"0 @9#* !A( %(! #@ +)) !&:C(!% "&!A (+:A

!&:C(! "&00&0B "&!A !A( %+*( 89#,+,&)&!-. E#"(?(97 !A( 8+9+*(!(9 * ' '&0 !A( @;0:!&#0 2T46 +))#"% @#9 %)&BA!)- *#9( B(0(9+) !-8(% #@ :#0!(%!%. FA&%

8+9+*(!(9 "&)) ,( &*8#9!+0! @#9 !A( *+9B&0+) &*8+:! #@ +0 &0:9(+%( &0 +

:#0!(%!+0!O% (P#9!.

T>

!"# $%&'()*& +,-. '*&/#01#2 (*34052 ("# '*&(#2( 2%''#22 $%&'()*& 3)(" &*&*)2# 42 ! !"6 7*(# ("4( "! )2 4 80*949):)(; $*0 4:: $#42)9:# '*<9)&4()*&2 *$#=*0(> 4&5 ("4( ("# 80*949):)(; $*0 # (* 3)& ("# '*&(#2( )2 )&'0#42)&1 )& #?2 *3&#=*0( 4&5 5#'0#42)&1 )& *("#0 '*&(#2(4&(2? #=*0(6 !*1#("#0 3)(" $%&'()*&2

$!!%!" # %! +@A.

5#2'0)9)&1 )&5)/)5%4:2? '*2( *$ 80*/)5)&1 #=*0(2 %!> (")2 5#2'0)9#2 ("# B!%::*'C'*&(#2(D6EF

!")2 '*&(#2( 4&5 )(2 /40)4&(2 "4/# 9##& 2(%5)#5 #G(0#<#:; '40#$%::;6 !"#'*&(#2( 2%''#22 $%&'()*& +,-. "42 9##& %2#5 )& ("# :)(#04(%0# 5#2'0)9)&1 0#&(2##C)&1 +2## 7)(H4&> E--@> $*0 4& #40:; 2%0/#; 4&5 I*'C405 4&5 !%::*'C> JAAE>$*0 4 <*0# 0#'#&( '*::#'()*& *$ 848#02.6 K0)#5<4& +E-FL. %2#5 (")2 $%&'()*&$*0 5#2'0)9)&1 ("# 0#:4()*&2")8 9#(3##& ("# 8#02%42)/# 45/#0()2)&1 *$ ("# 5)$M$#0#&( N0<2? 4&5 ("#)0 0#28#'()/# 2"40#2 )& ("# <40C#(26 O# '*&2)5#02 ("#45/#0()2)&1 14<# 9#(3##& (3* N0<2 3")'" '*<8#(# )& 2#/#04: 80*5%'(2 *080*5%'( '4(#1*0)#26 K)0<2 "4/# 1)/#& 1:*94: 45/#0()2)&1 9%51#(2 4&5 <%2(5#')5# "*3 (* 4::*'4(# ("#)0 9%51#( (* 45/#0()2)&1 #G8#&5)(%0# $*0 ("#2# 5)=#0M#&( 80*5%'(26 !"# 14<# "42 9##& '4::#5 BP*:*&#: Q:*((* 14<#D 4&5 5)=#0#&(/40)4&(2 *$ (")2 14<# "4/# 9##& 2(%5)#5 )& ("# :)(#04(%0# +2## 2#'()*& E6,.6Q#::> R##&#; 4&5 I)((:# +E-SF. 4G)*<4()H#5 (")2 $%&'()*&> 4:2* )& ("# '*&(#G(*$ 45/#0()2)&1> T'"<4:#&2## +E-SU. '*&2)5#02 <*0# 1#&#04: $%&'()*&2 5#2'0)9M)&1 ("# 0#:4()*&2")8 9#(3##& 45/#0()2)&1 #G8#&5)(%0# 4&5 <40C#( 2"40#2 4&5)&(0*5%'#2 4&5 5)2'%22#2 4 &%<9#0 *$ 8:4%2)9:# 80*8#0()#2 *$ 2%'" $%&'()*&2>9%( '*&2)5#02 +,-. 3)(" ! # $ 42 4 28#')4: '42# +86 @-F.6 V <*0# 0#'#&(488:)'4()*& )& ("# '*&(#G( *$ 80*<*()*&4: '*<8#()()*& )2 Q400*2 4&5 TW01405+JAAA.6 X& 28*0(2> ("# *%('*<# *$ 28*0(2 (*%0&4<#&(2 "42 9##& 5#2'0)9#59; +,-. 9; O*#"& 4&5 TH;<4&2C) +E---. 4&5 TH;<4&2C) +JAA,.6 !"# $%&'M()*& "42 4:2* 9##& %2#5 $*0 5#2'0)9)&1 YZ[ '*&(#2(2 +K%::#0(*& 4&5 \'V$##E---. 4&5 "42 #<#01#5 )& ("# :)(#04(%0# *& 2(4(%2 2##C)&1 +P*&1:#(*& E-L->R*&045 E--A 4&5 R*&045 E--J. )& 4 2(0%'(%04::; 0#:4(#5 '*&(#G( (* 5#2'0)9#80#$#0#&'#2 $*0 0#:4()/# 2(4&5)&1 '*<840)2*&26!"# '42# 3)(" ! # $ "42 9##& 840()'%:40:; 8*8%:40 9#'4%2# *$ )(2 4&4:;()'4:

(04'(49):)(;6 Q; 455)&1 2*<# '*&2(4&(2 )& ("# &%<#04(*0 *0 ("# 5#&*<)&4(*0*0 9; 4::*3)&1 $*0 4 5)=#0#&( '*2( *$ <4C)&1 '*&(0)9%()*&2 %"> ("# '*&(#2(4&(2'4& 9# <45# 42;<<#(0)'> 4&5 "4&5)'482 $*0 *&# *0 ("# *("#0 '*&(#2(4&( '4&9# 4&4:;2#56

EFV2 5)2'%22#5 )& \)'"4#:2 +E-LL.> ("# #=#'()/# #=*0( !! 9; '*&(#2(4&( " '4& 4:2* 9#4 $%&'()*& *$ 4 &%<9#0 *$ )&8%(2 3")'" 1#&#04(# (")2 #=#'()/# #=*0(6 X& (")2 '42#> ("#'*&(#2(4&( 3):: (;8)'4::; '"**2# 4 '*2( #]')#&( <)G *$ ("# 5)=#0#&( #=*0( )&8%(26

,U

!"# $%&'()*& +,-. '*&/#01#2 (*34052 ("# '*&(#2( 2%''#22 $%&'()*& 3)(" &*&*)2# 42 ! !"6 7*(# ("4( "! )2 4 80*949):)(; $*0 4:: $#42)9:# '*<9)&4()*&2 *$#=*0(> 4&5 ("4( ("# 80*949):)(; $*0 # (* 3)& ("# '*&(#2( )2 )&'0#42)&1 )& #?2 *3&#=*0( 4&5 5#'0#42)&1 )& *("#0 '*&(#2(4&(2? #=*0(6 !*1#("#0 3)(" $%&'()*&2

$!!%!" # %! +@A.

5#2'0)9)&1 )&5)/)5%4:2? '*2( *$ 80*/)5)&1 #=*0(2 %!> (")2 5#2'0)9#2 ("# B!%::*'C'*&(#2(D6EF

!")2 '*&(#2( 4&5 )(2 /40)4&(2 "4/# 9##& 2(%5)#5 #G(0#<#:; '40#$%::;6 !"#'*&(#2( 2%''#22 $%&'()*& +,-. "42 9##& %2#5 )& ("# :)(#04(%0# 5#2'0)9)&1 0#&(2##C)&1 +2## 7)(H4&> E--@> $*0 4& #40:; 2%0/#; 4&5 I*'C405 4&5 !%::*'C> JAAE>$*0 4 <*0# 0#'#&( '*::#'()*& *$ 848#02.6 K0)#5<4& +E-FL. %2#5 (")2 $%&'()*&$*0 5#2'0)9)&1 ("# 0#:4()*&2")8 9#(3##& ("# 8#02%42)/# 45/#0()2)&1 *$ ("# 5)$M$#0#&( N0<2? 4&5 ("#)0 0#28#'()/# 2"40#2 )& ("# <40C#(26 O# '*&2)5#02 ("#45/#0()2)&1 14<# 9#(3##& (3* N0<2 3")'" '*<8#(# )& 2#/#04: 80*5%'(2 *080*5%'( '4(#1*0)#26 K)0<2 "4/# 1)/#& 1:*94: 45/#0()2)&1 9%51#(2 4&5 <%2(5#')5# "*3 (* 4::*'4(# ("#)0 9%51#( (* 45/#0()2)&1 #G8#&5)(%0# $*0 ("#2# 5)=#0M#&( 80*5%'(26 !"# 14<# "42 9##& '4::#5 BP*:*&#: Q:*((* 14<#D 4&5 5)=#0#&(/40)4&(2 *$ (")2 14<# "4/# 9##& 2(%5)#5 )& ("# :)(#04(%0# +2## 2#'()*& E6,.6Q#::> R##&#; 4&5 I)((:# +E-SF. 4G)*<4()H#5 (")2 $%&'()*&> 4:2* )& ("# '*&(#G(*$ 45/#0()2)&1> T'"<4:#&2## +E-SU. '*&2)5#02 <*0# 1#&#04: $%&'()*&2 5#2'0)9M)&1 ("# 0#:4()*&2")8 9#(3##& 45/#0()2)&1 #G8#&5)(%0# 4&5 <40C#( 2"40#2 4&5)&(0*5%'#2 4&5 5)2'%22#2 4 &%<9#0 *$ 8:4%2)9:# 80*8#0()#2 *$ 2%'" $%&'()*&2>9%( '*&2)5#02 +,-. 3)(" ! # $ 42 4 28#')4: '42# +86 @-F.6 V <*0# 0#'#&(488:)'4()*& )& ("# '*&(#G( *$ 80*<*()*&4: '*<8#()()*& )2 Q400*2 4&5 TW01405+JAAA.6 X& 28*0(2> ("# *%('*<# *$ 28*0(2 (*%0&4<#&(2 "42 9##& 5#2'0)9#59; +,-. 9; O*#"& 4&5 TH;<4&2C) +E---. 4&5 TH;<4&2C) +JAA,.6 !"# $%&'M()*& "42 4:2* 9##& %2#5 $*0 5#2'0)9)&1 YZ[ '*&(#2(2 +K%::#0(*& 4&5 \'V$##E---. 4&5 "42 #<#01#5 )& ("# :)(#04(%0# *& 2(4(%2 2##C)&1 +P*&1:#(*& E-L->R*&045 E--A 4&5 R*&045 E--J. )& 4 2(0%'(%04::; 0#:4(#5 '*&(#G( (* 5#2'0)9#80#$#0#&'#2 $*0 0#:4()/# 2(4&5)&1 '*<840)2*&26!"# '42# 3)(" ! # $ "42 9##& 840()'%:40:; 8*8%:40 9#'4%2# *$ )(2 4&4:;()'4:

(04'(49):)(;6 Q; 455)&1 2*<# '*&2(4&(2 )& ("# &%<#04(*0 *0 ("# 5#&*<)&4(*0*0 9; 4::*3)&1 $*0 4 5)=#0#&( '*2( *$ <4C)&1 '*&(0)9%()*&2 %"> ("# '*&(#2(4&(2'4& 9# <45# 42;<<#(0)'> 4&5 "4&5)'482 $*0 *&# *0 ("# *("#0 '*&(#2(4&( '4&9# 4&4:;2#56

EFV2 5)2'%22#5 )& \)'"4#:2 +E-LL.> ("# #=#'()/# #=*0( !! 9; '*&(#2(4&( " '4& 4:2* 9#4 $%&'()*& *$ 4 &%<9#0 *$ )&8%(2 3")'" 1#&#04(# (")2 #=#'()/# #=*0(6 X& (")2 '42#> ("#'*&(#2(4&( 3):: (;8)'4::; '"**2# 4 '*2( #]')#&( <)G *$ ("# 5)=#0#&( #=*0( )&8%(26

,U

14  

Page 15: Strategy(in(Contests(–An(Introduc4on(faculty.haas.berkeley.edu/rjmorgan/phdba279b/Contests - FINAL2.pdf · Strategy(in(Contests(–An(Introduc4on(by(Kai(A.(Konrad,(Working(Paper,(January(2007*

Existence and Uniqueness

•  In  a  symmetric  contest  with  n  contestants  there  exists  a  pure  strategy  Nash  Equilibrium  if    

•  Otherwise  a  mixed  strategy  Nash  Equilibrium  exists    •  It  is  possible  for  total  effort  to  exceed  the  valua4on  of  the  prize  •  Expected  total  effort  cannot  exceed  the  value  of  the  prize    

   

!"#$%&'(&) *'#+,&'&$$ -'. /012-3-%#4& 5%-%#($ !"#$%&'(& )'* +'#,+&-'&$$ ./ %0& 1)$0 &,+#2#34#+5 #' %0& 6+22.(7 (.'%&$% /.22.8$ /4.5 %0& )')29$#$#' :;#*)4.<$;79 )'* =7+>+(0# ?@AABC #/ !!" #$ (.'()<& #' "D #E&ED #/ " ! !E 60&9F4.<& %0#$ F4.F&4%9 /.4 )' )43#%4)49 G'#%& '+53&4 ./ (.'%&$%)'%$ )'* /.4 )5.4& >&'&4)2 (2)$$ ./ (.'%&$% $+((&$$ /+'(%#.'$E@H

I.4 %0& 6+22.(7 (.'%&$%D %0& $(.F& /.4 &"#$%&'(& )'* +'#,+&'&$$ ./ ) 1)$0&,+#2#34#+5 ()' 3& &"%&'*&*E J' %0& $955&%4#( (.'%&$% 8#%0 # (.'%&$%)'%$D" ! #

#!! #$ %0& (.'*#%#.' %0)% 5)7&$ %0& $&(.'*-.4*&4 (.'*#%#.' /+2G22&*E J/%0#$ (.'*#%#.' #$ <#.2)%&*D ) F+4& $%4)%&>9 1)$0 &,+#2#34#+5 8#22 %9F#()229 '.%&"#$%E 60#$ /)(% 0)$ ()+$&* (.'$#*&4)32& (.'/+$#.' /.4 ,+#%& $.5& %#5& )'* 0)$4)#$&* %0& ,+&$%#.' ./ 80&%0&4 (.'%&$%)'%$ 5)9D .' )>>4&>)%&D &"F&'* 5.4& &/-/.4% %0)' %0& <)2+& ./ %0& F4#;& %0&9 ()' 8#' ?6+22.(7 @AKLCE M)9&D N.<&'.(7)'* *&O4#&$ ?@AAPD @AAAC 0)<& $0.8' %0)% %0& &,+#2#34#+5 $.2+%#.'$ %0)%&5&4>& #/ %0& (.'%&$%)'%$Q .3R&(%#<& /+'(%#.'$ )4& '.% (.'()<& ()''.% 0)<&0#>0&4 &"F&(%&* )>>4&>)%& (.'%&$% &S.4%$ #' )' &,+#2#34#+5 %0)' %0& <)2+& ./%0& F4#;& )'* 0)<& $0.8' %0& &"#$%&'(& ./ )' &,+#2#34#+5E 60&9 0)<& )2$.(0)4)(%&4#;&* %0& &,+#2#34#+5 80#(0 #$ #' 5#"&* $%4)%&>#&$ #/ %0&4& #$ ) G'#%&$&% ./ F.$$#32& &S.4% (0.#(&$E !<&' %0.+>0 %0& &,+#2#34#+5 5#"&* $%4)%&>#&$)4& *#S&4&'%D %0& 4&$+2%$ 4&>)4*#'> *#$$#F)%#.' 4&$&532& ,+)2#%)%#<&29 %0& )22-F)9 )+(%#.' 8#%0 (.5F2&%& #'/.45)%#.'E T#<&' %0)% %0& (.'%&$%)'%$ (0..$&5#"&* $%4)%&>#&$D %0& %.%)2 &S.4% ()'D #' $.5& #'$%)'(&$D &"(&&* %0& <)2+)%#.'./ %0& F4#;&D 3+% %0& &"F&(%&* %.%)2 &S.4% #' %0& &,+#2#34#+5 ()''.% &"(&&*%0& <)2+& ./ %0& F4#;&E U$ 2.'> )$ (.'%&$%)'%$ ()''.% 3& /.4(&* %. &"F&'*F.$#%#<& &S.4% .4 %. F)4%#(#F)%& #' %0& (.'%&$%D %0&9 ()' )28)9$ )3$%)#' /4.5&"F&'*#'> &S.4%D )'* $.5& (.'%&$%)'%$ 8.+2* F4&/&4 %. )3$%)#' /4.5 &"F&'*-#'> &S.4% #/ F)4%#(#F)%#.' #5F2#&* )' &"F&(%&* &S.4% %0)% 8.+2* &"(&&* %0&#4&"F&(%&* 4&8)4* #/ %0&9 %)7& F)4% #' %0& (.'%&$%EU (0)4)(%&4#;)%#.' )'* %0& (.5F)4)%#<& $%)%#( F4.F&4%#&$ ./ %0& (.'%&$%

&,+#2#34#+5 ()' 3& .3%)#'&* /4.5 %0& G4$%-.4*&4 (.'*#%#.'$D 80&4& %0&9 (0)4-)(%&4#;& %0& &,+#2#34#+5 ?$&&D &E>ED 1%# @AAACE@B I.4 %0& $#5F2& ()$& 8#%0 .'29%8. (.'%&$%)'%$D %0& G4$%-.4*&4 (.'*#%#.'$ /.4 %0& 5)"#5#;)%#.' F4.32&5 8#%0)' .3R&(%#<& /+'(%#.' ?VC ./ ) (.'%&$%)'% 8#%0 (.'%&$% $+((&$$ /+'(%#.' ?WAC

@HI.4 ) *#$(+$$#.' ./ $%)32#%9 F4.F.4%#&$ ./ %0& &,+#2#34#+5 $&& X+ )'* :;#*)4.<$;79?@[email protected] )' &)429 $.2+%#.' ./ ) $%4+(%+4)229 &,+#<)2&'% F4.32&5 #' %0& (.'%&"% ./ F4.5.%#.')2

(.5F&%#%#.' $&& Y#22$ ?@AH@D FEVAWCE Y#22$ $.2<&$ ) $2#>0%29 5.4& >&'&4)2 F4.32&5 80#(0D#5F.$#'> $955&%49 4&$%4#(%#.'$ .' $.5& F)4)5&%&4$D 4&*+(&$ %. %0& 6+22.(7 F4.32&5E I.4(.5F)4)%#<& $%)%#($ .' 5.4& >&'&4)2 (.'%&$% $+((&$$ /+'(%#.'$ %0)% )4& 3)$&* .' ) 4)%#.!!"!"#

!!!""" $&& 1%# ?@AABCE

WB

15  

Page 16: Strategy(in(Contests(–An(Introduc4on(faculty.haas.berkeley.edu/rjmorgan/phdba279b/Contests - FINAL2.pdf · Strategy(in(Contests(–An(Introduc4on(by(Kai(A.(Konrad,(Working(Paper,(January(2007*

Two Players

•  FOCs  

•  Solve  for  the  symmetric  case:  

x

x (x )

x (x )

x

1

1

1

2

2

2

10.50

0.5

1

2

!"#$%& '( )&*+,"-. /$.+,"-.0 /-% !! ! "1 !" ! # *.2 " ! #3

*.2 * +-0,4-/4&5-%, /$.+,"-. 6789 *%&

"#!!!! #!"$#!! % #

!"&"!! ! # *.2

"#!!!" #!!$#!! % #

!"&"!" ! # $ 67:9

;<& %&*+,"-. /$.+,"-.0 ,<*, %&0$=, /%-> 0-=?".# ,<&0& @%0,4-%2&% +-.2","-.0*%& 2&A"+,&2 /-% ,<& +*0& !! ! "% !" ! # *.2 " ! # ". !"#$%& '3:'

;<& ".,&%0&+,"-.0 2&,&%>".& ,<& B*0< &C$"="D%"$> "/ ,<& @%0,4-%2&% +-.2"4,"-.0 2&,&%>".& ,<& &C$"="D%"$>3 ;<& &C$"="D%"$> ?*=$&0 *%&

#"! ! "!!"!

!#!!

$!!! % !!"&"*.2 #"" ! "

!!#!" !!!$!!! % !

!"&"

67E9

&"! !!!!

!!! % !!"

*.2 &"" !!!"

!!! % !!"

67F9

'"! !!!#!! $!!! % !

!"$#! "&&

$!!! % !!"&"

*.2 '"" !!!#!" $!!" % !

!!$#! "&&

$!!! % !!"&"

3 6779

B-,& ,<*, ,<& +-.,&0,*., G",< ,<& <"#<&% ?*=$*,"-. -/ ,<& A%"H& &IA&.20>-%& &5-%, *.2 G".0 G",< * <"#<&% A%-D*D"=",J1 D$, .-, G",< A%-D*D"=",J

:'K&& LM%&H4N*0,%"==- *.2 O&%2"&% 6:PPE9 /-% >-%& #&.&%*= +*0&03

F'

Contests

Aisling Scott

Feb 2014

Standard Tullock

Solution for symetric:

xi = xj∀xi, xjNote: Vi = v ∀i and x1 = x2 = x∗ by symmetry

Thusr(x∗)(2r−1)

4(x∗)(2r)v = 1

x∗ = rv4 When does rent disaptaion exist? When 2x∗ = 2 rv

4

r = 2 all rent is disapated for symetric case

Let r = 1 so the best reaction functions are BR1 = x1 =√x2v − x2 and BR2 = x2 =

√x1v − x1

1

Contests

Aisling Scott

Feb 2014

Standard Tullock

Solution for symetric:

xi = xj∀xi, xjNote: Vi = v ∀i and x1 = x2 = x∗ by symmetry

Thusr(x∗)(2r−1)

4(x∗)(2r)v = 1

x∗ = rv4 When does rent disaptaion exist? When 2x∗ = 2 rv

4

r = 2 all rent is disapated for symetric case

Let r = 1 so the best reaction functions are BR1 = x1 =√x2v − x2 and BR2 = x2 =

√x1v − x1

1

Contests

Aisling Scott

Feb 2014

Standard Tullock

Solution for symetric:

xi = xj∀xi, xjNote: Vi = v ∀i and x1 = x2 = x∗ by symmetry

Thusr(x∗)(2r−1)

4(x∗)(2r)v = 1

x∗ = rv4 When does rent disaptaion exist? When 2x∗ = 2 rv

4

r = 2 all rent is disapated for symetric case

Let r = 1 so the best reaction functions are BR1 = x1 =√x2v − x2 and BR2 = x2 =

√x1v − x1

1

16  

Page 17: Strategy(in(Contests(–An(Introduc4on(faculty.haas.berkeley.edu/rjmorgan/phdba279b/Contests - FINAL2.pdf · Strategy(in(Contests(–An(Introduc4on(by(Kai(A.(Konrad,(Working(Paper,(January(2007*

Two Players Tullock Example

Contests

Aisling Scott

Feb 2014

Standard Tullock

Solution for symetric:

xi = xj∀xi, xjNote: Vi = v ∀i and x1 = x2 = x∗ by symmetry

Thusr(x∗)(2r−1)

4(x∗)(2r)v = 1

x∗ = rv4

When does rent dissaptaion exist?

Since 2x∗ = 2 rv4

2v = 2x∗

r = 2

Thus when r = 2 all rent is dissapated.

Let r = 1 so the best reaction functions are:

BR1 = x1 =√x2v − x2

BR2 = x2 =√x1v − x1

1

Contests

Aisling Scott

Feb 2014

Standard Tullock

Solution for symetric:

xi = xj∀xi, xjNote: Vi = v ∀i and x1 = x2 = x∗ by symmetry

Thusr(x∗)(2r−1)

4(x∗)(2r)v = 1

x∗ = rv4

When does rent dissaptaion exist?

Since 2x∗ = 2 rv4

2v = 2x∗

r = 2

Thus when r = 2 all rent is dissapated.

Let r = 1 so the best reaction functions are:

BR1 = x1 =√x2v − x2

BR2 = x2 =√x1v − x1

1

Contests

Aisling Scott

Feb 2014

Standard Tullock

Solution for symetric:

xi = xj∀xi, xjNote: Vi = v ∀i and x1 = x2 = x∗ by symmetry

Thusr(x∗)(2r−1)

4(x∗)(2r)v = 1

x∗ = rv4

When does rent dissaptaion exist?

Since 2x∗ = 2 rv4

2v = 2x∗

r = 2

Thus when r = 2 all rent is dissapated.

Let r = 1 so the best reaction functions are:

BR1 = x1 =√x2v − x2

BR2 = x2 =√x1v − x1

1

Contests

Aisling Scott

Feb 2014

Standard Tullock

Solution for symetric:

xi = xj∀xi, xjNote: Vi = v ∀i and x1 = x2 = x∗ by symmetry

Thusr(x∗)(2r−1)

4(x∗)(2r)v = 1

x∗ = rv4

When does rent dissaptaion exist?

Since 2x∗ = 2 rv4

2v = 2x∗

r = 2

Thus when r = 2 all rent is dissapated.

Let r = 1 so the best reaction functions are:

BR1 = x1 =√x2v − x2

BR2 = x2 =√x1v − x1

1

17  

Page 18: Strategy(in(Contests(–An(Introduc4on(faculty.haas.berkeley.edu/rjmorgan/phdba279b/Contests - FINAL2.pdf · Strategy(in(Contests(–An(Introduc4on(by(Kai(A.(Konrad,(Working(Paper,(January(2007*

Best Reaction Functions

x

x (x )

x (x )

x

1

1

1

2

2

2

10.50

0.5

1

2

!"#$%& '( )&*+,"-. /$.+,"-.0 /-% !! ! "1 !" ! # *.2 " ! #3

*.2 * +-0,4-/4&5-%, /$.+,"-. 6789 *%&

"#!!!! #!"$#!! % #

!"&"!! ! # *.2

"#!!!" #!!$#!! % #

!"&"!" ! # $ 67:9

;<& %&*+,"-. /$.+,"-.0 ,<*, %&0$=, /%-> 0-=?".# ,<&0& @%0,4-%2&% +-.2","-.0*%& 2&A"+,&2 /-% ,<& +*0& !! ! "% !" ! # *.2 " ! # ". !"#$%& '3:'

;<& ".,&%0&+,"-.0 2&,&%>".& ,<& B*0< &C$"="D%"$> "/ ,<& @%0,4-%2&% +-.2"4,"-.0 2&,&%>".& ,<& &C$"="D%"$>3 ;<& &C$"="D%"$> ?*=$&0 *%&

#"! ! "!!"!

!#!!

$!!! % !!"&"*.2 #"" ! "

!!#!" !!!$!!! % !

!"&"

67E9

&"! !!!!

!!! % !!"

*.2 &"" !!!"

!!! % !!"

67F9

'"! !!!#!! $!!! % !

!"$#! "&&

$!!! % !!"&"

*.2 '"" !!!#!" $!!" % !

!!$#! "&&

$!!! % !!"&"

3 6779

B-,& ,<*, ,<& +-.,&0,*., G",< ,<& <"#<&% ?*=$*,"-. -/ ,<& A%"H& &IA&.20>-%& &5-%, *.2 G".0 G",< * <"#<&% A%-D*D"=",J1 D$, .-, G",< A%-D*D"=",J

:'K&& LM%&H4N*0,%"==- *.2 O&%2"&% 6:PPE9 /-% >-%& #&.&%*= +*0&03

F'

Contests

Aisling Scott

Feb 2014

Standard Tullock

Solution for symetric:

xi = xj∀xi, xjNote: Vi = v ∀i and x1 = x2 = x∗ by symmetry

Thusr(x∗)(2r−1)

4(x∗)(2r)v = 1

x∗ = rv4

When does rent dissaptaion exist?

Since 2x∗ = 2 rv4

2v = 2x∗

r = 2

Thus when r = 2 all rent is dissapated.

Let r = 1 so the best reaction functions are:

BR1 = x1 =√x2v − x2

BR2 = x2 =√x1v − x1

Note v1 = 2, v2 = 1, r = 1

1

18  

Page 19: Strategy(in(Contests(–An(Introduc4on(faculty.haas.berkeley.edu/rjmorgan/phdba279b/Contests - FINAL2.pdf · Strategy(in(Contests(–An(Introduc4on(by(Kai(A.(Konrad,(Working(Paper,(January(2007*

Nash Equilibrium

x

x (x )

x (x )

x

1

1

1

2

2

2

10.50

0.5

1

2

!"#$%& '( )&*+,"-. /$.+,"-.0 /-% !! ! "1 !" ! # *.2 " ! #3

*.2 * +-0,4-/4&5-%, /$.+,"-. 6789 *%&

"#!!!! #!"$#!! % #

!"&"!! ! # *.2

"#!!!" #!!$#!! % #

!"&"!" ! # $ 67:9

;<& %&*+,"-. /$.+,"-.0 ,<*, %&0$=, /%-> 0-=?".# ,<&0& @%0,4-%2&% +-.2","-.0*%& 2&A"+,&2 /-% ,<& +*0& !! ! "% !" ! # *.2 " ! # ". !"#$%& '3:'

;<& ".,&%0&+,"-.0 2&,&%>".& ,<& B*0< &C$"="D%"$> "/ ,<& @%0,4-%2&% +-.2"4,"-.0 2&,&%>".& ,<& &C$"="D%"$>3 ;<& &C$"="D%"$> ?*=$&0 *%&

#"! ! "!!"!

!#!!

$!!! % !!"&"*.2 #"" ! "

!!#!" !!!$!!! % !

!"&"

67E9

&"! !!!!

!!! % !!"

*.2 &"" !!!"

!!! % !!"

67F9

'"! !!!#!! $!!! % !

!"$#! "&&

$!!! % !!"&"

*.2 '"" !!!#!" $!!" % !

!!$#! "&&

$!!! % !!"&"

3 6779

B-,& ,<*, ,<& +-.,&0,*., G",< ,<& <"#<&% ?*=$*,"-. -/ ,<& A%"H& &IA&.20>-%& &5-%, *.2 G".0 G",< * <"#<&% A%-D*D"=",J1 D$, .-, G",< A%-D*D"=",J

:'K&& LM%&H4N*0,%"==- *.2 O&%2"&% 6:PPE9 /-% >-%& #&.&%*= +*0&03

F'

19  

Page 20: Strategy(in(Contests(–An(Introduc4on(faculty.haas.berkeley.edu/rjmorgan/phdba279b/Contests - FINAL2.pdf · Strategy(in(Contests(–An(Introduc4on(by(Kai(A.(Konrad,(Working(Paper,(January(2007*

Many Participants

• General  Contest  Success  Func4on    • Denote                      and  let  •  Yields  FOC  •  Thus  we  can  characterize  total  efforts  of  par4cipants  that  expend  nonzero  efforts  as:  

!" #$% #&''()* )(+,%-, %.&/'/01/&2 3(%- +(, 4'546- 45413 ,$% 71/8% ,( ,$%)(+,%-,4+, 5$( 94'&%- /, 2(-,: 0&, ,$% 5/+ 71(040/'/,/%- 41% 0/4-%3 ;49(140'6;(1 ,$% )(+,%-,4+, 5/,$ ,$% $/<$%1 94'&4,/(+" ='-(: ,(,4' 1%+, -%%*/+< %>(1,/- <%+%14''6 1%3&)%3 /; ,$% )(+,%-,4+,- 41% 2(1% 3/>%1%+, /+ ,$%/1 94'&4,/(+ (;,$% 71/8%" #$/- )4+ 0% -%%+ 4- ;(''(5-" ?(+-/3%1 94'&4,/(+- !! ! ! "" 4+3!" ! ! !"" #$% -&2 (; %>(1,- )4+ 0% 51/,,%+ 4-

#!! " #!" ! #!! " !"$

$!!!!!"

#!!! " !!"$"

@ABC

! #! "" " ! !"$$#! ""$!#! !"$!

##! ""$! " #! !"$!$"@ADC

! %!$#! ""$!#! !"$!

##! ""$! " #! !"$!$"" @AEC

F/>%1%+,/4,/+< ##!!"#!"$ 5/,$ 1%-7%), ,( " 1%9%4'- 4;,%1 -(2% ,14+-;(124,/(+-

,$4, ,$/- -&2 3%)1%4-%- /+ ""

!"#$ %"&'()(%"#'* G%+%14'/8/+< ,$% -622%,1/) #&''()* )(+,%-, 5/,$ 4+410/,1416: 0&, -&H)/%+,'6 -24'': $ (1 ,$% 4-622%,1/) #&''()* )(+,%-, 5/,$$ ! & ,( ,$% )4-% 5/,$ 4+6 I+/,% +&20%1 % & % /- +(, 4 3/H)&', %J%1)/-%"K(1 )(27414,/9% -,4,/)- (+ 2(1% <%+%14' )(+,%-, -&))%-- ;&+),/(+- ,$4, 41%04-%3 (+ 4 14,/( '##"$(

!'###$ 0&, )(9%1 ,$% )4-% /+ @LMC 4+3 4-622%,N

1/) 94'&4,/(+-: -%% ?(1+%- 4+3 O41,'%6 @PQQBC ;(1 %J/-,%+)%: &+/.&%+%--: 4)$414),%1/84,/(+ (; ,$% %.&/'/01/&2 4+3 '/2/, 1%-&',-:!M 4+3 R,%/+ @PQQPC 4+3S%'4+3 4+3 R,14&2% @PQQBC ;(1 4+ %'%<4+, -('&,/(+ (; ,$% )4-% @LMC"#$% -622%,1/) )4-% -$(5- ,$4, ,$% 14,/( 0%,5%%+ ,$% 4<<1%<4,% %>(1,

,$4, /- %J7%+3%3 /+ ,$% %.&/'/01/&2 4+3 ,$% 94'&% (; ,$% 71/8% /- /+)1%4-/+</+ ,$% +&20%1 (; )(+,%-,4+,-: 4+3 )(+9%1<%- ,(5413- $ ;(1 4'' $ " &" T+741,/)&'41: ,$% 71/8% /- ;&''6 U3/--/74,%3V 06 4<<1%<4,% %>(1,: /; $ ! &"PQ #$%;4), ,$4, ,$% 71/8% /- +(, ;&''6 3/--/74,%3 %9%+ 5/,$ ;1%% %+,16 4+3 4 '41<%+&20%1 (; /3%+,/)4' )(+,%-,4+,- $4- 1%)%/9%3 -(2% 4,,%+,/(+: 4- /, -%%2- ,()(+,143/), ,$% /+,&/,/(+ ,$4, 1%+,- )4++(, -&19/9% 5/,$ 7%1;%), )(27%,/,/(+42(+< 4+ /+I+/,% +&20%1 (; /3%+,/)4' )(+,%-,4+,-" R(2% 3/-)&--/(+ (; ,$/-)4+ 0% ;(&+3 /+ ,$% )(''%),%3 747%1- 9('&2% 06 W()*413 4+3 #&''()* @PQQ!C"

!M?(1+%- 4+3 O41,'%6 @PQQPC )(+-/3%1 %+,16 ;%%- ;(1 )(+,%-,- 5/,$ ,$/- -,1&),&1%" O/''24+4+3 X4,8 @!MYAC 5%1% ,$% I1-, ,( )(+-/3%1 1/-* 49%1-/(+ /+ 1%+, -%%*/+<: 4+3 ?(1+%- 4+3O41,'%6 @PQQ!C 4+4'6-% ,$/- 2(1% <%+%14' -,1&),&1% ;(1 1/-* 49%1-% )(+,%-,4+,-" Z41'/%1)(27414,/9% -,4,/) 1%-&',- (+ ,$/- -,1&),&1% 41% 06 [,/ @!MMEC 4+3 \]1+%163 @PQQ!C"PQ#$%-% /+,&/,/9% 1%-&',- -$(&'3 +(, -/27'6 0% %J,147('4,%3 ,( )(+,%-,- 5/,$ (,$%1 )(+,%-,

-&))%-- ;&+),/(+- 2(1% <%+%14''6: 4- /- -$(5+ /+ \]1+%163 @PQQ!C"

LM

!""#$%&'$ ()**)+ ,-.'/0""1 '23"-#$& 451 -$ '23',6'7 '89.6 65-6 '2,''7& 65'

:-"0-6#9$ 9/ 65' 3.#;' 9. <9:'.7#&&#3-6#9$= ,-$$96 9,,0.>?)

@.-7&6'#$ -$7 A9$.-7 ()***+ -"&9 -77.'&& 65#& #&&0'> B5'1 &594 65-6 /0""

7#&&#3-6#9$ -"&9 .'&0"6& /9. ! " ! #/ 65' ,9$6'&6 6-C'& 3"-,' $96 -& - &#D0"6-E$'90& B0""9,CE,9$6'&6 -D9$% -"" # ,9$6'&6-$6&F G06 #$ - D0"6#E&6-%' ,9$6'&6#$ 45#,5 - $0DG'. 9/ 3-.-""'" ,9$6'&6& 6-C' 3"-,' -6 '-,5 &6-%'F 45'.' 649

,9$6'&6-$6& -"4-1& ,9D3'6' 4#65 '-,5 965'. #$ - 649E3"-1'. B0""9,C ,9$6'&6F

-$7 9$"1 65' 4#$$'. #$ '-,5 9/ 65' 3-.-""'" &6-%' ,9$6'&6& #& 3.9D96'7 69 65'

$'26 &6-%' 9/ ,9$6'&6&F "#C' #$ -$ 3-#.E4#&' '"#D#$-6#9$ 690.$-D'$6>

B5' #$&#%56 0&'7 #$ H6'#$ (?II?+F J9.$'& -$7 K-.6"'1 (?IIL+ -$7 M'"-$7

-$7 H6.-0D' (?IIL+ 69 &9":' /9. 65' ,-&' 4#65 -&1DD'6.#, :-"0-6#9$& 9/ 65'

3.#;' .'&0"6& /.9D 65' 9G&'.:-6#9$ 65-6 65' 3-198 9/ 3"-1'. $ 7'3'$7& 9$"1 9$3"-1'. $=& 94$ '89.6 -$7 65' &0D 9/ -"" 965'. 3"-1'.&= '89.6> N9. 65#& 30.39&'F7'O$' % " #!!"!!"&! -$7 $96' 65-6 '!$&% " &!(%> P$&'.6#$% 65#& #$ 65' 3-198/0$,6#9$ (?+ -$7 ,-",0"-6#$% O.&6E9.7'. ,9$7#6#9$& 1#'"7&

&! " &'()*) %$!!%

*!%+> (QR+

P/ -"" ,9$6'&6-$6& '23'$7 $9$E;'.9 '89.6 #$ 65' 'S0#"#G.#0DF 65#& ,-$ G' .'E

-..-$%'7 69 ,5-.-,6'.#;'

"!

!!"

&!! " %! "

#! !#

#

#!!"!!""#!

> (Q*+

T96' 65-6F /.9D 65' O.&6E9.7'. ,9$7#6#9$ (QR+F ,9.$'. &9"06#9$& #$ 45#,5

&9D' ,9$6'&6-$6& 3.'/'. 69 ,599&' ;'.9 '89.6 -.' "#C'"1 69 'D'.%' #/ ,9$6'&6-$6&

-.' &0U,#'$6"1 5'6'.9%'$90&> P$ 65#& ,-&' %! #& /90$7 G1 -$ 'S0-6#9$ &#D#"-.

69 (Q*+F /9. 45#,5 # #& .'3"-,'7 G1 65' $0DG'. 9/ 3"-1'.& 459 D-C' $9$E;'.9G#7& #$ 65' 'S0#"#G.#0D>

!"# $% &"$% '()&*%& %( +(+,-./0 V51 5-& 65#& /0$,6#9$ G''$ #$:'$6'7

-$7 0&'7 #$7'3'$7'$6"1 #$ &9 D-$1 7#8'.'$6 -.'-& 9/ -33"#'7 65'9.1W B5'.'

&''D 69 G' 649 7#8'.'$6 613'& 9/ X0&6#O,-6#9$>

12$(3.&$' /*.%()$)4 Y'""F A''$'1 -$7 Z#66"' ()*[L+F HC-3'.7-& ()**\+F

J"-.C -$7 ]##& ()**R-+ -$7 A99.'D-$ -$7 H599$G''C ()**[+ %#:' &1&6'D&

9/ -2#9D& -G906 594 ,9$^#,6 #& 7',#7'7 -& - /0$,6#9$ 9/ 65' ,9$6'&6-$6&= '/E

/9.6& &9 65-6 65'&' &'6& 9/ -2#9D& #D3"1 65-6 65' ,9$6'&6 &0,,'&& /0$,6#9$& -.'

:-.#-$6& 9/ 65' B0""9,C ,9$6'&6 &0,,'&& /0$,6#9$>

?)N-G'""- ()**L+ -$7 A''D (?II)+ D-C' /0.65'. -77#6#9$& 69 65' /.-D'49.C -$7 65'

.'&0"6 #$ !""#$%&'$ ()**)+>

QI

!""#$%&'$ ()**)+ ,-.'/0""1 '23"-#$& 451 -$ '23',6'7 '89.6 65-6 '2,''7& 65'

:-"0-6#9$ 9/ 65' 3.#;' 9. <9:'.7#&&#3-6#9$= ,-$$96 9,,0.>?)

@.-7&6'#$ -$7 A9$.-7 ()***+ -"&9 -77.'&& 65#& #&&0'> B5'1 &594 65-6 /0""

7#&&#3-6#9$ -"&9 .'&0"6& /9. ! " ! #/ 65' ,9$6'&6 6-C'& 3"-,' $96 -& - &#D0"6-E$'90& B0""9,CE,9$6'&6 -D9$% -"" # ,9$6'&6-$6&F G06 #$ - D0"6#E&6-%' ,9$6'&6#$ 45#,5 - $0DG'. 9/ 3-.-""'" ,9$6'&6& 6-C' 3"-,' -6 '-,5 &6-%'F 45'.' 649

,9$6'&6-$6& -"4-1& ,9D3'6' 4#65 '-,5 965'. #$ - 649E3"-1'. B0""9,C ,9$6'&6F

-$7 9$"1 65' 4#$$'. #$ '-,5 9/ 65' 3-.-""'" &6-%' ,9$6'&6& #& 3.9D96'7 69 65'

$'26 &6-%' 9/ ,9$6'&6&F "#C' #$ -$ 3-#.E4#&' '"#D#$-6#9$ 690.$-D'$6>

B5' #$&#%56 0&'7 #$ H6'#$ (?II?+F J9.$'& -$7 K-.6"'1 (?IIL+ -$7 M'"-$7

-$7 H6.-0D' (?IIL+ 69 &9":' /9. 65' ,-&' 4#65 -&1DD'6.#, :-"0-6#9$& 9/ 65'

3.#;' .'&0"6& /.9D 65' 9G&'.:-6#9$ 65-6 65' 3-198 9/ 3"-1'. $ 7'3'$7& 9$"1 9$3"-1'. $=& 94$ '89.6 -$7 65' &0D 9/ -"" 965'. 3"-1'.&= '89.6> N9. 65#& 30.39&'F7'O$' % " #!!"!!"&! -$7 $96' 65-6 '!$&% " &!(%> P$&'.6#$% 65#& #$ 65' 3-198/0$,6#9$ (?+ -$7 ,-",0"-6#$% O.&6E9.7'. ,9$7#6#9$& 1#'"7&

&! " &'()*) %$!!%

*!%+> (QR+

P/ -"" ,9$6'&6-$6& '23'$7 $9$E;'.9 '89.6 #$ 65' 'S0#"#G.#0DF 65#& ,-$ G' .'E

-..-$%'7 69 ,5-.-,6'.#;'

"!

!!"

&!! " %! "

#! !#

#

#!!"!!""#!

> (Q*+

T96' 65-6F /.9D 65' O.&6E9.7'. ,9$7#6#9$ (QR+F ,9.$'. &9"06#9$& #$ 45#,5

&9D' ,9$6'&6-$6& 3.'/'. 69 ,599&' ;'.9 '89.6 -.' "#C'"1 69 'D'.%' #/ ,9$6'&6-$6&

-.' &0U,#'$6"1 5'6'.9%'$90&> P$ 65#& ,-&' %! #& /90$7 G1 -$ 'S0-6#9$ &#D#"-.

69 (Q*+F /9. 45#,5 # #& .'3"-,'7 G1 65' $0DG'. 9/ 3"-1'.& 459 D-C' $9$E;'.9G#7& #$ 65' 'S0#"#G.#0D>

!"# $% &"$% '()&*%& %( +(+,-./0 V51 5-& 65#& /0$,6#9$ G''$ #$:'$6'7

-$7 0&'7 #$7'3'$7'$6"1 #$ &9 D-$1 7#8'.'$6 -.'-& 9/ -33"#'7 65'9.1W B5'.'

&''D 69 G' 649 7#8'.'$6 613'& 9/ X0&6#O,-6#9$>

12$(3.&$' /*.%()$)4 Y'""F A''$'1 -$7 Z#66"' ()*[L+F HC-3'.7-& ()**\+F

J"-.C -$7 ]##& ()**R-+ -$7 A99.'D-$ -$7 H599$G''C ()**[+ %#:' &1&6'D&

9/ -2#9D& -G906 594 ,9$^#,6 #& 7',#7'7 -& - /0$,6#9$ 9/ 65' ,9$6'&6-$6&= '/E

/9.6& &9 65-6 65'&' &'6& 9/ -2#9D& #D3"1 65-6 65' ,9$6'&6 &0,,'&& /0$,6#9$& -.'

:-.#-$6& 9/ 65' B0""9,C ,9$6'&6 &0,,'&& /0$,6#9$>

?)N-G'""- ()**L+ -$7 A''D (?II)+ D-C' /0.65'. -77#6#9$& 69 65' /.-D'49.C -$7 65'

.'&0"6 #$ !""#$%&'$ ()**)+>

QI

!""#$%&'$ ()**)+ ,-.'/0""1 '23"-#$& 451 -$ '23',6'7 '89.6 65-6 '2,''7& 65'

:-"0-6#9$ 9/ 65' 3.#;' 9. <9:'.7#&&#3-6#9$= ,-$$96 9,,0.>?)

@.-7&6'#$ -$7 A9$.-7 ()***+ -"&9 -77.'&& 65#& #&&0'> B5'1 &594 65-6 /0""

7#&&#3-6#9$ -"&9 .'&0"6& /9. ! " ! #/ 65' ,9$6'&6 6-C'& 3"-,' $96 -& - &#D0"6-E$'90& B0""9,CE,9$6'&6 -D9$% -"" # ,9$6'&6-$6&F G06 #$ - D0"6#E&6-%' ,9$6'&6#$ 45#,5 - $0DG'. 9/ 3-.-""'" ,9$6'&6& 6-C' 3"-,' -6 '-,5 &6-%'F 45'.' 649

,9$6'&6-$6& -"4-1& ,9D3'6' 4#65 '-,5 965'. #$ - 649E3"-1'. B0""9,C ,9$6'&6F

-$7 9$"1 65' 4#$$'. #$ '-,5 9/ 65' 3-.-""'" &6-%' ,9$6'&6& #& 3.9D96'7 69 65'

$'26 &6-%' 9/ ,9$6'&6&F "#C' #$ -$ 3-#.E4#&' '"#D#$-6#9$ 690.$-D'$6>

B5' #$&#%56 0&'7 #$ H6'#$ (?II?+F J9.$'& -$7 K-.6"'1 (?IIL+ -$7 M'"-$7

-$7 H6.-0D' (?IIL+ 69 &9":' /9. 65' ,-&' 4#65 -&1DD'6.#, :-"0-6#9$& 9/ 65'

3.#;' .'&0"6& /.9D 65' 9G&'.:-6#9$ 65-6 65' 3-198 9/ 3"-1'. $ 7'3'$7& 9$"1 9$3"-1'. $=& 94$ '89.6 -$7 65' &0D 9/ -"" 965'. 3"-1'.&= '89.6> N9. 65#& 30.39&'F7'O$' % " #!!"!!"&! -$7 $96' 65-6 '!$&% " &!(%> P$&'.6#$% 65#& #$ 65' 3-198/0$,6#9$ (?+ -$7 ,-",0"-6#$% O.&6E9.7'. ,9$7#6#9$& 1#'"7&

&! " &'()*) %$!!%

*!%+> (QR+

P/ -"" ,9$6'&6-$6& '23'$7 $9$E;'.9 '89.6 #$ 65' 'S0#"#G.#0DF 65#& ,-$ G' .'E

-..-$%'7 69 ,5-.-,6'.#;'

"!

!!"

&!! " %! "

#! !#

#

#!!"!!""#!

> (Q*+

T96' 65-6F /.9D 65' O.&6E9.7'. ,9$7#6#9$ (QR+F ,9.$'. &9"06#9$& #$ 45#,5

&9D' ,9$6'&6-$6& 3.'/'. 69 ,599&' ;'.9 '89.6 -.' "#C'"1 69 'D'.%' #/ ,9$6'&6-$6&

-.' &0U,#'$6"1 5'6'.9%'$90&> P$ 65#& ,-&' %! #& /90$7 G1 -$ 'S0-6#9$ &#D#"-.

69 (Q*+F /9. 45#,5 # #& .'3"-,'7 G1 65' $0DG'. 9/ 3"-1'.& 459 D-C' $9$E;'.9G#7& #$ 65' 'S0#"#G.#0D>

!"# $% &"$% '()&*%& %( +(+,-./0 V51 5-& 65#& /0$,6#9$ G''$ #$:'$6'7

-$7 0&'7 #$7'3'$7'$6"1 #$ &9 D-$1 7#8'.'$6 -.'-& 9/ -33"#'7 65'9.1W B5'.'

&''D 69 G' 649 7#8'.'$6 613'& 9/ X0&6#O,-6#9$>

12$(3.&$' /*.%()$)4 Y'""F A''$'1 -$7 Z#66"' ()*[L+F HC-3'.7-& ()**\+F

J"-.C -$7 ]##& ()**R-+ -$7 A99.'D-$ -$7 H599$G''C ()**[+ %#:' &1&6'D&

9/ -2#9D& -G906 594 ,9$^#,6 #& 7',#7'7 -& - /0$,6#9$ 9/ 65' ,9$6'&6-$6&= '/E

/9.6& &9 65-6 65'&' &'6& 9/ -2#9D& #D3"1 65-6 65' ,9$6'&6 &0,,'&& /0$,6#9$& -.'

:-.#-$6& 9/ 65' B0""9,C ,9$6'&6 &0,,'&& /0$,6#9$>

?)N-G'""- ()**L+ -$7 A''D (?II)+ D-C' /0.65'. -77#6#9$& 69 65' /.-D'49.C -$7 65'

.'&0"6 #$ !""#$%&'$ ()**)+>

QI

!""#$%&'$ ()**)+ ,-.'/0""1 '23"-#$& 451 -$ '23',6'7 '89.6 65-6 '2,''7& 65'

:-"0-6#9$ 9/ 65' 3.#;' 9. <9:'.7#&&#3-6#9$= ,-$$96 9,,0.>?)

@.-7&6'#$ -$7 A9$.-7 ()***+ -"&9 -77.'&& 65#& #&&0'> B5'1 &594 65-6 /0""

7#&&#3-6#9$ -"&9 .'&0"6& /9. ! " ! #/ 65' ,9$6'&6 6-C'& 3"-,' $96 -& - &#D0"6-E$'90& B0""9,CE,9$6'&6 -D9$% -"" # ,9$6'&6-$6&F G06 #$ - D0"6#E&6-%' ,9$6'&6#$ 45#,5 - $0DG'. 9/ 3-.-""'" ,9$6'&6& 6-C' 3"-,' -6 '-,5 &6-%'F 45'.' 649

,9$6'&6-$6& -"4-1& ,9D3'6' 4#65 '-,5 965'. #$ - 649E3"-1'. B0""9,C ,9$6'&6F

-$7 9$"1 65' 4#$$'. #$ '-,5 9/ 65' 3-.-""'" &6-%' ,9$6'&6& #& 3.9D96'7 69 65'

$'26 &6-%' 9/ ,9$6'&6&F "#C' #$ -$ 3-#.E4#&' '"#D#$-6#9$ 690.$-D'$6>

B5' #$&#%56 0&'7 #$ H6'#$ (?II?+F J9.$'& -$7 K-.6"'1 (?IIL+ -$7 M'"-$7

-$7 H6.-0D' (?IIL+ 69 &9":' /9. 65' ,-&' 4#65 -&1DD'6.#, :-"0-6#9$& 9/ 65'

3.#;' .'&0"6& /.9D 65' 9G&'.:-6#9$ 65-6 65' 3-198 9/ 3"-1'. $ 7'3'$7& 9$"1 9$3"-1'. $=& 94$ '89.6 -$7 65' &0D 9/ -"" 965'. 3"-1'.&= '89.6> N9. 65#& 30.39&'F7'O$' % " #!!"!!"&! -$7 $96' 65-6 '!$&% " &!(%> P$&'.6#$% 65#& #$ 65' 3-198/0$,6#9$ (?+ -$7 ,-",0"-6#$% O.&6E9.7'. ,9$7#6#9$& 1#'"7&

&! " &'()*) %$!!%

*!%+> (QR+

P/ -"" ,9$6'&6-$6& '23'$7 $9$E;'.9 '89.6 #$ 65' 'S0#"#G.#0DF 65#& ,-$ G' .'E

-..-$%'7 69 ,5-.-,6'.#;'

"!

!!"

&!! " %! "

#! !#

#

#!!"!!""#!

> (Q*+

T96' 65-6F /.9D 65' O.&6E9.7'. ,9$7#6#9$ (QR+F ,9.$'. &9"06#9$& #$ 45#,5

&9D' ,9$6'&6-$6& 3.'/'. 69 ,599&' ;'.9 '89.6 -.' "#C'"1 69 'D'.%' #/ ,9$6'&6-$6&

-.' &0U,#'$6"1 5'6'.9%'$90&> P$ 65#& ,-&' %! #& /90$7 G1 -$ 'S0-6#9$ &#D#"-.

69 (Q*+F /9. 45#,5 # #& .'3"-,'7 G1 65' $0DG'. 9/ 3"-1'.& 459 D-C' $9$E;'.9G#7& #$ 65' 'S0#"#G.#0D>

!"# $% &"$% '()&*%& %( +(+,-./0 V51 5-& 65#& /0$,6#9$ G''$ #$:'$6'7

-$7 0&'7 #$7'3'$7'$6"1 #$ &9 D-$1 7#8'.'$6 -.'-& 9/ -33"#'7 65'9.1W B5'.'

&''D 69 G' 649 7#8'.'$6 613'& 9/ X0&6#O,-6#9$>

12$(3.&$' /*.%()$)4 Y'""F A''$'1 -$7 Z#66"' ()*[L+F HC-3'.7-& ()**\+F

J"-.C -$7 ]##& ()**R-+ -$7 A99.'D-$ -$7 H599$G''C ()**[+ %#:' &1&6'D&

9/ -2#9D& -G906 594 ,9$^#,6 #& 7',#7'7 -& - /0$,6#9$ 9/ 65' ,9$6'&6-$6&= '/E

/9.6& &9 65-6 65'&' &'6& 9/ -2#9D& #D3"1 65-6 65' ,9$6'&6 &0,,'&& /0$,6#9$& -.'

:-.#-$6& 9/ 65' B0""9,C ,9$6'&6 &0,,'&& /0$,6#9$>

?)N-G'""- ()**L+ -$7 A''D (?II)+ D-C' /0.65'. -77#6#9$& 69 65' /.-D'49.C -$7 65'

.'&0"6 #$ !""#$%&'$ ()**)+>

QI

20  

Page 21: Strategy(in(Contests(–An(Introduc4on(faculty.haas.berkeley.edu/rjmorgan/phdba279b/Contests - FINAL2.pdf · Strategy(in(Contests(–An(Introduc4on(by(Kai(A.(Konrad,(Working(Paper,(January(2007*

Why is Tullock (Lottery) model so popular? • Axioma4c  Reasoning  

•  Individual  payoffs  depend  only  on  own  preferences  and  aggregated  values  of  other  players’  efforts  

•  For  r=1  for  a  given  aggregate  effort  of  all  contestants,  the  probability  of  winning  is  linear  in  contestant  i’s  own  effort  

•  Belle,  Keeney,  and  LiHle  (1975)  prove  that  this  is  the  only  contest  success  func4on  that  has  this  property    

•  Informa4on  aspects  •  Tullock  (1980)  assumed  contestants  know  everything  about  each  other  

• Microeconomic  underpinnings    •  Simple  search  model  •  Ra4o  of  efforts  as  a  probability  for  winning  the  contest  

21  

Page 22: Strategy(in(Contests(–An(Introduc4on(faculty.haas.berkeley.edu/rjmorgan/phdba279b/Contests - FINAL2.pdf · Strategy(in(Contests(–An(Introduc4on(by(Kai(A.(Konrad,(Working(Paper,(January(2007*

Experimental • Most  experiment  find  support  for  contest  theory    • Overbidding  occurs  (aggregate  effort  exceeds  Nash  equilibrium  predic4ons)    

•  Excep4on:  rank-­‐order  tournaments    • Why  is  this  the  case?  

•  Open  ques4on:  What  contributes  to  overbidding?  

22  

Page 23: Strategy(in(Contests(–An(Introduc4on(faculty.haas.berkeley.edu/rjmorgan/phdba279b/Contests - FINAL2.pdf · Strategy(in(Contests(–An(Introduc4on(by(Kai(A.(Konrad,(Working(Paper,(January(2007*

Robust Results •  1.  One  player’s  increased  efforts  creates  a  nega4ve  externality  for  another  

•  More  heterogeneous  contestants,  usually  reduces  aggregate  equilibrium  effort  and  increases  net  payoffs    

•  2.  Contestant  with  higher  valua4on  is  usually  more  likely  to  win  •  Also  expends  more  effort    •  Close  one-­‐to-­‐one  rela4onship  for  differences  in  valua4on  and  differences  in  individual  cost  of  produc4on  given  effort  levels  

23  

Page 24: Strategy(in(Contests(–An(Introduc4on(faculty.haas.berkeley.edu/rjmorgan/phdba279b/Contests - FINAL2.pdf · Strategy(in(Contests(–An(Introduc4on(by(Kai(A.(Konrad,(Working(Paper,(January(2007*

Sequential choices •  Stage  1:  contestant  simultaneously  choose  whether  to  exert  effort  “early”  (E)  or  “late”  (L)  

•  Stage  2:  simultaneous  contest  if  1st  stage  equilibrium  is  (E,E)  or  (L,L)                                        sequen4al  contest  if  1st  stage  equilibrium  is  (E,L)  or  (L,E)    

2x

1x

•  

•   •  

2BR

1BR•  Illustrate  with  Tullock  contest  (n=2)  •  Also,    •  If  (E,L)  in  stage  1,  then              in  stage  2    •  If  (L,E)  in  stage  1,  then              in  stage  2    •  If  (E,E)  or  (L,L)  in  stage  1,  then                    in  stage  2  

1S

2S

N

N

1S2S

>1 2v v

•  The  SPNE  is  (L,E)  and      •  The  “weaker”  player  moves  first          and  commits  to  a  lower  effort  

2S

24  

Page 25: Strategy(in(Contests(–An(Introduc4on(faculty.haas.berkeley.edu/rjmorgan/phdba279b/Contests - FINAL2.pdf · Strategy(in(Contests(–An(Introduc4on(by(Kai(A.(Konrad,(Working(Paper,(January(2007*

•  Contests  may  require  an  entry  fee  (or,  contestant  have  an  opportunity  cost)  •  If  contest  fully  dissipates  rent,  why  should  contestants  want  to  incur  an  entry  fee?    •  2-­‐stage  game  with  n  possible  contestants  with  same  valua4on                      ;  entry  fee  of    

     Stage  1:  contestants  decide  whether  or  not  to  par4cipate  

     Stage  2:  All-­‐pay  auc4on  among  contestants  who  entered  

•  Asymmetric  equilibria  in  pure  strategy  with  only  one  contestant  who  enters  •  Symmetric  mixed  strategy  equilibrium:    each  enters  with  probability  

•  Does  all  this  cons4tute  an  “entry  puzzle”?    •  Possible  resolu4on:  players’  cost  in  any  given  contest  may  be  a  random  draw  

Voluntary participation

> 0v D

( ) −= −

1 ( 1)* 1 nq D v

25  

Page 26: Strategy(in(Contests(–An(Introduc4on(faculty.haas.berkeley.edu/rjmorgan/phdba279b/Contests - FINAL2.pdf · Strategy(in(Contests(–An(Introduc4on(by(Kai(A.(Konrad,(Working(Paper,(January(2007*

•  Contest  designer’s  objec4ve  func4on  assumed  to  care  about  aggregate  effort  •  In  general,  high  contestants’  valua4on  (low  costs)  increases  aggregate  effort  •  Also,  homogeneity  of  contestants  tend  to  increase  aggregate  effort  

•  Counter-­‐intui4ve  result:  it  might  be  desirable  to  exclude  contestant  who  value  the  prize  

       most  highly  

•  Illustrate  with  all-­‐pay  auc4on,  n=3,    and      •  Equilibria  where  expected  aggregate  effort  X  is  highest  have  •  But  if  contestant  1  is  excluded,      

Exclusion

26  

⎛ ⎞= + <⎜ ⎟⎝ ⎠

2 22

11

2v vX v

v= 2X v

> =1 2 3v v v

Page 27: Strategy(in(Contests(–An(Introduc4on(faculty.haas.berkeley.edu/rjmorgan/phdba279b/Contests - FINAL2.pdf · Strategy(in(Contests(–An(Introduc4on(by(Kai(A.(Konrad,(Working(Paper,(January(2007*

•  Contestants  act  as  “principals”  and  hire  “agents”  to  do  their  bidding  •  Illustrate  with  all-­‐pay  auc4on  and  two  contestants  •  Contract  is                                ,  where                      down  payment,  and                                              is  the  “delegated  value”  

•  Payoff  to  agent  •  Payoff  to  principal                                                                                                            à                                                                    (with                                    by  IR)  

•  Two  pure  strategy  equilibria:                                                                                  and      •  Contestants  use  delega4on  to  generate  asymmetry  between  the  two  agents,  thereby  leading  to  a  smaller  dissipa4on  of  the  prize  

•  Note  the  role  of  “homogeneity”  vs  “heterogeneity”  of  players  •  However,  the  delega4on  contract  is  not  renego4a4on-­‐proof  

Delegation

27  

( )ϕ ,i ib ϕ =i ∈ ⎡ ⎤⎣ ⎦0,ib bπ ϕ= − + −( , )Ai i i i j i ip x x b x

π ϕ= + −( , )( )Pi i i i j i ip x x v b π = −* *P

i i i ip v Ex π = 0AiE

( )= =* *1 22 ,b v b b ( )= =* *

1 2, 2b b b v

Page 28: Strategy(in(Contests(–An(Introduc4on(faculty.haas.berkeley.edu/rjmorgan/phdba279b/Contests - FINAL2.pdf · Strategy(in(Contests(–An(Introduc4on(by(Kai(A.(Konrad,(Working(Paper,(January(2007*

Externalities •  Joint  Ownership  

•  Firms  are  no  longer  indifferent  about  who  wins  the  prize    •  Minority  Shareholdings  can  reduce  rents  generated  by  the  alloca4on  of  the  prize  and  the  firms’  aggregate  equilibrium  efforts  

•  Informa4on  externali4es  •  Revealing  informa4on  to  uninformed  voters    •  Inverse  campaigning  dissipates  rents    (Konrad  2004)    

28  

Page 29: Strategy(in(Contests(–An(Introduc4on(faculty.haas.berkeley.edu/rjmorgan/phdba279b/Contests - FINAL2.pdf · Strategy(in(Contests(–An(Introduc4on(by(Kai(A.(Konrad,(Working(Paper,(January(2007*

Public Goods and Free Riding •  Homogeneous  groups  

•  Aggregate  effort  of  a  group  and  its  win  probability  are  completely  independent  of  number  of  members  in  the  two  groups  (Katz  et  al.  1990)  

• Why?  Free-­‐riding  might  intensify  as  group  gets  larger    •  Hetergeneous  groups    

•  Doesn’t  effect  aggregate  equilibrium  group  effort    •  Only  highest  group  member  valua4on  maHers    

29  

Page 30: Strategy(in(Contests(–An(Introduc4on(faculty.haas.berkeley.edu/rjmorgan/phdba279b/Contests - FINAL2.pdf · Strategy(in(Contests(–An(Introduc4on(by(Kai(A.(Konrad,(Working(Paper,(January(2007*

Prizes •  Endogeneous  Prizes  

•  Suppose  prize  values  are  func4ons  of  the  vector  of  efforts    •  Theore4cally  generates  a  different  set  of  predic4ons    •  In  some  case,  all-­‐pay  auc4ons  can  have  pure  strategy  equilibrium    

• Mul4ple  Prizes  •  Sports  tournaments  onen  award  mul4ple  prizes  •  Nobel  Prize  exemplifies  general  non-­‐op4mality  of  a  single  large  prize    •  How  does  prize  structure  influence  contest  outcome?  •  Assump4on:  Contest  designer  allocates  a  fixed  amount  of  money  either  to  one  grand  prize  or  split  between  mul4ple  prizes    

•  But  how  does  the  designer  allocate  these  prizes?  •  Sequen4al  games  or  based  on  a  CSF  on  basis  of  actual  efforts    

•  Many  cases  have  been  looked  at  but  not  all    

 30  

Page 31: Strategy(in(Contests(–An(Introduc4on(faculty.haas.berkeley.edu/rjmorgan/phdba279b/Contests - FINAL2.pdf · Strategy(in(Contests(–An(Introduc4on(by(Kai(A.(Konrad,(Working(Paper,(January(2007*

“Handicapping” • More  heterogenity  between  contestants  may  lead  to  lower  aggregate  equilibrium  efforts    

•   Contest  designers  may  want  to  favor  or  bias  towards  the  contestant  who  values  the  prize  lower  to  increase  aggregate  efforts  in  equilibrium  

•  These  concepts  have  been  used  to  study  affirma4ve  ac4on  issues  • Handicap  effort  of  strong  players  or  help  the  efforts  of  the  weak    

•  Clark  and  Riis  (2000)  show  that  this  increases  a  bureaucrat's  receipts      

31  

Page 32: Strategy(in(Contests(–An(Introduc4on(faculty.haas.berkeley.edu/rjmorgan/phdba279b/Contests - FINAL2.pdf · Strategy(in(Contests(–An(Introduc4on(by(Kai(A.(Konrad,(Working(Paper,(January(2007*

•  Introduce  more  detail  on  how  contestants’  efforts  translate  into  win  probabili4es.            Three  structures  are  discussed:  

•  Nested  contests:  contestants  are  actually  groups,  once  the  winning  group  is  determined  the  prize  needs  to  be  allocated  to  members  (another  contest)  

       -­‐-­‐  Inter-­‐group  contest  and  intra-­‐group  contest  

•  Alliances:  the  forma4on  of  groups  in  the  inter-­‐group  contest  may  be  endogenous  • Mul0-­‐ba3le  contests:  there  are  several  stages  to  a  contest  

       -­‐-­‐  Race  

       -­‐-­‐  Elimina4on  tournament  

       -­‐-­‐  Tug  of  war    

Grand Contests

32  

Page 33: Strategy(in(Contests(–An(Introduc4on(faculty.haas.berkeley.edu/rjmorgan/phdba279b/Contests - FINAL2.pdf · Strategy(in(Contests(–An(Introduc4on(by(Kai(A.(Konrad,(Working(Paper,(January(2007*

•  Exogenous  sharing  rule  (intra-­‐group  alloca4on):  merit  vs  egalitarianism        Example:  2  groups,  prize            allocated  to  a  group  based  on  the  total  effort  of  its  members  

     Group  win  probabili4es  

     Sharing  rule:  the  share  of  the  prize  to  member  j  ,  if  group  wins,  is          A  “merit”  rule                                  yields  more  group  efforts  than  an  “egalitarian”  rule  

•  Group  choice  of  a  sharing  rule:  possible  4me-­‐consistency  problem  •  Hierarchical  structures  may  be  advantageous.  Example:  nm  homogeneous  contestants  

•  One-­‐stage  Tullock  contest:  expected  payoff  of  winner  is  •  Two-­‐stage  contest:  1st  stage  compe44on  between  n  groups  of  m  members  each;  2nd  stage  compe44on  between  members  of  winning  group.  Expected  payoff:  

       à  two-­‐stage  contest  dissipates  less  rent      

Nested Contests

33  

== ≡

+ ∑ 11 2

, jnii i ijj

xp v x xx x

− −⎛ ⎞− −⎜ ⎟⎝ ⎠2

1 11 n m vmnm

v

−⎛ ⎞−⎜ ⎟⎝ ⎠

11 nm vnm

α α= − +1(1 ) ij

iji i

xq

x nα =( 0) α =( 1)

Page 34: Strategy(in(Contests(–An(Introduc4on(faculty.haas.berkeley.edu/rjmorgan/phdba279b/Contests - FINAL2.pdf · Strategy(in(Contests(–An(Introduc4on(by(Kai(A.(Konrad,(Working(Paper,(January(2007*

•  “Race”:  a  contestant  needs  to  accumulated  a  certain  number            of  wins  in  sub-­‐contests  (baHles)  in  order  to  win  the  contest  

       Examples:  Tennis,  R&D,  primary  elec4ons  

       Illustra4on:  need  to  win  2  baHles  to  win  contest  

 

Multi-battle contests

34  

(2,2)

•   •   •  (1,2)

•   •   •  

•   •  (2,1) (1,1)

player  1  wins  

player  2  wins  

•  “Elimina4on  tournament”:  the  field  of  contestants  is  reduced  (e.g.,  halved)  in  each  stage          Examples:  tennis  tournaments;  Jack  Welch  selec4on  of  his  successor  as  CEO  of  GE  

•  “Tug  of  War”:              need  a  certain  number  of  net  stage  successes  (#  wins  minus  #  losses)  to  win  the  contest  

•   •   •   •  •  •  •   0−1− −( 1)n−n n−( 1)n1.  .  .   .  .  .  

player  2  wins  player  1  wins   start  

•  “Discouragement  effect:”  e.g.,  the  fact  that  most  of  the  prize  is  dissipated  in  the  final  of  an  elimina4on  tournament  discourages  contestants  in  the  semi-­‐finals