On Dedekind's problem for complete simple games
From MaRDI portal
Publication:2376066
DOI10.1007/s00182-012-0327-9zbMath1267.91031arXiv1001.3045OpenAlexW3124511819MaRDI QIDQ2376066
Sascha Kurz, Nikolas Tautenhahn
Publication date: 26 June 2013
Published in: International Journal of Game Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1001.3045
voting theoryBoolean functionscomplete simple gamesDedekind's problemapplication of the parametric Barvinok algorithm
Related Items (16)
The cost of getting local monotonicity ⋮ On weights and quotas for weighted majority voting games ⋮ Forms of representation for simple games: sizes, conversions and equivalences ⋮ Enumeration of simple games with two equivalence classes of players ⋮ Voting power in the EU council of ministers and fair decision making in distributive politics ⋮ On the characterization of weighted simple games ⋮ On the enumeration of some inequivalent monotone Boolean functions ⋮ On minimum integer representations of weighted games ⋮ A parameterization for a class of complete games with abstention ⋮ Enumeration of weighted games with minimum and an analysis of voting power for bipartite complete games with minimum ⋮ 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 ⋮ Generating Functions of Weighted Voting Games, MacMahon’s Partition Analysis, and Clifford Algebras ⋮ On the enumeration of Boolean functions with distinguished variables
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Probabilities of election outcomes with two parameters: the relative impact of unifying and polarizing candidates
- On the existence of a minimum integer representation for weighted voting systems
- Anonymous yes-no voting with abstention and multiple levels of approval
- Polynômes arithmétiques et méthode des polyedres en combinatoire
- Complete simple games
- Different ways to represent weighted majority games
- A fast algorithm for the maximum clique problem
- Minimal winning coalitions in weighted-majority voting games
- Complete voting systems with two classes of voters: weightedness and counting
- Analytical representation of probabilities under the IAC condition
- On Ehrhart polynomials and probability calculations in voting theory
- On minimum integer representations of weighted games
- Probability calculations under the IAC hypothesis
- Dimension of complete simple games with minimum
- The many aspects of counting lattice points in polytopes
- Obtaining representations for probabilities of voting outcomes with effectively unlimited precision integer arithmetic
- On the dimension of simple monotonic games
- Effective lattice point counting in rational convex polytopes
- Integer Programming with a Fixed Number of Variables
- A CLASS OF MAJORITY GAMES
- Majority Decision Functions of up to Six Variables
- Computing the Continuous Discretely
- Weighted games without a unique minimal representation in integers
- A solution of Dedekind's problem on the number of isotone Boolean functions.
- Methods OI geometry and probabilistic combinatorics in threshold logic
- Short rational generating functions for lattice point problems
- A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed
- Monotone Boolean functions
- Directed and weighted majority games
- On the complexity of problems on simple games
- Bounds for Owen's Multilinear Extension
- Enumeration of Seven-Argument Threshold Functions
- Threshold Logic Asymptotes
- Enumeration of Threshold Functions of Eight Variables
This page was built for publication: On Dedekind's problem for complete simple games
