2 papers
math.CO2014
Classes of Complete Simple Games that are All Weighted
Sascha Kurz, Nikolas Tautenhahn
Important decisions are likely made by groups of agents. Thus group decision making is very common in practice. Very transparent group aggregating rules are given by weighted votin…
math.CO2010
On Dedekind's problem for complete simple games
Sascha Kurz, Nikolas Tautenhahn
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…