Now showing items 1-1 of 1
Flippable Pairs and Subset Comparisons in Comparative Probability Orderings and Related Simple Games
(Université de Montréal. Département de sciences économiques., 2006-10)
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 ...