In 1996 D. Felsenthal and M. Machover considered the following model. An assembly consisting of n voters exercises roll-call. All n! possible orders in which the voters may be called are assumed to be equiprobable. The votes of each voter are independent with expectation 0

The Nakamura number is an appropriate invariant of a simple game in order to study the existence of social equilibria and the possibility of cycles. For symmetric quota games its number can be obtained by an easy formula. For some subclasses of simple games the corresponding Nakamura number has...

Decisions in a shareholder meeting or a legislative committee are often modeled as a weighted game. Influence of a member is then measured by a power index. A large variety of different indices has been introduced in the literature. This paper analyzes how power indices differ with respect to...

Chapter 1. Introduction -- Part I. Social Choice -- Chapter 2. Building Bridges over the Great Divide -- Chapter 3. Social Unacceptability for Simple Voting Procedures -- Chapter 4. Probability of Majority Inversion with Three States and Interval Preferences -- Chapter 5. Strategic Voting and...

The study of the characterization of threshold functions within the class of switching functions is an important problem that goes back at least to the mid-20th century. Due to different motivations switching and threshold functions have been investigated in a variety of different mathematical...

This paper studies the complexity of computing a representation of a simple game as the intersection (union) of weighted majority games, as well as, the dimension or the codimension. We also present some examples with linear dimension and exponential codimension with respect to the number of players

This paper is a twofold contribution. First, it contributes to the problem of enumerating some classes of simple games and in particular provides the number of weighted games with minimum and the number of weighted games for the dual class as well. Second, we focus on the special case of...

We combine the parametric Barvinok algorithm with a generation algorithm for a finite list of suitably chosen discrete sub-cases on the enumeration of complete simple games, i.e. a special subclass of monotone Boolean functions. Recently, Freixas et al. have proven an enumeration formula for...