 In the classical picture, player i’s preferences on a game tree are represented by a preference relation \(\prec_i\) ranging over the set of outcomes. Such a relation is usually assumed transitive and reflexive, but need not be total.