A necessary and sufficient condition for the convexity in oligopoly games

DOI10.1016/S0165-4896(98)00019-5zbMath0967.91005OpenAlexW2102667381MaRDI QIDQ1296504

Jingang Zhao

Publication date: 29 August 2001

Published in: Mathematical Social Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0165-4896(98)00019-5

zbMATH Keywords

supermodularityconvex gamesoligopoly industry

Mathematics Subject Classification ID

Cooperative games (91A12) Other game-theoretic models (91A40)

Related Items

Vertical integration with endogenous contract leadership: stability and fair profit allocation, Stackelberg Oligopoly TU-Games: Characterization and Nonemptiness of the Core, Convexity of Bertrand oligopoly TU-games with differentiated products, The \(\gamma \)-core in Cournot oligopoly TU-games with capacity constraints, Cooperative games on simplicial complexes, ON THE SUPERMODULARITY OF HOMOGENEOUS OLIGOPOLY GAMES, Convexity of oligopoly games without transferable technologies, (AVERAGE-) CONVEXITY OF COMMON POOL AND OLIGOPOLY TU-GAMES, Stability analysis of horizontal mergers in a market with asymmetric substitutability, COALITIONAL BELIEFS IN COURNOT OLIGOPOLY TU GAMES, The core in Bertrand oligopoly TU-games with transferable technologies, Oligopoly games with and without transferable technologies.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The \(\tau\)-value, the core and semiconvex games
• Solution concepts of \(k\)-convex \(n\)-person games
• Sequencing games
• Convex games without side payments
• Super-modularity: Applications to convex games and to the greedy algorithm for LP
• Submodular functions and optimization
• Population monotonic allocation schemes for cooperative games with transferable utility
• Extreme convex set functions with finite carrier: General theory
• The Shapley value and average convex games
• Cores of convex games
• The kernel and bargaining set for convex games
• On cost allocation in communication networks
• Odd Submodular Functions, Dilworth Functions and Discrete Convex Functions
• The Relationship Between Convex Games and Minimum Cost Spanning Tree Games: A Case for Permutationally Convex Games
• The Nucleolus of a Characteristic Function Game