Computations on Simple Games using REL VIEW

Simple games are a powerful tool to analyze decision-making and coalition formation in social and political life. In this paper we present relational models of simple games and develop relational algo- rithms for solving some game-theoretic basic problems. The algorithms immediately can be transformed into the language of the Computer Al- gebra system RelView and, therefore, the system can be used to solve the problems and to visualize the results of the computations. As an example, we consider the German parliament after the 2009 election.