IDEAS home Printed from https://ideas.repec.org/p/mtl/montde/2006-18.html
   My bibliography  Save this paper

Flippable Pairs and Subset Comparisons in Comparative Probability Orderings and Related Simple Games

Author

Listed:
  • CHRISTIAN, Robin
  • CONDER, Marston
  • SLINKO, Arkadii

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 (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.

Suggested Citation

  • CHRISTIAN, Robin & CONDER, Marston & SLINKO, Arkadii, 2006. "Flippable Pairs and Subset Comparisons in Comparative Probability Orderings and Related Simple Games," Cahiers de recherche 2006-18, Universite de Montreal, Departement de sciences economiques.
  • Handle: RePEc:mtl:montde:2006-18
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/1866/2153
    Download Restriction: no

    More about this item

    Keywords

    Additively reesentable linear orders; comrative obability; elicitation; subset comrisons; sime game; weighted majority game; desirability relation.;

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:mtl:montde:2006-18. See general 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) or (Joanne Lustig). General contact details of provider: http://edirc.repec.org/data/demtlca.html .

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.