Dissertation (Metadata)
Title:A QOBDD-based Approach to Simple Games
 
Author:Stefan Bolus
 
URN:NBN:urn:nbn:de:gbv:8-diss-91142
 
Faculty:Faculty of Engineering
DDC:004 Computer science
 
Date of thesis defense:2012-06-28
 
Referent:Prof. Dr. Rudolf Berghammer
second reviewer(s) :Prof. Dr. Anand Srivastav
 
Description: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.
 
Keywords:simple game, binary decision diagram, weighted voting game, power index, Chow parameters, threshold function, positive Boolean function, homogeneous simple game, flat binary decision diagram, desirability relation on individuals, dual simple game, shift-minimal winning coalitions
 
Documents:
diss_bolus.pdf (1.219 kB)    generate ZIP   details >>