Flippable pairs and subset comparisons in comparative probability orderings (Q2464735): Difference between revisions

The paper deals with algebraic and combinatorial properties of comparative probability on finite sets within decision theory and the theory of measurement. Motivated by the research initiated by \textit{P. C. Fishburn, A. Pekeč} and \textit{J. A. Reeds} in [Math. Oper. Res. 27, 227--243 (2002; Zbl 1082.06002)] the authors provide answers to two questions, related to the problem of preference elicitation, posed in that paper. They show that every additively representable comparative probability order on \(n\) atoms is determined by at least \(n-1\) binary subset comparisons and that there are many orders of this kind, not just the lexicographic order. The second part of the paper is devoted to the product of comparative orders, a construction outlined by \textit{D. MacLagan} in [Order 15, 279--295 (1998; Zbl 0932.05093)], and its applications. They solve Problem 3 posed in the cited paper by Fishburn et al. They close with a discussion of a related problem posed by MacLagan.