Spatial voting games, relation algebra and RelView

• We give relation-algebraic specifications of some important solution concepts of spatial voting games.
• We treat the uncovered set, the majority core, the Pareto set, the win set, and the loss set.
• The specifications can be directly executed by the ROBDD-based computer algebra system RelView.
• We visualize our approach via some concrete applications.

We present a relation-algebraic approach to spatial voting games. We give relation-algebraic specifications of some important solution concepts of spatial voting games, such as the uncovered set, the majority core, the Pareto set, the win set, and the loss set. These specifications are relation-algebraic expressions and can be evaluated with the help of the BDD-based tool RelView after a simple translation into the tool's programming language. To give an impression of the tool's possibilities, we present some concrete applications.