On the use of binary decision diagrams for solving problems on simple games
type: Item
instance of: scholarly article
title: On the use of binary decision diagrams for solving problems on simple games
zbMATH Open document ID: 1253.91014
author: Rudolf Berghammer
author: Stefan Bolus
published in: European Journal of Operational Research
publication date: 2012-12-29T00:00:00Z
Mathematics Subject Classification ID: 91A12
Mathematics Subject Classification ID: 91B06
zbMATH DE Number: 6119531
zbMATH Keywords: binary decision diagrams
zbMATH Keywords: simple games
zbMATH Keywords: key players
zbMATH Keywords: desirability relation
zbMATH Keywords: blocking coalition
zbMATH Keywords: shift-minimal winning coalition
describes a project that uses: CUDD
describes a project that uses: RelView
describes a project that uses: azove
MaRDI profile type: Publication
full work available at URL: j.ejor.2012.04.015
OpenAlex ID: W2084225608
cites work: On threshold BDDs and the optimal variable ordering problem
cites work: Q4415085
cites work: Computer Algebra in Scientific Computing
cites work: Applying relational algebra and REL VIEW to coalition formation
cites work: An interdisciplinary approach to coalition formation
cites work: Applying relation algebra and RelView to measures in a social network
cites work: Improving the variable ordering of OBDDs is NP-complete
cites work: Power indices of simple games and vector-weighted majority games by means of binary decision diagrams
cites work: Protectionism and blocking power indices
cites work: Complete simple games
cites work: Easy weighted majority games
cites work: Sorting and Selection in Posets
cites work: A new index of power for simple n-person games
cites work: On connected coalitions in dominated simple games
cites work: On the computational complexity of weighted voting games
cites work: The Treaty of Nice and qualified majority voting
cites work: The dimension for the European Union Council under the Nice rules.
cites work: On the existence of a minimum integer representation for weighted voting systems
cites work: On the complexity of core, kernel, and bargaining set
cites work: A class of simple games
cites work: Faster algorithms for computing power indices in weighted voting games
cites work: On the OBDD-representation of general Boolean functions
cites work: Non-embeddable simple relation algebras
cites work: Q4538166
cites work: Q5844986
cites work: NP-completeness of some problems concerning voting games
cites work: Coalition formation in simple games with dominant players
cites work: Q3060335
cites work: Q4934627
cites work: Computational Social Choice Using Relation Algebra and RelView
cites work: Weighted voting, multicameral representation, and power
cites work: Q4764193
cites work: Q4700639
cites work: The size of reduced OBDD's and optimal read-once branching programs for almost all Boolean functions
cites work: Branching Programs and Binary Decision Diagrams
DOI: 10.1016/J.EJOR.2012.04.015
description: scientific article; zbMATH DE number 6119531