Matroidal games
From MaRDI portal
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.
Recommendations
Cites work
Cited in
(7)- Multi-player matrix games
- The matroid cup game
- Preface: International conference on game theory and optimization, June 6--10, 2016, Indian Institute of Technology Madras, Chennai, India
- scientific article; zbMATH DE number 1187055 (Why is no real title available?)
- scientific article; zbMATH DE number 148968 (Why is no real title available?)
- Games on base matrices
- The -value for games on matroids.
This page was built for publication: Matroidal games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1076623)