Dynamic Oligopolies with Time Delays (Hardcover, 1st ed. 2018)

This is the first book to comprehensively examine the asymptotic behavior of dynamic monopolies, duopolies, and oligopolies where firms face information and implementation delays. It considers discrete and continuous timescales, continuously distributed delays, as well as single and multiple delays. It also discusses models with linear and hyperbolic price functions in three types of oligopolies: Cournot competition with quantity-adjusting firms, Bertrand competition with price-adjusting firms, and mixed oligopolies with both types of firms. In addition to the traditional Cournot-Nash equilibria, it introduces cases of partial cooperation are also introduced, leading to the analysis of cartelizing groups of firms and possible governmental actions against antitrust behavior. Further, the book investigates special processes for firms learning about the uncertain price function based on repeated market information. It addresses asymptotic properties of the associated dynamic systems, derives stability conditions, identifies stability switching curves, and presents in global analyses of cases of instability. The book includes both theoretical results and computer studies to illustrate and verify the theoretical findings.

General

Imprint:	Springer Verlag, Singapore
Country of origin:	Singapore
Release date:	November 2018
First published:	2018
Authors:	Akio Matsumoto • Ferenc Szidarovszky
Dimensions:	235 x 155mm (L x W)
Format:	Hardcover
Pages:	266
Edition:	1st ed. 2018
ISBN-13:	978-981-13-1785-9
Categories:	Books > Business & Economics > Economics > Economic theory & philosophy Books > Science & Mathematics > Mathematics > Optimization > Game theory
LSN:	981-13-1785-2
Barcode:	9789811317859

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!