Computations on simple games using RelView

Authors:
Rudolf Berghammer;Agnieszka Rusinowska;Harrie De Swart
Affiliations:
Institut für Informatik, Universität Kiel, Kiel, Germany;Centre d'Economie de la Sorbonne, CNRS, Université Paris I, Paris, France;Department of Philosophy, Tilburg University, Tilburg, The Netherlands
Venue:
CASC'11 Proceedings of the 13th international conference on Computer algebra in scientific computing
Year:
2011

Citing 4
Cited 0

NP-completeness of some problems concerning voting games

International Journal of Game Theory
Computing and Visualizing Closure Objects Using Relation Algebra and RelView

CASC '09 Proceedings of the 11th International Workshop on Computer Algebra in Scientific Computing
On the computational complexity of weighted voting games

Annals of Mathematics and Artificial Intelligence
RelView: an OBDD-based computer algebra system for relations

CASC'05 Proceedings of the 8th international conference on Computer Algebra in Scientific Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 algorithms for solving some game-theoretic basic problems. The algorithms immediately can be transformed into the language of the Computer Algebra system RELVIEW and, therefore, the system can be used to solve the problems and to visualize the results of the computations.