Table 1.

Summary of the average number of transplants performed (denoted by N) and the average cumulative utilities claimed (denoted by U_∞), by implementing a depth-k search tree-based allocation strategy on a simulated KPD program with one altruistic donor and 100 incompatible pairs. Edge utilities are generated from U(1, 1), U(10, 20), and U(10, 30); and edge probabilities are generated from U(0.1, 0.5). The summary is calculated over 3, 000 rounds of simulations, with 1, 000 simulations for each utility generating distribution. Note that for the choice U(1, 1), the claimed utility equals the number of completed transplants.

	ue = 1	ue ~ U(10, 20)		ue ~ U(10, 30)
depth-k	mean N	mean N	mean U∞	mean N	mean U∞
k = 1	3.16	3.18	55.99	3.18	80.22
k = 2	8.17	6.65	112.21	6.19	149.58
k = 3	8.70	7.87	128.93	7.63	176.78
k = 4	8.74	8.26	133.54	7.99	181.92
k = 5	8.89	8.41	134.45	8.29	185.43