Computational Social Choice Using Relation Algebra and RelView

We present an overview of the potential of relation algebra and the software tool RelView , based on it, to compute solutions for problems from social choice. Using one leading example throughout the text, we subsequently show how the RelView tool may be used to compute and visualize minimal winning coalitions, swingers of a given coalition, vulnerable winning coalitions, central players, dominant players, Banzhaf power indices of the different players, Hoede Bakker indices of the different players in a network, and finally stable coalitions/governments. Although problems from social choice and games are mostly exponential, due to the BDD implementation of RelView , computations are feasible for the examples which appear in practice.