Abstract
Interior operator games arose by abstracting some properties of several types of cooperative games (for instance: peer group games, big boss games, clan games and information market games). This reason allow us to focus on different problems in the same way. We introduced these games in Bilbao et al. (Ann. Oper. Res. 137:141–160, 2005) by a set system with structure of antimatroid, that determines the feasible coalitions, and a non-negative vector, that represents a payoff distribution over the players. These games, in general, are not convex games. The main goal of this paper is to study under which conditions an interior operator game verifies other convexity properties: 1-convexity, k-convexity (k≥2 ) or semiconvexity. But, we will study these properties over structures more general than antimatroids: the interior operator structures. In every case, several characterizations in terms of the gap function and the initial vector are obtained. We also find the family of interior operator structures (particularly antimatroids) where every interior operator game satisfies one of these properties.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Algaba, E., Bilbao, J. M., van den Brink, R., & Jiménez-Losada, A. (2004). Cooperative games on antimatroids. Discrete Mathematics, 282, 1–15.
Bilbao, J. M., Jiménez-Losada, A., Lebrón, E., & Chacón, C. (2005). Values for interior operator games. Annals of Operations Research, 137, 141–160.
Brânzei, R., Fragnelli, V., & Tijs, S. (2002). Tree-connected peer group situations and peer group games. Mathematical Methods of Operations Research, 55, 93–106.
Dilworth, R. P. (1940). Lattices with unique irreducible decompositions. Annals of Mathematics, 41, 771–777.
Driessen, T. S. H. (1988). Cooperative games. Solutions and applications. Dordrecht: Kluwer Academic.
Driessen, T. S. H. (1991). k-Convexity of big boss games and clan games. Methods of Operations Research, 64, 267–275.
Driessen, T. S. H. (1995). A bankruptcy problem and an information trading problem: applications to k-convex games. ZOR—Mathematical Methods and Models of Operations Research, 41, 313–324.
Gillies, D. B. (1953). Some theorems on n -person games. Ph.D. thesis, Princeton University Press, Princeton.
Gilles, R. P., Owen, G., & van den Brink, R. (1992). Games with permission structures: the conjunctive approach. International Journal of Game Theory, 20, 277–293.
Goecke, O., Korte, B., & Lovász, L. (1986). Examples and algorithmic properties of greedoids. In B. Simeone (Ed.), Combinatorial optimization. Berlin: Springer.
Jiménez-Losada, A. (1998). Valores para juegos sobre estructuras combinatorias. Ph.D. thesis, University of Seville, Spain.
Korte, B., Lóvasz, L., & Schrader, R. (1991). Greedoids. Berlin: Springer.
Muto, S., Potters, J., & Tijs, S. (1986). Information market games. International Journal of Game Theory, 18, 209–226.
Muto, S., Nakayama, M., Potters, J., & Tijs, S. (1987). On big boss games. Economic Studies Quarterly, 39, 303–321.
Tijs, S. (1981). Bounds for the core and the τ-value. In O. Moeschlin & D. Pallaschke (Eds.), Game theory and mathematical economics (pp. 123–132). Amsterdam: North-Holland.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Bilbao, J.M., Chacón, C., Jiménez-Losada, A. et al. Convexity properties for interior operator games. Ann Oper Res 158, 117–131 (2008). https://doi.org/10.1007/s10479-007-0244-7
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-007-0244-7