On Dedekind's problem for complete simple games

Details On Dedekind's problem for complete simple games On Dedekind's problem for complete simple games

2010-01-18

arxiv.org/abs/1001.3045v1

Mathematics

Combinatorics

13 pages, 1 figure, 6 tables, submitted to ISSAC 2010

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

On Dedekind's problem for complete simple games does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On Dedekind's problem for complete simple games, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Dedekind's problem for complete simple games will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-661232