On the enumeration of bipartite simple games

DOI10.1016/j.dam.2021.03.011zbMath1476.91028OpenAlexW3147466861MaRDI QIDQ2022519

Dani Samaniego, Josep Freixas

Publication date: 29 April 2021

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2021.03.011

zbMATH Keywords

classification of bipartite simple games and bipartite Boolean functionsDedekind numbers and simple gamesenumeration of bipartite simple games and bipartite Boolean functionsenumeration of the bicameral meet and bicameral join voting systemsinequivalent monotonic Boolean functions

Mathematics Subject Classification ID

Games involving topology, set theory, or logic (91A44) Voting theory (91B12)

Related Items (4)

Weighted scoring committees ⋮ Enumeration of simple games with two equivalence classes of players ⋮ On the enumeration of some inequivalent monotone Boolean functions ⋮ On the enumeration of Boolean functions with distinguished variables

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Enumeration of weighted games with minimum and an analysis of voting power for bipartite complete games with minimum
• Power indices of simple games and vector-weighted majority games by means of binary decision diagrams
• A decisiveness index for simple games
• Enumerating Boolean functions of cryptographic significance
• On the existence of a minimum integer representation for weighted voting systems
• Simple games and weighted games: A theoretical and computational viewpoint
• The desirability relation of simple games
• Regular simple games
• Weighted voting, multicameral representation, and power
• Complete simple games
• The bicameral postulates and indices of a priori voting power
• Optimal allocation of multi-state elements in linear consecutively connected systems with vulnerable nodes.
• On the characterization of weighted simple games
• On minimum sum representations for weighted voting games
• Complete voting systems with two classes of voters: weightedness and counting
• The golden number and Fibonacci sequences in the design of voting structures
• On the structure of minimal winning coalitions in simple voting games
• Any 2-asummable bipartite function is weighted threshold
• Weighted committee games
• On Dedekind's problem for complete simple games
• Distance-based and ad hoc consensus models in ordinal preference ranking
• A characterization, existence proof and dimension bounds for the kernel of a game
• Theory of majority decision elements
• A CLASS OF MAJORITY GAMES
• Weighted games without a unique minimal representation in integers
• Approximations of pseudo-Boolean functions; applications to game theory
• Stochastic Models in Reliability
• Enumeration of Threshold Functions of Eight Variables
• Threshold Numbers and Threshold Completions

This page was built for publication: On the enumeration of bipartite simple games