Related papers: Switching-Algebraic Calculation of Banzhaf Voting …
In many applications of cooperative game theory -- from corporate governance and cartel formation to parliamentary voting -- not all winning coalitions are feasible. Ideological distances, institutional constraints, or pre-electoral…
Given a system where the real-valued states of the agents are aggregated by a function to a real-valued state of the entire system, we are interested in the influence or importance of the different agents for that function. This generalizes…
An algorithm for computing the nonlinearity of a Boolean function from its algebraic normal form (ANF) is proposed. By generalizing the expression of the weight of a Boolean function in terms of its ANF coefficients, a formulation of the…
Several power indices have been introduced in the literature in order to measure the influence of individual committee members on the aggregated decision. Here we ask the inverse question and aim to design voting rules for a committee such…
Here we consider an approach for fast computing the algebraic degree of Boolean functions. It combines fast computing the ANF (known as ANF transform) and thereafter the algebraic degree by using the weight-lexicographic order (WLO) of the…
In this paper new algorithm for calculating power indices is described. The complexity class of the problem is #P-complete and even calculating power index of the biggest player is NP-hard task. Constructed algorithm is a mix of ideas of…
The M{\"o}bius transform is a crucial transformation into the Boolean world; it allows to change the Boolean representation between the True Table and Algebraic Normal Form. In this work, we introduce a new algebraic point of view of this…
Boolean calculus has been studied extensively in the past in the context of switching circuits, error-correcting codes etc. This work generalizes several approaches to defining a differential calculus for Boolean functions. A unified theory…
We investigate a class of weighted voting games for which weights are randomly distributed over the standard probability simplex. We provide close-formed formulae for the expectation and density of the distribution of weight of the $k$-th…
Feature attribution methods have become essential for explaining machine learning models. Many popular approaches, such as SHAP and Banzhaf values, are grounded in power indices from cooperative game theory, which measure the contribution…
Among two-candidate elections that treat the candidates symmetrically and never result in a tie, which voting rules are fair? A natural requirement is that each voter exerts an equal influence over the outcome, i.e., is equally likely to…
Boolean functions and binary sequences are main tools used in cryptography. In this work, we introduce a new bijection between the set of Boolean functions and the set of binary sequences with period a power of two. We establish a…
This paper examines an area of Game Theory called Voting Power Theory. With the adoption of a measure theoretic framework it argues that the many different indices and tools currently used for measuring voting power can be replaced by just…
In this note, we go further on the "basis exchange" idea presented in \cite{LiNa1} by using Mobious inversion. We show that the matrix $S_1(f)S_0(f)^{-1}$ has a nice form when $f$ is chosen to be the majority function, where $S_1(f)$ is the…
SHapley Additive exPlanations (SHAP) is a key tool for interpreting decision tree ensembles by assigning contribution values to features. It is widely used in finance, advertising, medicine, and other domains. Two main approaches to SHAP…
We consider the problem of selecting an $n$-member committee made up of one of $m$ candidates from each of $n$ distinct departments. Using an algebraic approach, we analyze positional voting procedures, including the Borda count, as…
A vector-valued version of the Girsanov theorem is presented, for a scalar process with respect to a Banach-valued measure. Previously, a short discussion about the Birkhoff-type integration is outlined, as for example integration by…
The algebraic degree of Boolean functions (or vectorial Boolean functions) is an important cryptographic parameter that should be computed by fast algorithms. They work in two main ways: (1) by computing the algebraic normal form and then…
Voting power determines the "power" of individuals who cast votes; their power is based on their ability to influence the winning-ness of a coalition. Usually each individual acts alone, casting either all or none of their votes and is…
Weighted voting games apply to a wide variety of multi-agent settings. They enable the formalization of power indices which quantify the coalitional power of players. We take a novel approach to the study of the power of big vs.~small…