### Table 6: Results for A(11 + c;; 4;; 5+c) - lexicographic search with and without seed.

2002

### Table 3: IQ results for Archimedean Polyhedra

"... In PAGE 8: ... Extreme cases are shown in Figures 4 and 5. In Table3 we can read that Snub Dodecahedron is the most spherical Archimedean Polyhedron. The fact that Standard Laplace produces non-planar faces in Truncated Cuboctahedron and Truncated Icosidodecahedron has a plausible explanation.... ..."

### Table 1: The eight choice functions. Note that f3 and f6 exhibit a cycle.

"... In PAGE 6: ... Without loss of generality, call those goods 1, 2, and 3. Then, apply the argument of Proposition 1, using the eight choice functions which prescribe behavior on the budget sets {1, 2}, {1, 3}, and {2, 3} as in Table1 , and which agree on all other budget sets. square 3.... ..."

### Table 2: Jointly and individually satisficing choices for the Pot-Luck Dinner.

"... In PAGE 9: ... With the interdependence function so defined and letting q =1, the jointly satisficing meals are as displayed in Table 2, each of which is good enough for the group, considered as a whole. The individually satisficing items, as obtained by computing the selectability and rejectability marginals, are also provided in Table2 to be soup, beef, and lemon cus- tard. Fortunately, this set of choices is also jointly satisficing without lowering the index of caution.... ..."

### Table 2 Tests of Revealed Preference Inequalities for the Utility and Random Choice Hypotheses

1997

"... In PAGE 15: ...A. Obsen apos;ed Violations of Revealed Preference Inequalities The second column of Table2 reports the number of inconsistencies with the inequalities, (A 3), that are equivalent to the utility hypothesis.ll Observe that data for 24 out of the 38 subjects contain no inconsistencies with these inequalities.... In PAGE 19: ... The frequencies \vith which this implementation of Becker apos;s (1962) random choice model produces one or more violations of the relevant revealed preference inequalities are reported in the BPower columns of Tables 2 and 5. First, consider the BPo\ver measure of the power of the test of the utility hypothesis reported in Table2 . For the 24 subjects with zero violations using actual data, the BPo\ver measure has an average value of 0.... In PAGE 20: ... Using this new definition of the random budget shares, oS;, the random quantities are determined according to the procedure explained with (15). The CPower measure of the power of the test of the utility hypothesis is reported in the fourth column of Table2 . For the 24 subjects with zero violations using~actual data, the CPower measure has an average value of 0.... In PAGE 21: ... The rank correlation between the observed violations and the CPower measure is 0.528, as reported in the last row of Table2 . This correlation is quite different from the -0.... In PAGE 23: ... Therefore, the choices made by the individuals in the J token ec~nomy are hig?ly consistent with all of the implications of the utility hypothesIs. In comparIson, the last row of Table2 reports a negative rank correlation between observed violations of the revealed preference inequalities and the probabilities of such violations implied by the random choice model (the BPower measure). Furthermore, the next-to-last row of Table 2 reveals that the random choice model implies far more than the observed number of violations of the revealed preference inequalities.... In PAGE 23: ... In comparIson, the last row of Table 2 reports a negative rank correlation between observed violations of the revealed preference inequalities and the probabilities of such violations implied by the random choice model (the BPower measure). Furthermore, the next-to-last row of Table2 reveals that the random choice model implies far more than the observed number of violations of the revealed preference inequalities. I conclude that the individuals apos; choices \vere more consistent with the utility maximisation model than with the random choice model.... ..."

Cited by 4

### Table 8-1: Choice Function Efficiencies

2003

"... In PAGE 7: ... Table8 -2: Communication Efficiencies 0.68 0.... In PAGE 7: ... Choice Function Efficiency is measured by the number of actions (states) removed per inquiry. Based on the same set of experimental domains described in Section 7, we get the statistics in Table8 -1. As we had expected, inquiry priority measured in terms of utilization (Utilization) is more efficient than in terms of number of actions (Load).... In PAGE 7: ... We define communication efficiency as the number of actions (states) removed per message sent. The communication efficiencies for different choice functions are shown in Table8 -2. Both tables show that action efficiencies are lower than state efficiencies.... ..."

Cited by 1

### Table 1. The choice of subagent.

"... In PAGE 7: ...129 Starting point of a cycle Random function Equal probability of loss and win Choice of subagent depending on previous losses or wins (Table 4) Subagent S1 Equal probability of choosing random function or one of the subagents Subagent S2 Subagent S3 Subagent S4 Figure 5. If the overall game is set to run one of the four subagents, the subagent is chosen according to the scheme of Table1 . This means, for example, that S1 is chosen if both the previous run and the one before that have been losses, incurred by either one of the four subagents or the random function of the computer.... ..."

### Table 1. Lexicographic ordering

"... In PAGE 3: ...n the decreasing frequency order of the items, i.e., the al- phabet are items in decreasing frequency order. The trans- formation is illustrated in Table1 . Lexicographic ordering can be used in various algorithms, we give an example of its use in an array based horizontal database setting, which is used in LCM.... ..."

### Table 1. Lexicographic ordering

"... In PAGE 3: ...n the decreasing frequency order of the items, i.e., the al- phabet are items in decreasing frequency order. The trans- formation is illustrated in Table1 . Lexicographic ordering can be used in various algorithms, we give an example of its use in an array based horizontal database setting, which is used in LCM.... ..."