Back to Search Start Over

Consistent conjectures are optimal Cournot-Nash strategies in the meta-game.

Authors :
Kalashnikov, V. V.
Bulavsky, V. A.
Kalashnykova, N. I.
López-Ramos, F.
Source :
Optimization; 2017, Vol. 66 Issue 12, p2007-2024, 18p
Publication Year :
2017

Abstract

In this paper, we investigate the properties of consistent conjectural variations equilibrium developed for a single-commodity oligopoly. Although, in general, the consistent conjectures are distinct from those of Cournot-Nash, we establish the following remarkable fact. Define a meta-game as such where the players are the same agents as in the original oligopoly but now using the conjectures as their strategies. Then the consistent conjectures of the original oligopoly game provide for the Cournot-Nash optimal strategies in the meta-game. [ABSTRACT FROM AUTHOR]

Details

Language :
English
ISSN :
02331934
Volume :
66
Issue :
12
Database :
Complementary Index
Journal :
Optimization
Publication Type :
Academic Journal
Accession number :
125881212
Full Text :
https://doi.org/10.1080/02331934.2016.1238079