A relation-algebraic approach to simple games
type: Item
instance of: scholarly article
title: A relation-algebraic approach to simple games
zbMATH Open document ID: 1207.90064
author: Rudolf Berghammer
author: Stefan Bolus
author: Agnieszka Rusinowska
author: Harrie de Swart
published in: European Journal of Operational Research
publication date: 2011-03-22T00:00:00Z
Mathematics Subject Classification ID: 90B50
Mathematics Subject Classification ID: 68W30
Mathematics Subject Classification ID: 91A12
Mathematics Subject Classification ID: 91A46
Mathematics Subject Classification ID: 91A80
Mathematics Subject Classification ID: 91F10
zbMATH DE Number: 5869160
zbMATH Keywords: relation algebra
zbMATH Keywords: \texttt{RelView}
zbMATH Keywords: simple game
zbMATH Keywords: winning coalition
zbMATH Keywords: dominant player
zbMATH Keywords: central player
describes a project that uses: RelView
describes a project that uses: Rath
MaRDI profile type: Publication
full work available at URL: j.ejor.2010.09.006
OpenAlex ID: W3125880702
cites work: Computing power indices: multilinear extensions and new characterizations
cites work: Applying relation algebra and RelView to solve problems on orders and lattices
cites work: Q5480635
cites work: Q4415085
cites work: Relational Methods in Computer Science
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: Theory and Applications of Relational Structures as Knowledge Instruments
cites work: Power indices of simple games and vector-weighted majority games by means of binary decision diagrams
cites work: A new index of power for simple n-person games
cites work: On the uniqueness of the Shapley value
cites work: Mathematical Properties of the Banzhaf Power Index
cites work: On connected coalitions in dominated simple games
cites work: Q4488500
cites work: Simple games and weighted games: A theoretical and computational viewpoint
cites work: Q4525752
cites work: Faster algorithms for computing power indices in weighted voting games
cites work: Shapley-Shubik and Banzhaf indices revisited.
cites work: An axiomatization of the Banzhaf value
cites work: Characterizations of the Deegan-Packel and Johnston power indices
cites work: Q5844986
cites work: Coalition formation in simple games with dominant players
cites work: NP-completeness of some problems concerning voting games
cites work: Q3703918
cites work: The complexity of computing the permanent
DOI: 10.1016/J.EJOR.2010.09.006
Recommended article: Relation algebras by games
Recommended article: The basic algebra of game equivalences
Recommended article: Algebraic structure of games
Recommended article: A note on degrees of presentation of games as relational structures
Recommended article: Representation of game algebras
Recommended article: Q3509079
Recommended article: Computations on Simple Games Using RelView
Recommended article: Games in finite model theory
Recommended article: Fundamentals of simple games from a viewpoint of blockability relations
Recommended article: Computability of simple games: A characterization and application to the core
description: scientific article; zbMATH DE number 5869160