On solutions that are better than most

A programmatic approach to solving decision problems by the use of ‘better than most’ (BTM) solutions is introduced. The BTM approach is contrasted to approaches that seek a solution whose outcome would be the best of all outcomes for feasible solutions, again according to criteria taken to represent the decision maker's objectives. This BTM approach is illustrated in terms of a decision problem in binary decision variables. This is followed by a discussion of (1) some of the probabilistic aspects of BTM solutions, including calculational experience, (2) a central BTM problem, akin to the problem of finding optimal methods in the more traditional approaches, (3) some ad hoc methods for overcoming this and other problems associated with the BTM approach, and (4) similarities and differences between the BTM approach and other approaches.