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 = (nT,...,n1), where nT is the number of players before the first announcement, nT-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: