On Dedekind's problem for complete simple games
From MaRDI portal
Publication:2376066
Abstract: 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 complete simple games with two types of voters. We will provide a shorter proof and an enumeration formula for complete simple games with two shift-minimal winning coalitions.
Recommendations
- On the complexity of problems on simple games
- Some open problems in simple games
- A complete folk theorem for finitely repeated games
- Dimension of complete simple games with minimum
- The Nakamura numbers for computable simple games
- On the complexity of succinct zero-sum games
- On the generalized dimension and codimension of simple games
- Equilibria problems on games: complexity versus succinctness
- Computability of simple games: A characterization and application to the core
- Simple games in Łukasiewicz calculus and their cores
Cites work
- A CLASS OF MAJORITY GAMES
- A fast algorithm for the maximum clique problem
- A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed
- A solution of Dedekind's problem on the number of isotone Boolean functions.
- Analytical representation of probabilities under the IAC condition
- Anonymous yes-no voting with abstention and multiple levels of approval
- Bounds for Owen's Multilinear Extension
- Complete simple games
- Complete voting systems with two classes of voters: weightedness and counting
- Computing the Continuous Discretely
- Different ways to represent weighted majority games
- Dimension of complete simple games with minimum
- Directed and weighted majority games
- Effective lattice point counting in rational convex polytopes
- Enumeration of Seven-Argument Threshold Functions
- Enumeration of Threshold Functions of Eight Variables
- scientific article; zbMATH DE number 2186872 (Why is no real title available?)
- scientific article; zbMATH DE number 1016362 (Why is no real title available?)
- scientific article; zbMATH DE number 1357433 (Why is no real title available?)
- scientific article; zbMATH DE number 3385535 (Why is no real title available?)
- Integer Programming with a Fixed Number of Variables
- Majority Decision Functions of up to Six Variables
- Methods OI geometry and probabilistic combinatorics in threshold logic
- Minimal winning coalitions in weighted-majority voting games
- Monotone Boolean functions
- Obtaining representations for probabilities of voting outcomes with effectively unlimited precision integer arithmetic
- On Ehrhart polynomials and probability calculations in voting theory
- On minimum integer representations of weighted games
- On the complexity of problems on simple games
- On the dimension of simple monotonic games
- On the existence of a minimum integer representation for weighted voting systems
- Polynômes arithmétiques et méthode des polyedres en combinatoire
- Probabilities of election outcomes with two parameters: the relative impact of unifying and polarizing candidates
- Probability calculations under the IAC hypothesis
- Short rational generating functions for lattice point problems
- The many aspects of counting lattice points in polytopes
- Threshold Logic Asymptotes
- Weighted games without a unique minimal representation in integers
Cited in
(21)- Daisies, Kayles, and the Sibert-Conway decomposition in misère octal games
- On the weak distributivity game
- On the characterization of weighted simple games
- A parameterization for a class of complete games with abstention
- On minimum sum representations for weighted voting games
- Enumerating and categorizing positive Boolean functions separable by a \(k\)-additive capacity
- A note on the growth of the dimension in complete simple games
- On the enumeration of bipartite simple games
- On the enumeration of Boolean functions with distinguished variables
- On minimum integer representations of weighted games
- On weights and quotas for weighted majority voting games
- The cost of getting local monotonicity
- Voting power in the EU council of ministers and fair decision making in distributive politics
- Enumeration of weighted games with minimum and an analysis of voting power for bipartite complete games with minimum
- Generating functions of weighted voting games, MacMahon's partition analysis, and Clifford algebras
- On the complexity of problems on simple games
- Enumeration of simple games with two equivalence classes of players
- On the enumeration of some inequivalent monotone Boolean functions
- All power structures are achievable in basic weighted games
- On the enumeration of resolute majority rules
- Forms of representation for simple games: sizes, conversions and equivalences
This page was built for publication: On Dedekind's problem for complete simple games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2376066)
