A "dispersion" specifies the relative probability between any two elements of a finite domain. It thereby partitions the domain into equivalence classes separated by infinite relative probability. The paper's novelty is to numerically represent not only the order of the equivalence classes, but...

The nodes of an extensive-form game are commonly specified as sequences of actions. Rubinstein calls such nodes histories. We find that this sequential notation is superfl uous in the sense that nodes can also be specified as sets of actions. The only cost of doing so is to rule out games with...

In a discounted expected-utility problem, tomorrow's utilities are aggregated across tomorrow's states by the expectation operator. In our problems, this aggregation is accomplished by a Choquet integral of the form iudP a, where a specifies uncertainty aversion. We solve all finite-state...

Not available.