Table 2.
Simulation results assessing rearrangement ambiguity and cost
| exp. | r ( H ) | u r ( G ) | r l ( G ) | r u ( G ) | r ( H r m i n ) | r ( H r m a x ) |
|---|---|---|---|---|---|---|
| 1 |
2 |
12 |
2 |
10 |
2 |
9 |
| 2 |
2 |
20 |
2 |
14 |
2 |
14 |
| 3 |
2 |
20 |
2 |
14 |
2 |
12 |
| 4 |
2 |
20 |
2 |
14 |
2 |
14 |
| 5 |
2 |
18 |
1 |
13 |
1 |
11 |
| 6 |
2 |
8 |
2 |
7 |
2 |
6 |
| 7 |
2 |
8 |
0 |
7 |
0 |
4 |
| 8 |
2 |
18 |
1 |
13 |
2 |
10 |
| 9 |
2 |
10 |
1 |
7 |
1 |
7 |
| 10 |
2 |
14 |
0 |
11 |
0 |
8 |
| 11 |
2 |
6 |
0 |
6 |
0 |
4 |
| 12 |
2 |
6 |
1 |
7 |
1 |
4 |
| 13 |
2 |
16 |
0 |
12 |
0 |
9 |
| 14 |
2 |
20 |
2 |
14 |
4 |
12 |
| 15 |
2 |
20 |
1 |
14 |
1 |
10 |
| 16 |
2 |
6 |
0 |
5 |
0 |
5 |
| 17 |
1 |
26 |
1 |
17 |
1 |
13 |
| 18 |
2 |
18 |
1 |
13 |
1 |
11 |
| 19 |
2 |
6 |
0 |
6 |
0 |
5 |
| 20 | 2 | 4 | 2 | 5 | 2 | 2 |
Each row represents a separate initial history. The cost r(H) is the rearrangement cost of the simple history from which G is derived. Also given are the ambiguity u r (G), lower r l (G), and upper r u (G) rearrangement cost bounds for G. The minimum and maximum rearrangement costs of G-bounded AVG extensions found by sampling are denoted r(H r m i n ) and r(H r m a x ), resp.