Matroidal games
type: Item
instance of: scholarly article
title: Matroidal games
zbMATH Open document ID: 0593.90090
DOI: 10.1007/BF01769274
author: B. George
published in: International Journal of Game Theory
publication date: 1986-01-01T00:00:00Z
review text: Matroidal games are simple games in which the set of losing coalitions fulfills the independence and monotonicity axioms of a matroid. It is shown in the paper that every non-trivial matroid represents a simple game but not vice versa. The combinatorial structure of the matroid games is investigated and described by means of the graph theoretical tools.
Mathematics Subject Classification ID: 91A12
Mathematics Subject Classification ID: 05B35
zbMATH DE Number: 3954685
zbMATH Keywords: simple games
zbMATH Keywords: matroid games
zbMATH Keywords: graph
MaRDI profile type: Publication
cites work: Q3050437
cites work: Modules of Coherent Binary Systems
cites work: A Set Theoretic Treatment of Coherent Systems
cites work: A Solution of the Shannon Switching Game
cites work: A note on factorization of simple games
cites work: Introduction to the theory of matroids
cites work: Q4111952
full work available at URL: https://doi.org/10.1007/bf01769274
OpenAlex ID: W4238620712
description: scientific article; zbMATH DE number 3954685