Activity optimization games with complementarity
type: Item
instance of: scholarly article
title: Activity optimization games with complementarity
zbMATH Open document ID: 0623.90095
DOI: 10.1016/S0377-2217(87)80179-0
published in: European Journal of Operational Research
publication date: 1987-01-01T00:00:00Z
review text: A certain general class of cooperative games, namely the activity optimization games with complementarity, are investigated. It is shown that those games are convex, and consequently their cores are non-empty. Further results concern the properties of the optimal activity levels and some further game.
Mathematics Subject Classification ID: 91A12
Mathematics Subject Classification ID: 91A40
Mathematics Subject Classification ID: 91B66
zbMATH DE Number: 4012356
zbMATH Keywords: core
zbMATH Keywords: nonemptiness
zbMATH Keywords: convexity
zbMATH Keywords: activity optimization games with complementarity
reviewed by: Milan Mareš
MaRDI profile type: Publication
cites work: Notes—On a Selection Problem
cites work: Totally balanced games arising from controlled programming problems
cites work: Q5684698
cites work: Super-modularity: Applications to convex games and to the greedy algorithm for LP
cites work: Generalized Network Problems Yielding Totally Balanced Games
cites work: Q5545175
cites work: Cores of convex games
cites work: Q3707420
cites work: Minimizing a Submodular Function on a Lattice
cites work: Activity selection games and the minimum‐cut problem
author: Donald M. Topkis
description: scientific article; zbMATH DE number 4012356