A necessary and sufficient condition for the convexity in oligopoly games (Q1296504): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3254691 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution concepts of \(k\)-convex \(n\)-person games / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(\tau\)-value, the core and semiconvex games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5684698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodular functions and optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cost allocation in communication networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Relationship Between Convex Games and Minimum Cost Spanning Tree Games: A Case for Permutationally Convex Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Super-modularity: Applications to convex games and to the greedy algorithm for LP / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Shapley value and average convex games / rank
 
Normal rank
Property / cites work
 
Property / cites work: The kernel and bargaining set for convex games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993509 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Odd Submodular Functions, Dilworth Functions and Discrete Convex Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extreme convex set functions with finite carrier: General theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Nucleolus of a Characteristic Function Game / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5817870 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cores of convex games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex games without side payments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Population monotonic allocation schemes for cooperative games with transferable utility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4138513 / rank
 
Normal rank

Latest revision as of 21:24, 28 May 2024

scientific article
Language Label Description Also known as
English
A necessary and sufficient condition for the convexity in oligopoly games
scientific article

    Statements

    A necessary and sufficient condition for the convexity in oligopoly games (English)
    0 references
    0 references
    29 August 2001
    0 references
    The author establishes a necessary and sufficient condition for convexity (or supermodularity) in oligopoly games, based on the primitive parameters in an oligopoly industry. The result also makes a small contribution to the question ``how to split joint profits among firms engaged in a merger''. If the oligopoly game is convex then the Shapley value and the nucleolus are both perfect answers as they are both in the core.
    0 references
    0 references
    convex games
    0 references
    supermodularity
    0 references
    oligopoly industry
    0 references