PathGame: Crowdsourcing Time-Constrained Human Solutions for the Travelling Salesperson Problem

Table 1

Summary of models for the relationship of time and problem complexity.

Model summary			Parameters and fitness criteria
No.	Complexity	Functional form	RMSE	SSE	a	b	c
1	O(ln n)		11.6571	1.1065 × 10^6	5.092	0.7428	−4.436
2	O(n)		11.7223	1.1191 × 10^6	0.07247	15.67
3	O(n ln n)		11.7232	1.1191 × 10^6	0.007796	−237.3	3922
4	O(n^2)		11.7286	1.1201 × 10^6	2.844 × 10^−5	−23.45	1176
5	O(n^3 ln n)		11.7673	1.121 × 10^6	2.889 × 10^−8	13.3	275.5
6	O(n^2 ln n)		11.7332	1.1276 × 10^6	6.339 × 10^−6	−4.276	699.5
7	O(n^3)		11.7473	1.1237 × 10^6	6.791 × 10^−8	7.856	501.6