On the use of binary decision diagrams for solving problems on simple games
From MaRDI portal
Publication:1926964
DOI10.1016/j.ejor.2012.04.015zbMath1253.91014OpenAlexW2084225608MaRDI QIDQ1926964
Stefan Bolus, Rudolf Berghammer
Publication date: 29 December 2012
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2012.04.015
binary decision diagramssimple gamesdesirability relationblocking coalitionkey playersshift-minimal winning coalition
Related Items (9)
Cooperation through social influence ⋮ Coalitional desirability and the equal division value ⋮ Augmenting measure sensitivity to detect essential, dispensable and highly incompatible features in mass customization ⋮ Implicit power indices for measuring indirect control in corporate structures ⋮ Dynamic programming for computing power indices for weighted voting games with precoalitions ⋮ Forms of representation for simple games: sizes, conversions and equivalences ⋮ Coalition structure generation: a survey ⋮ Unnamed Item ⋮ A symbolic shortest path algorithm for computing subgame-perfect Nash equilibria
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Power indices of simple games and vector-weighted majority games by means of binary decision diagrams
- On the complexity of core, kernel, and bargaining set
- A class of simple games
- Protectionism and blocking power indices
- Applying relational algebra and REL VIEW to coalition formation
- NP-completeness of some problems concerning voting games
- On threshold BDDs and the optimal variable ordering problem
- On the existence of a minimum integer representation for weighted voting systems
- Applying relation algebra and RelView to measures in a social network
- On connected coalitions in dominated simple games
- Coalition formation in simple games with dominant players
- Weighted voting, multicameral representation, and power
- A new index of power for simple n-person games
- Non-embeddable simple relation algebras
- Complete simple games
- The dimension for the European Union Council under the Nice rules.
- Easy weighted majority games
- Faster algorithms for computing power indices in weighted voting games
- On the computational complexity of weighted voting games
- An interdisciplinary approach to coalition formation
- The Treaty of Nice and qualified majority voting
- Sorting and Selection in Posets
- Computational Social Choice Using Relation Algebra and RelView
- The size of reduced OBDD's and optimal read-once branching programs for almost all Boolean functions
- Improving the variable ordering of OBDDs is NP-complete
- Branching Programs and Binary Decision Diagrams
- On the OBDD-representation of general Boolean functions
- Computer Algebra in Scientific Computing
This page was built for publication: On the use of binary decision diagrams for solving problems on simple games
