Notice: Undefined index: HTTP_REFERER in /data01/virt7065/domeenid/ on line 13
Dynamic common-value contests

Dynamic common-value contests: equilibrium computation

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:
n = ()



X* = 0.95


t nt xi,t* xt* ui,t*
2 10 0.09025 0.9025 0.00475
1 1 0.0475 0.0475 0.0025