Now showing items 1-2 of 2

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

    Christian, Robin; Slinko, Arkadii; CONDER, Marston (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 order. These results provide ...
  • On Complexity of Lobbying in Multiple Referenda 

    Christian, Robin; Slinko, Arkadii; ROSAMOND, Frances; FELLOWS, Mike (Université de Montréal. Département de sciences économiques., 2006-10)
    In this paper we show that lobbying in conditions of “direct democracy” is virtually impossible, even in conditions of complete information about voters preferences, since it would require solving a very computationally hard problem. We use the apparatus ...