Flippable Pairs and Subset Comparisons in Comparative Probability Orderings and Related Simple Games
AbstractWe 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 (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?c 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 regions in the corresponding hyperplane arrangement can have no more than 13 faces and that there are 20 regions with 13 faces. All the neighbours of the 20 comparative probability orders which correspond to those regions are representable. Finally we define a class of simple games with complete desirability relation for which its strong desirability relation is acyclic, and show that the flip relation carries all the information about these games. We show that for n = 6 these games are weighted majority games.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by Universite de Montreal, Departement de sciences economiques in its series Cahiers de recherche with number 2006-18.
Length: 23 pages
Date of creation: 2006
Date of revision:
Contact details of provider:
Postal: CP 6128, Succ. Centre-Ville, Montréal, Québec, H3C 3J7
Phone: (514) 343-6540
Fax: (514) 343-5831
Web page: http://www.sceco.umontreal.ca
More information through EDIRC
Additively reesentable linear orders; comrative obability; elicitation; subset comrisons; sime game; weighted majority game; desirability relation.;
This paper has been announced in the following NEP Reports:
- NEP-ALL-2006-12-09 (All new papers)
- NEP-DCM-2006-12-09 (Discrete Choice Models)
- NEP-GTH-2006-12-09 (Game Theory)
You can help add them by filling out this form.
reading list or among the top items on IDEAS.Access and download statisticsgeneral information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sharon BREWER).
If references are entirely missing, you can add them using this form.