A QOBDD-based Approach to Simple Games

Simple games are a commonly used model for the analysis of voting systems in which each participant can vote “yes” or “no” and where the outcome is “yes” or “no” as well. Quasi-reduced and ordered binary decision diagrams, or QOBDDs for short, are well-known as compact representations for subsets of powersets and Boolean functions. In this thesis, we use QOBDDs to represent simple games and to develop practically applicable algorithms to solve problems for simple games. We study properties of QOBDDs when they are used to represent simple games as well as the runtime behavior of our algorithms.



Use and reproduction:

No license. The provisions of the German Copyright Act (UrhG) apply.

Please note that individual components of the publication may be subject to other licensing or copyright conditions.


Citation style:
Could not load citation form.