The paper provides two alternative completions of the Pareto ordering on finite dimensional compact sets. Applied to bargaining games they lead to the Pareto efficient boundary and to the Nash solution, respectively, as sets of maximal elements. In particular, the second of these complete preorderings is represented by the Nash product. This provides an interesting "straightforward interpretation" that the Nash product according to Osborne and Rubinstein (1994, p. 303) is lacking.