Advanced Search
MyIDEAS: Login

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

Contents:

Author Info

  • CHRISTIAN, Robin
  • CONDER, Marston
  • SLINKO, Arkadii
Registered author(s):

    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.

    Download Info

    If 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.
    File URL: http://hdl.handle.net/1866/2153
    Download Restriction: no

    Bibliographic Info

    Paper provided by Universite de Montreal, Departement de sciences economiques in its series Cahiers de recherche with number 2006-18.

    as in new window
    Length: 23 pages
    Date of creation: 2006
    Date of revision:
    Handle: RePEc:mtl:montde:2006-18

    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

    Related research

    Keywords: 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:

    References

    No references listed on IDEAS
    You can help add them by filling out this form.

    Citations

    Lists

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    Statistics

    Access and download statistics

    Corrections

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

    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.

    If references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link to it, you can help with 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 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.