This page is a companion for the
paper "Dynamic common-value contests"
by Toomas Hinnosaar.
For the notation and the computation algorithm, please refer to the paper.
Download the Matlab code here.

The only relevant input is vector

**n**= (n_{T},...,n_{1}), where n_{T}is the number of players before the first announcement, n_{T-1}the number of players between the first and second, and so on. You only need to supply a comma-separated list of integers, the number T is computed from this:
X

^{*}= 0.95t | n_{t} |
x_{i,t}^{*} |
x_{t}^{*} |
u_{i,t}^{*} |
---|---|---|---|---|

2 | 10 | 0.09025 | 0.9025 | 0.00475 |

1 | 1 | 0.0475 | 0.0475 | 0.0025 |