This paper investigates ultrafilters in the context of connectivity systems, defined as pairs
$(X, f) $ where $ X $ is a finite set and $ f $ is a symmetric submodular function. Ultrafilters …

A basic problem in the theory of simple games and other fields is to study whether a simple
game (Boolean function) is weighted (linearly separable). A second related problem …

This paper has a twofold scope. The first one is to clarify and put in evidence the isomorphic
character of two theories developed in quite different fields: on one side, threshold logic, on …

We investigate voting systems with two classes of voters, for which there is a hierarchy
giving each member of the stronger class more influence or important than each member of …

Some distinguished types of voters, as vetoes, passers or nulls, as well as some others, play
a significant role in voting systems because they are either the most powerful or the least …

Simple games cover voting systems in which a single alternative, such as a bill or an
amendment, is pitted against the status quo. A simple game or a yes-no voting system is a …

Simple games are a powerful tool to analyze decision-making and coalition formation in
social and political life. In this paper, we present relation-algebraic models of simple games …

We consider a sender who wishes to persuade multiple receivers to vote in favor of a
proposal and sends them private correlated messages that are conditional on the true state …

This paper provides a classification of all monotonic bipartite simple games. The problem we
deal with is very versatile since simple games are inequivalent monotonic Boolean …

In this paper we give necessary and sufficient conditions for a simple game to have rough
weights. We define two functions f (n) and g (n) that measure the deviation of a simple game …