Number of the records: 1

On computation of optimal strategies in oligopolistic markets respecting the cost of change

SYSNO ASEP	0531319
Document Type	J - Journal Article
R&D Document Type	Journal Article
Subsidiary J	Článek ve WOS
Title	On computation of optimal strategies in oligopolistic markets respecting the cost of change
Author(s)	Outrata, Jiří (UTIA-B)_{RID, ORCID} Valdman, Jan (UTIA-B)_{RID, ORCID}
Source Title	Mathematical Methods of Operations Research. - : Springer - ISSN 1432-2994 Roč. 92, č. 3 (2020), s. 489-509
Number of pages	21 s.
Publication form	Print - P
Language	eng - English
Country	DE - Germany
Keywords	Generalized equation ; Equilibrium ; Cost of Change
Subject RIV	BA - General Mathematics
OECD category	Pure mathematics
R&D Projects	GA17-08182S GA ČR - Czech Science Foundation (CSF)
	GA17-04301S GA ČR - Czech Science Foundation (CSF)
Method of publishing	Open access
Institutional support	UTIA-B - RVO:67985556
UT WOS	000551004500001
EID SCOPUS	85088297119
DOI	10.1007/s00186-020-00721-x
Annotation	The paper deals with a class of parameterized equilibrium problems, where the objectives of the players do possess nonsmooth terms. The respective Nash equilibria can be characterized via a parameter-dependent variational inequality of the second kind, whose Lipschitzian stability, under appropriate conditions, is established. This theory is then applied to evolution of an oligopolistic market in which the firms adapt their production strategies to changing input costs, while each change of the production is associated with some “costs of change”. We examine both the Cournot-Nash equilibria as well as the two-level case, when one firm decides to take over the role of the Leader (Stackelberg equilibrium). The impact of costs of change is illustrated by academic examples.
Workplace	Institute of Information Theory and Automation
Contact	Markéta Votavová, votavova@utia.cas.cz, Tel.: 266 052 201.
Year of Publishing	2021
Electronic address	https://link.springer.com/article/10.1007/s00186-020-00721-x

Number of the records: 1