Notice: Undefined index: HTTP_REFERER in /data01/virt7065/domeenid/www.hinnosaar.net/toomas/procLogs/functions.inc.php 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.

Inputs

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

Results

Aggregate

X* = 0.99949

Individual

t nt xi,t* xt* ui,t*
11 1 0.492442 0.492442 0.000251
10 1 0.251248 0.251248 0.000128
9 1 0.127308 0.127308 6.5E-5
8 1 0.064218 0.064218 3.3E-5
7 1 0.032297 0.032297 1.6E-5
6 1 0.016212 0.016212 8.0E-6
5 1 0.008127 0.008127 4.0E-6
4 1 0.00407 0.00407 2.0E-6
3 1 0.002038 0.002038 1.0E-6
2 1 0.00102 0.00102 1.0E-6
1 1 0.00051 0.00051 0