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.
spatial voting game relation algebra uncovered set majority core pareto set relview relview beating relation covering relation