A necessary and sufficient condition for the convexity in oligopoly games (Q1296504)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1319700
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A necessary and sufficient condition for the convexity in oligopoly games |
scientific article; zbMATH DE number 1319700 |
Statements
A necessary and sufficient condition for the convexity in oligopoly games (English)
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
convex games
0 references
supermodularity
0 references
oligopoly industry
0 references
0 references
0 references
0.8510355353355408
0 references
0.8044317960739136
0 references
0.8017584085464478
0 references
0.7885311841964722
0 references
0.7824501395225525
0 references
