Matroidal games

Abstract

The theory ofmatriods consists of generalization of basic notions of linear algebra likedependence, basis andspan. In this paper we point out that every non-trivial matroid represents a simple game though the converse need not be true. The class of simple games which possess the matroidal structure is designated asmatroidal games. In matroidal games, we have a generalization of the concept of complete exchangeability of players observed in purely size dependent games. Invoking the well developed theory of matroids, we study the combinatorial structure of matroidal games.