A relation-algebraic approach to simple games
DOI10.1016/J.EJOR.2010.09.006zbMATH Open1207.90064OpenAlexW3125880702MaRDI QIDQ631101FDOQ631101
Authors: Rudolf Berghammer, Stefan Bolus, Agnieszka Rusinowska, Harrie de Swart 
Publication date: 22 March 2011
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2010.09.006
Recommendations
- Relation algebras by games
- The basic algebra of game equivalences
- Algebraic structure of games
- A note on degrees of presentation of games as relational structures
- Representation of game algebras
- Games in algebraic logic: axiomatisations and beyond
- Computations on simple games using \texttt{RelView}
- Games in finite model theory
- Fundamentals of simple games from a viewpoint of blockability relations
- Computability of simple games: A characterization and application to the core
History, political science (91F10) Management decision making, including multiple objectives (90B50) Symbolic computation and algebraic computation (68W30) Cooperative games (91A12) Applications of game theory (91A80) Combinatorial games (91A46)
Cites Work
- Theory and Applications of Relational Structures as Knowledge Instruments
- Title not available (Why is that?)
- The complexity of computing the permanent
- Simple games and weighted games: A theoretical and computational viewpoint
- Relational Methods in Computer Science
- On the uniqueness of the Shapley value
- An axiomatization of the Banzhaf value
- Mathematical Properties of the Banzhaf Power Index
- Title not available (Why is that?)
- Title not available (Why is that?)
- A new index of power for simple n-person games
- Applying relation algebra and RelView to measures in a social network
- Power indices of simple games and vector-weighted majority games by means of binary decision diagrams
- Exact computation of minimum feedback vertex sets with relational algebra
- Applying relational algebra and REL VIEW to coalition formation
- Applying relation algebra and RelView to solve problems on orders and lattices
- An interdisciplinary approach to coalition formation
- Title not available (Why is that?)
- Shapley-Shubik and Banzhaf indices revisited.
- NP-completeness of some problems concerning voting games
- Characterizations of the Deegan-Packel and Johnston power indices
- Faster algorithms for computing power indices in weighted voting games
- Title not available (Why is that?)
- On connected coalitions in dominated simple games
- Coalition formation in simple games with dominant players
- Computing power indices: multilinear extensions and new characterizations
- Relational Methods in Computer Science
Cited In (12)
- Spatial voting games, relation algebra and RelView
- Computations on simple games using \texttt{RelView}
- Computing and visualizing Banks sets of dominance relations using relation algebra and RelView
- Column-Wise Extendible Vector Expressions and the Relational Computation of Sets of Sets
- An algebraic account of references in game semantics
- Applying relation algebra and RelView to measures in a social network
- Dynamic programming for computing power indices for weighted voting games with precoalitions
- Set-weighted games and their application to the cover problem
- Title not available (Why is that?)
- Implicit power indices for measuring indirect control in corporate structures
- Monte Carlo methods for the Shapley-Shubik power index
- Applying relational algebra and REL VIEW to coalition formation
Uses Software
This page was built for publication: A relation-algebraic approach to simple games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q631101)
