Abstract
Between simple games and matroids there are certain connections. Edmonds showed that the core of a supermodular game (it is a simple game) is a polymatroid. The combinatorial structure of a simple game is not known in general. However for a matroidal simple game we can use cetain combinatorial results.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
K. G. Ramamurthy and T. Partasaraty, Matroidal Games, International Journal of Game Theory, Vol. 15, 1986.
Sagonti, E., On the Strong Monotonicy of Power Indices, Internatinal Journal of Game Theory, Vo1. 21, 1991.
Edmonds, J., Submodular Functions, Matroids and Certain Polyhedra, in Guy (Ed.), Combinatorical Structures and there Applications, 1971.
Aigner, M., Kombinatorik 2, Berlin-Heidelberg-New York, 1976.
Lawler, E.L., Combinatorical Optimization. Networks and Matroids, New York 1976.
Jeworrek, T. Zur Lösung von Optimierungsproblemen über den Durchschnitt von drei Matroiden, Dissertation A, TU Magdeburg 1988.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Stumpe, D. (1993). Some Remarks on Simple Games and Matroids. In: Karmann, A., Mosler, K., Schader, M., Uebe, G. (eds) Operations Research ’92. Physica, Heidelberg. https://doi.org/10.1007/978-3-662-12629-5_121
Download citation
DOI: https://doi.org/10.1007/978-3-662-12629-5_121
Publisher Name: Physica, Heidelberg
Print ISBN: 978-3-7908-0679-3
Online ISBN: 978-3-662-12629-5
eBook Packages: Springer Book Archive