Download This Paper Open PDF in Browser

Classes of Complete Simple Games that are All Weighted

14 Pages Posted: 7 Jan 2014  

Sascha Kurz

University of Bayreuth

Nikolas Tautenhahn

University of Bayreuth

Date Written: January 7, 2014


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 voting, where each agent is assigned a weight. Here a proposal is accepted if the sum of the weights of the supporting agents meets or exceeds a given quota. We study a more general class of binary voting systems -- complete simple games -- and propose an algorithm to determine which sub classes, parameterized by the agent's type composition, are weighted.

Keywords: Complete Simple Games, Weighted Games, Voting, Group Decision Making

JEL Classification: C71

Suggested Citation

Kurz, Sascha and Tautenhahn, Nikolas, Classes of Complete Simple Games that are All Weighted (January 7, 2014). Available at SSRN: or

Sascha Kurz (Contact Author)

University of Bayreuth ( email )

Universit├Ątsstr. 30
Lehrstuhl f├╝r Wirtschaftsmathematik
Bayreuth, Bavaria D-95440
+49 921 55 7353 (Phone)
+49 921 55 7352 (Fax)


Nikolas Tautenhahn

University of Bayreuth ( email )

Universitatsstr 30
Bayreuth, D-95447

Paper statistics

Abstract Views