A relation-algebraic approach to simple games
From MaRDI portal
Publication:631101
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
Cites work
- scientific article; zbMATH DE number 3929034 (Why is no real title available?)
- scientific article; zbMATH DE number 1953899 (Why is no real title available?)
- scientific article; zbMATH DE number 1470897 (Why is no real title available?)
- scientific article; zbMATH DE number 1555979 (Why is no real title available?)
- scientific article; zbMATH DE number 3106184 (Why is no real title available?)
- A new index of power for simple n-person games
- An axiomatization of the Banzhaf value
- An interdisciplinary approach to coalition formation
- Applying relation algebra and RelView to measures in a social network
- Applying relation algebra and RelView to solve problems on orders and lattices
- Applying relational algebra and REL VIEW to coalition formation
- Characterizations of the Deegan-Packel and Johnston power indices
- Coalition formation in simple games with dominant players
- Computing power indices: multilinear extensions and new characterizations
- Exact computation of minimum feedback vertex sets with relational algebra
- Faster algorithms for computing power indices in weighted voting games
- Mathematical Properties of the Banzhaf Power Index
- NP-completeness of some problems concerning voting games
- On connected coalitions in dominated simple games
- On the uniqueness of the Shapley value
- Power indices of simple games and vector-weighted majority games by means of binary decision diagrams
- Relational Methods in Computer Science
- Relational Methods in Computer Science
- Shapley-Shubik and Banzhaf indices revisited.
- Simple games and weighted games: A theoretical and computational viewpoint
- The complexity of computing the permanent
- Theory and Applications of Relational Structures as Knowledge Instruments
Cited in
(13)- Dynamic programming for computing power indices for weighted voting games with precoalitions
- Algebraic hyperstructures and social relations
- Computing and visualizing Banks sets of dominance relations using relation algebra and RelView
- Spatial voting games, relation algebra and RelView
- Computations on simple games using \texttt{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
- Implicit power indices for measuring indirect control in corporate structures
- Set-weighted games and their application to the cover problem
- scientific article; zbMATH DE number 7526435 (Why is no real title available?)
- Applying relational algebra and REL VIEW to coalition formation
- Monte Carlo methods for the Shapley-Shubik power index
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)
