A game-theoretic approach to the binary stochastic choice problem

We provide an equivalence theorem for the binary stochastic choice problem, which may be thought of as an implicit characterization of binary choice probabilities which are consistent with a probability over linear orderings. In some cases this implicit characterization is very useful in derivation of explicit necessary conditions. In particular, we present a new set of conditions which generalizes both Cohen and Falmagne's and Fishburn's conditions.