Activity optimization games with complementarity

DOI10.1016/S0377-2217(87)80179-0zbMath0623.90095MaRDI QIDQ1091957

No author found.

Publication date: 1987

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

convexitycorenonemptinessactivity optimization games with complementarity

Mathematics Subject Classification ID

Cooperative games (91A12) Multisectoral models in economics (91B66) Other game-theoretic models (91A40)

Related Items (2)

ON THE SUPERMODULARITY OF HOMOGENEOUS OLIGOPOLY GAMES ⋮ The bargaining set for almost-convex games

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Super-modularity: Applications to convex games and to the greedy algorithm for LP
• Cores of convex games
• Totally balanced games arising from controlled programming problems
• Generalized Network Problems Yielding Totally Balanced Games
• Minimizing a Submodular Function on a Lattice
• Activity selection games and the minimum‐cut problem
• Notes—On a Selection Problem

This page was built for publication: Activity optimization games with complementarity