Abstract
We show that every additively representable comparative probability order on n atoms is determined by at least n–1 binary subset comparisons. We show that there are many orders of this kind, not just the lexicographic order. These results provide answers to two questions of Fishburn et al. (Math. Oper. Res. 27:227–243, 2002). We also study the flip relation on the class of all comparative probability orders introduced by Maclagan. We generalise an important theorem of Fishburn, Pekeč and Reeds, by showing that in any minimal set of comparisons that determine a comparative probability order, all comparisons are flippable. By calculating the characteristics of the flip relation for n=6 we discover that the polytopes associated with the regions in the corresponding hyperplane arrangement can have no more than 13 facets and that there are 20 regions whose associated polytopes have 13 facets. All the neighbours of the 20 comparative probability orders which correspond to those regions are representable.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bosma, W., Cannon, J., Playoust, C.: The Magma algebra system I: the user language. J. Symb. Comput. 24, 235–265 (1997)
Christian, R., Slinko, A.: Answers to two questions of Fishburn on subset comparisons in comparative probability orderings. In: Proceedings of The 4th International Symposium on Imprecise Probabilities and Their Applications (ISIPTA 05), pp. 117–124. Pittsburg, Pensylvania (2005)
Christian, R., Conder, M., Slinko, A.: Flippable pairs and subset comparisons in comparative probability orderings and related simple games. The Centre for Interuniversity Research in Qualitative Economics (CIREQ), Cahier 15-2006. University of Montreal. http://www.cireq.umontreal.ca/publications/15-2006-cah.pdf (2006)
Conder, M., Slinko, A.: A counterexample to Fishburn’s conjecture on finite linear qualitative probability. J. Math. Psychol. 48, 425–431 (2004)
Fine, T., Gill, J.: The enumeration of comparative probability relations. Ann. Probab. 4: 667–673 (1976)
de Finetti, B.: Sul significato soggetivo della probabilità. Fundam. Math. 17, 298–329 (1931)
Fishburn, P.C.: Finite linear qualitative probability, J. Math. Psychol. 40, 64–77 (1996)
Fishburn, P.C.: Failure of cancellation conditions for additive linear orders. J. Comb. Des. 5, 353–365 (1997)
Fishburn, P.C., Pekeč A., Reeds, J.A.: Subset comparisons for additive linear orders. Math. Oper. Res. 27, 227–243 (2002)
Kraft, C.H., Pratt, J.W., Seidenberg, A.: Intuitive probability on finite sets. Ann. Math. Stat. 30, 408–419 (1959)
Maclagan, D.: Boolean term orders and the root system B n . Order 15, 279–295 (1999)
Orlik, P., Terao, H.: Arrangements of Hyperplanes. Springer, Berlin (1992)
Scott, D.: Measurement structures and inequalities. J. Math. Psychol. 1, 233–247 (1964)
Stanley, R.: An introduction to hyperplane arrangements. Lecture Notes for Graduate Students. MIT. http://www-math.mit.edu/~rstan/arrangements/arr.html (2004)
Author information
Authors and Affiliations
Corresponding author
Additional information
Research partially supported by the N.Z. Centres of Research Excellence Fund (grant UOA 201).
Rights and permissions
About this article
Cite this article
Christian, R., Conder, M. & Slinko, A. Flippable Pairs and Subset Comparisons in Comparative Probability Orderings. Order 24, 193–213 (2007). https://doi.org/10.1007/s11083-007-9068-y
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11083-007-9068-y
Keywords
- Comparative probability
- Flip relation
- Elicitation
- Subset comparisons
- Additively representable linear orders