On Dedekind's problem for complete simple games (Q2376066): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Cliquer / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3124511819 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1001.3045 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short rational generating functions for lattice point problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the Continuous Discretely / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete simple games / rank
 
Normal rank
Property / cites work
 
Property / cites work: The many aspects of counting lattice points in polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective lattice point counting in rational convex polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the dimension of simple monotonic games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynômes arithmétiques et méthode des polyedres en combinatoire / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4338928 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal winning coalitions in weighted-majority voting games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Different ways to represent weighted majority games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for Owen's Multilinear Extension / rank
 
Normal rank
Property / cites work
 
Property / cites work: On minimum integer representations of weighted games / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the existence of a minimum integer representation for weighted voting systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted games without a unique minimal representation in integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete voting systems with two classes of voters: weightedness and counting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dimension of complete simple games with minimum / rank
 
Normal rank
Property / cites work
 
Property / cites work: Anonymous yes-no voting with abstention and multiple levels of approval / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of problems on simple games / rank
 
Normal rank
Property / cites work
 
Property / cites work: A CLASS OF MAJORITY GAMES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Obtaining representations for probabilities of voting outcomes with effectively unlimited precision integer arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilities of election outcomes with two parameters: the relative impact of unifying and polarizing candidates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analytical representation of probabilities under the IAC condition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3023991 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A solution of Dedekind's problem on the number of isotone Boolean functions. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotone Boolean functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Directed and weighted majority games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming with a Fixed Number of Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Ehrhart polynomials and probability calculations in voting theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5655273 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Majority Decision Functions of up to Six Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration of Threshold Functions of Eight Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4700639 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probability calculations under the IAC hypothesis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Threshold Logic Asymptotes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration of Seven-Argument Threshold Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Methods OI geometry and probabilistic combinatorics in threshold logic / rank
 
Normal rank

Latest revision as of 13:36, 6 July 2024

scientific article
Language Label Description Also known as
English
On Dedekind's problem for complete simple games
scientific article

    Statements

    On Dedekind's problem for complete simple games (English)
    0 references
    0 references
    0 references
    26 June 2013
    0 references
    Boolean functions
    0 references
    Dedekind's problem
    0 references
    voting theory
    0 references
    complete simple games
    0 references
    application of the parametric Barvinok algorithm
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers