Abstract
The theory ofmatriods consists of generalization of basic notions oflinear 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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aigner M (1979) Combinatorial theory. Springer, Heidelberg
Birnbaum ZW, Esary JD (1965) Modules of coherent binary systems. Journal of the Society for Industrial and Applied Mathematics 13:444–462
Butterworth RW (1972) A set theoretic treatment of coherent systems. SIAM J Appl Math 22: 590–598
Korte B (1982) Modern applied mathematics-optimization and operations research. North-Holland
Lehman A (1964) A solution of the shannon switching game. Journal of the Society for Industrial and Applied Mathematics 12:684–725
Murty USR (1971) On the number of basis of a matroid. Proc. Second. Lousianna Conf. on Combinatorics, Lousiana State. Univ., Baton Rouge
Ramamurthy KG, Parthasarathy T (1983) A note on factorization of simple games. OPSEARCH 20:170–174
von Randow R (1975) Introduction to the theory of matroids. Springer, Heidelberg
Welsh DJA (1976) Matroid theory. Academic Press
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Ramamurthy, K.G., Parthasarathy, T. Matroidal games. Int J Game Theory 15, 21–29 (1986). https://doi.org/10.1007/BF01769274
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01769274