To check this prediction, the efficiency of asking and passing to allow a tell were plotted for values of , and . At , agent 2 is expected not to use the tell act, and so agent 1 must seize the floor by asking. On the other hand, at , agent 2 is expected to use a tell act, and so agent 1 should decline the floor. These results are plotted in figure 5.10.
This demonstration provides a good illustration of the dry-land algorithm (see Section 3.4.7). The speaker uses the "propose" form of the ask act (for a definition, see Section 5.3). In response to the ask act, agent 2 must revise his beliefs so that the subject of the ask, tell, is efficient from agent 1's perspective. Therefore it searches the belief space from level 3 upwards, revising bel(have-eggs) at level 3 from 0.1 up to 0.94, and revising bel(have-fruit) a small amount from 0.6 to 0.56 at level 4. Since bel(have-eggs) is now so high at level 3, tell now becomes efficient for agent 2 as well.