Forms of representation for simple games: sizes, conversions and equivalences
From MaRDI portal
(Redirected from Publication:898760)
Recommendations
Cites work
- scientific article; zbMATH DE number 3644821 (Why is no real title available?)
- scientific article; zbMATH DE number 5852793 (Why is no real title available?)
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 3821640 (Why is no real title available?)
- scientific article; zbMATH DE number 3906537 (Why is no real title available?)
- scientific article; zbMATH DE number 4012495 (Why is no real title available?)
- scientific article; zbMATH DE number 1766750 (Why is no real title available?)
- scientific article; zbMATH DE number 1357433 (Why is no real title available?)
- scientific article; zbMATH DE number 872005 (Why is no real title available?)
- scientific article; zbMATH DE number 3892978 (Why is no real title available?)
- scientific article; zbMATH DE number 3266648 (Why is no real title available?)
- scientific article; zbMATH DE number 3265496 (Why is no real title available?)
- scientific article; zbMATH DE number 3329024 (Why is no real title available?)
- scientific article; zbMATH DE number 3353170 (Why is no real title available?)
- scientific article; zbMATH DE number 3385535 (Why is no real title available?)
- scientific article; zbMATH DE number 3078999 (Why is no real title available?)
- scientific article; zbMATH DE number 3106184 (Why is no real title available?)
- A CLASS OF MAJORITY GAMES
- A Characterization of Weighted Voting
- A characterization, existence proof and dimension bounds for the kernel of a game
- A class of simple games
- A linear time algorithm for recognizing regular Boolean functions
- A logical calculus of the ideas immanent in nervous activity
- A minimum dimensional class of simple games
- A new index of power for simple n-person games
- An \(O(nm)\)-time algorithm for computing the dual of a regular Boolean function
- Binary Decision Diagrams
- Branching Programs and Binary Decision Diagrams
- Comparing power indices
- Complete simple games
- Computational Aspects of Cooperative Game Theory
- Computational aspects of monotone dualization: a brief survey
- Computing power indices in weighted multiple majority games.
- Cooperation through social influence
- Cost allocation in shortest path games
- Decisions by players of comparable strength
- Directed and weighted majority games
- Disjoint Products and Efficient Computation of Reliability
- Evaluation, Strength, and Relevance of Variables of Boolean Functions
- Graph-Based Algorithms for Boolean Function Manipulation
- Improving the variable ordering of OBDDs is NP-complete
- Lattice Theoretic Properties of Frontal Switching Functions
- Manipulating the quota in weighted voting games
- Modified branching programs and their computational power
- On Dedekind's problem for complete simple games
- On defining sets of vertices of the hypercube by linear inequalities
- On generating all maximal independent sets
- On minimum integer representations of weighted games
- On shortest path games
- On the Complexity of Dualization of Monotone Disjunctive Normal Forms
- On the complexity of branching programs and decision trees for clique functions
- On the complexity of exchanging
- On the complexity of problems on simple games
- On the complexity of the decisive problem in simple and weighted games
- On the computational complexity of weighted voting games
- On the dimension of simple monotonic games
- On the existence of a minimum integer representation for weighted voting systems
- On the use of binary decision diagrams for solving problems on simple games
- On threshold BDDs and the optimal variable ordering problem
- Polynomial-time algorithms for regular set-covering and threshold synthesis
- Power Indices in Spanning Connectivity Games
- Power indices of simple games and vector-weighted majority games by means of binary decision diagrams
- Preferences, Summation, and Social Welfare Functions
- Prisoners' Dilemama and Professional Sports Drafts
- Regular simple games
- Sharing rewards in cooperative connectivity games
- Size of ordered binary decision diagrams representing threshold functions
- Stability of two player game structures
- Star-shapedness of the kernel for homogeneous games
- The size of reduced OBDD's and optimal read-once branching programs for almost all Boolean functions
- Theory of majority decision elements
- Threshold graphs and related topics
- Threshold hypergraphs
- Totally Balanced Games and Games of Flow
- Weighted games without a unique minimal representation in integers
- Weighted voting, multicameral representation, and power
Cited in
(11)- Dynamic programming for computing power indices for weighted voting games with precoalitions
- Multidimension: a dimensionality extension of simple games
- On the use of binary decision diagrams for solving problems on simple games
- Enumeration of simple games with two equivalence classes of players
- Influence decision models: from cooperative game theory to social network analysis
- On the generalized dimension and codimension of simple games
- Social disruption games in signed networks
- On the complexity of exchanging
- Dimension and codimension of simple games
- scientific article; zbMATH DE number 44738 (Why is no real title available?)
- Coalitional desirability and the equal division value
This page was built for publication: Forms of representation for simple games: sizes, conversions and equivalences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q898760)
