Next Article in Journal
Chaotic Path-Planning Algorithm Based on Courbage–Nekorkin Artificial Neuron Model
Next Article in Special Issue
On a Family of Hamilton–Poisson Jerk Systems
Previous Article in Journal
Dirac Geometric Approach for the Unimodular Holst Action
Previous Article in Special Issue
On the Analytical Solution of the SIRV-Model for the Temporal Evolution of Epidemics for General Time-Dependent Recovery, Infection and Vaccination Rates
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Dynamic Cooperative Oligopolies

by
Ferenc Szidarovszky
1,* and
Akio Matsumoto
2
1
Department of Mathematics, Corvinus University, Fövám tér 8, 1093 Budapest, Hungary
2
Department of Economics, Chuo University, 742-1, Higashi-Nakano, Hachioji 192-0393, Japan
*
Author to whom correspondence should be addressed.
Mathematics 2024, 12(6), 891; https://doi.org/10.3390/math12060891
Submission received: 13 February 2024 / Revised: 5 March 2024 / Accepted: 8 March 2024 / Published: 18 March 2024

Abstract

:
An n-person cooperative oligopoly is considered without product differentiation. It is assumed that the firms know the unit price function but have no access to the cost functions of the competitors. From market data, they have information about the industry output. The firms want to find the output levels that guarantee maximum industry profit. First, the existence of a unique maximizer is proven, which the firms cannot determine directly because of the lack of the knowledge of the cost functions. Instead, a dynamic model is constructed, which is asymptotically stable under realistic conditions, and the state trajectories converge to the optimum output levels of the firms. Three models are constructed: first, no time delay is assumed; second, information delay is considered for the firms on the industry output; and third, in addition, information delay is also assumed about the firms’ own output levels. The stability of the resulting no-delay, one-delay, and two-delay dynamics is examined.

1. Introduction

Based on the pioneering work of Cournot A. [1], an intensive study on his oligopoly model started, which continues until today. Most studies consider this model as a multiplayer non-cooperative game. First, the existence and uniqueness of the Nash equilibrium were the main research subjects [2,3]. Several versions of oligopolies were introduced and studied, including models with product differentiation, multi-product, labor-managed oligopolies, oligopsonies, and group equilibrium problems, among others [4]. In dynamic extensions, first linear models were studied since local and global asymptotic stability are equivalent [5,6]. Based on the mathematical development of nonlinear dynamics, oligopolies with nonlinear payoff functions have become the main focus [7,8,9]. In recent years, oligopolies with time delays have been receiving increasing attention, since data collection in order to determine the best decisions and their implementations need time. If the delay is due to contractual or institutional circumstances, then fixed delays are considered. If the delays are uncertain due to the large number of firms, or the firms want to react to an average of past information rather than to sudden market changes, then continuously distributed delays are assumed. In the first case, differential–difference equations model the situation [10], whereas in the second case, integro-differential equations model the situation [11]. In the past, oligopoly studies of mainly non-cooperative models were considered, and the Nash equilibrium in static games or the steady states of the dynamic models were the focus. In the case of cooperative games, the players want to obtain maximum overall profit, which is then distributed among them based on certain fairness principles [12]. Several concepts and methods were developed [13], among which the Shapley values are the most popular [14].
Many applications of non-cooperative games are known from the literature, which can be found in many text books, like [15]. The applications of cooperative games also cover a huge and diverse field in applied sciences, including natural resource management [16,17], power systems [18], waste management [19], transportation [20,21], insurance industry [22], social network analysis [23], communication network [24], manufacturing systems [25], pattern clustering [26], and business and economics [27], among others. In this paper, n-person oligopolies without product differentiation will be considered and examined under the assumption that the firms know the unit price function and are able to obtain information about the industry output; however, they do not know the cost functions of the others since no technology information is shared among the players. Therefore, they cannot determine their total industry profit maximizing output levels. Hence, an asymptotically stable dynamic process is assumed in which the steady state gives the optimal output levels.
The paper is developed as follows. In Section 2, the basic model is outlined, and in Section 3, its dynamic extension is examined without time delays. Two-delay models are introduced and analyzed in Section 4. In the first case, data on the industry output are assumed to be delayed, and in the second case, in addition, data on the firms’ own output levels are also considered delayed. The model without delay is asymptotically stable under realistic conditions. In the single delay case, it is asymptotically stable if the length of the delay is smaller than a threshold value, where stability is lost by Hopf bifurcation. In the two-delay case, the stability switching curve is determined in the delays’ space. Section 5 offers concluding remarks and outlines further research directions.

2. The Basic Model

In a cooperative oligopoly, the firms want to maximize their overall profit:
φ ( x 1 , x 2 , , x n ) = s p ( s ) k = 1 n C k ( x k ) .
Here, x k is the output of firm k with 0 x k L k , where L k is the capacity limit of this firm. Furthermore, s = k = 1 n x k , p ( s ) is the price function and C k ( x k ) is the cost function of firm k. Assume that functions p and all C k values are twice continuously differentiable; then
( A ) p ( s ) < 0 for 0 s k = 1 n L k , ( B ) p ( s ) + s p ( s ) 0 for 0 s k = 1 n L k , ( C ) C k ( x k ) > 0 , C k ( x k ) > 0 for 0 x k L k   and   all   k .
Notice that
φ x k = s p ( s ) + p ( s ) C k ( x k ) ,
2 φ x k 2 = s p ( s ) + 2 p ( s ) C k ( x k )
and for k ,
2 φ x k x = s p ( s ) + 2 p ( s ) .
Introduce matrices
A = 1 1 · · · 1 1 1 · · · 1 · · · · · · 1 1 · · · 1 and B = C 1 ( x 1 ) 0 · · · 0 0 C 2 ( x 2 ) · · · 0 · · · · · · 0 0 · · · C n ( x n ) ,
then, the Hessian matrix of φ can be written as
H = s p ( s ) + 2 p ( s ) A + B .
Here, B is a negative definite, and eigenvalues of A are 0 and n; furthermore,
s p ( s ) + 2 p ( s ) = p ( s ) + s p ( s ) + p ( s ) < 0 .
Therefore, H is negative definite, implying that φ is strictly concave as an n-variable function.
Since s p ( s ) + 2 p ( s ) is the derivative of s p ( s ) + p ( s ) , this function is strictly decreasing in s. With given s 0 , the best choice of firm k is given as continuous function:
R k ( s ) = 0 if s p ( s ) + p ( s ) C k ( 0 ) 0 , L k if s p ( s ) + p ( s ) C k ( L k ) 0 , x k * otherwise ,
where x k * solves the equation
h ( x k ) = s p ( s ) + p ( s ) C k ( x k ) = 0 .
In the third case of (4), h ( x k ) strictly decreases in x k ,   h ( 0 ) > 0 and h ( L k ) < 0 . Therefore, there is a unique solution of Equation (5). It is easy to show that R k ( s ) is a non-increasing continuous function of s.
Consider finally the following equation:
g ( s ) = k = 1 n R k ( s ) s = 0 .
The left hand-side strictly decreases:
g ( 0 ) 0 and g k = 1 n L k 0 .
Therefore, there is a unique solution s * > 0 of (6) and then the optimal choices of the firms are given by (4) as
x k * = R k ( s * ) .

3. Dynamic Extension

Using gradient adjustments, the output adjustments are generally driven by the differential equations:
x ˙ k ( t ) = K k s ( t ) p ( s ( t ) ) + p ( s ( t ) ) C k ( x k ( t ) ) = K k = 1 n x ( t ) p = 1 n x ( t ) + p = 1 n x ( t ) C k ( x k ( t ) ) .
The right hand-side is a constant multiple of the marginal profit with K k > 0 . Notice that
x ˙ k ( t ) x k = K k 2 p = 1 n x ( t ) + = 1 n x ( t ) p = 1 n x ( t ) C k ( x k ( t ) ) = K k 2 p ( s ( t ) ) + s ( t ) p ( s ( t ) ) C k ( x k ( t ) )
and for k ,
x ˙ k ( t ) x = K k 2 p ( s ( t ) ) + s ( t ) p ( s ( t ) ) .
The Jacobian of this system is clearly
J = KH
with
K = d i a g K 1 , K 2 , , K n .
It is well known that all eigenvalues of J have negative real parts (see Theorem 4.9 of Szidarovszky and Bahill [28], implying the local asymptotical stability of the optimal solution without delays).
Theorem 1.
The steady state of system (7) is always locally asymptotically stable.

4. Dynamic Extension with Time Delay

Assume next that the firms have delayed information about the industry output. If τ k is the delay for firm k, then Equation (7) is modified as follows:
x ˙ k ( t ) = K k s k p ( s k ) + p ( s k ) C k ( x k ( t ) )
with
s k = = 1 n x ( t τ k )
Notice that
x ˙ k ( t ) s k = K k s k p ( s k ) + 2 p ( s k )
and
x ˙ k ( t ) x k = K k C k ( x k ( t ) ) .
Let s * and x k * denote the values of s and x k at the optimal solution. Clearly
s * = k = 1 n x k * .
Introduce the notation
A = s * p ( s * ) + 2 p ( s * )
and
B k = C k ( x k * ) ,
then, the linearized homogenous equation is as follows:
x ˙ k ( t ) = K k A = 1 n x ( t τ k ) + K k B k x k ( t ) .
Upon examining the stability of the equilibrium of this system, we will use the methodology offered by Bellman and Cooke [10].
Notice that A and all B k values are negative. Assume exponential solutions results in x k ( t ) = e λ t u k to have
λ u k = K k A = 1 n e λ τ k u + K k B k u k for k = 1 , 2 , , n
showing that the characteristic equation becomes
det λ K 1 A e λ τ 1 K 1 B 1 K 1 A e λ τ 1 · · · K 1 A e λ τ 1 K 2 A e λ τ 2 λ K 2 A e λ τ 2 K 2 B 2 · · · K 2 A e λ τ 2 · · · · · · K n A e λ τ n K n A e λ τ n · · · λ K n A e λ τ n K n B n = 0 .
It can be represented in closed form based on the result given in Appendix E of Bischi et al.’s work [29]. Introduce
a = K 1 A e λ τ 1 K 2 A e λ τ 2 · K n A e λ τ n , 1 T = 1 , 1 , , 1
and
D = d i a g λ K 1 B 1 , λ K 2 B 2 , , λ K n B n
to have (12) in the following form:
det D + a 1 T = det D det I + D 1 a 1 T = det D det 1 + 1 T D 1 a = Π k = 1 n λ K k B k 1 k = 1 n K k A e λ τ k λ K k B k = 0 .
From the first factor,
λ = K k B k < 0 ,
which does not disturb stability. The expression inside the brackets is very difficult to deal with in general, so we make the following simplifying assumption:
( D ) K 1 = K 2 = = K n = K , B 1 = B 2 = = B n = B and τ 1 = τ 2 = = τ n = τ .
In this special case, we have to examine the following equation
1 k = 1 n K A e λ τ λ K B = 0
or
λ K B n K A e λ τ = 0 .
Without delay, τ = 0 and λ = K B + n K A < 0 . Stability switch might occur if λ = i ω ω > 0 , which is now substituted into Equation (13) to have
i ω K B n K A cos ω τ i sin ω τ = 0 .
Separating the real and imaginary parts gives
n K A cos ω τ = K B
and
n K A sin ω τ = ω .
Adding the squares of these equations, we have
ω 2 = K 2 n 2 A 2 B 2 .
Theorem 2.
If n 2 A 2 B 2 , then no stability switch occurs, and optimal solution is locally asymptotically stable for all τ 0 .
Assume next that n 2 A 2 > B 2 , then
ω * = K n 2 A 2 B 2 .
From (14) and (15), we see that cos ω τ < 0 and sin ω τ > 0 , implying that
τ m = 1 ω * π sin 1 ω * n K A + 2 m π m = 0 , 1 , 2 ,
The directions of the stability switches are obtained by Hopf bifurcation. Select τ as the bifurcation parameter and assume λ = λ ( τ ) . Implicitly differentiating Equation (13) with respect to τ , we have
λ n K A e λ τ λ τ λ = 0
so
λ = n K A e λ τ λ 1 + n K A e λ τ τ = λ K B λ 1 + λ K B τ .
With λ = i ω , the real part is
Re λ λ = i ω = Re ω 2 + i K B ω 1 K B τ + i ω τ = ω 2 1 K B τ 2 + ω τ 2 > 0 .
Theorem 3.
If n 2 A 2 > B 2 , then the optimal solution is locally asymptotically stable for τ < τ 0 , stability is lost at τ = τ 0 with Hopf bifurcation, and stability cannot be regained with larger values of τ.
In addition to Assumption (D), assume that the firms have an identical delay τ 1 in the industry output and an identical delay τ 2 in their own output values. Then, Model (10) is modified as follows:
x ˙ k ( t ) = K s p ( s ) + p ( s ) C k ( x k ( t τ 2 ) )
with
s = = 1 n x ( t τ 1 ) .
This is a system of two-delay equations. The stability of its equilibrium will be examined by the method offered by Matsumoto and Szidarovszky [30] based on Gu et al. [31].
The linearized equation is now the following:
x ˙ k ( t ) = K A = 1 n x ( t τ 1 ) + K B x k ( t τ 2 ) .
Assuming exponential solutions x ( t ) = e λ t u , we then obtain by substitution
λ K B e λ τ 2 u k K A = 1 n e λ τ 1 u = 0 ,
implying that the characteristic equation has the form
det λ K A e λ τ 1 K B e λ τ 2 K A e λ τ 1 · · · K A e λ τ 1 K A e λ τ 1 λ K A e λ τ 1 K B e λ τ 2 · · · K A e λ τ 1 · · · · · · K A e λ τ 1 K A e λ τ 1 · λ K A e λ τ 1 K B e λ τ 2 = 0 .
Let 1 be again the n-element vector with all unity elements, and I be the n × n identity matrix. Then, (19) can be rewritten as
det D + a 1 T = det D det I + D 1 a 1 T = det D det 1 + 1 T D 1 a = λ K B e λ τ 2 n 1 k = 1 n K A e λ τ 1 λ K B e λ τ 2 = 0 ,
where
a = K A e λ τ 1 1 and D = λ K B e λ τ 2 I .
Thus, we have two-delay equations:
λ K B e λ τ 2 = 0
and
λ K n A e λ τ 1 + B e λ τ 2 = 0 .
Notice that (21) is a single-delay equation, and at τ 2 = 0 , the eigenvalue is λ = K B < 0 . The sign of the real part of the eigenvalue might change at λ = i ω . Then
i ω K B cos ω τ 2 i sin ω τ 2 = 0 .
Separation of the real and imaginary parts shows that
K B cos ω τ 2 = 0
and
K B sin ω τ 2 = ω ,
implying that
cos ω τ 2 = 0 and sin ω τ 2 = 1 ,
and the critical values of τ 2 are
τ 2 n = 1 K B π 2 + 2 n π for n = 0 , 1 , 2 ,
since, from (24), ω = K B . The directions of stability switches are determined by Hopf bifurcation, when τ 2 is selected as the bifurcation parameter and let λ = λ ( τ 2 ) . Implicit differentiation of Equation (21) with respect to τ 2 shows that
λ K B e λ τ 2 λ τ 2 λ = 0 ,
implying that
λ = λ 2 1 + λ τ 2 ,
where we use K B e λ τ 2 = λ . At λ = i ω , the real part of λ is positive:
Re λ = Re ω 2 1 + i ω τ 2 , = Re ω 2 1 i ω τ 2 1 + ω τ 2 2 , = ω 2 1 + ω τ 2 2 > 0 .
Therefore, the eigenvalues of Equation (21) have negative real parts for τ < τ 20 , and at all critical values τ 2 n ( n = 0 , 1 , 2 , ) , at least one pair of eigenvalues changes the sign of its real part from negative to positive.
We now turn to Equation (22), which can be written as
1 + a 1 ( λ ) e λ τ 1 + a 2 ( λ ) e λ τ 2 = 0
with
a 1 ( λ ) = n K A λ and a 2 ( λ ) = K B λ .
Notice first that without delays, λ = n K A + K B < 0 , and with increasing values of the delays, stability may be lost when λ = i ω . Then, we have
1 + a 1 ( i ω ) e i ω τ 1 + a 2 ( i ω ) e i ω τ 2 = 0
where
a 1 ( i ω ) = i n K A ω , a 2 ( i ω ) = i K B ω ,
a 1 ( i ω ) = n K A ω and a 2 ( i ω ) = K B ω ,
and
arg a 1 ( i ω ) = arg a 2 ( i ω ) = 3 π 2 .
If we place vectors, 1 , a 1 ( i ω ) e i ω τ 1 and a 2 ( i ω ) e i ω τ 2 head to tail, then they form a triangle. The sufficient and necessary conditions for the existence of a triangle are
a 1 ( i ω ) + a 2 ( i ω ) 1 , 1 a 1 ( i ω ) a 2 ( i ω ) 1 .
In our case,
n K A K B ω , ω n K A + K B ω
which can be summarized as
n K A + K B ω n K A K B .
The triangle is illustrated in Figure 1, when the interior angles are θ 1 , θ 2 , and π ( θ 1 + θ 2 ) .
The rule of cosine shows that
θ 1 = cos 1 1 + a 1 ( i ω ) 2 a 2 ( i ω ) 2 2 a 1 ( i ω ) = cos 1 ω 2 + ( n K A ) 2 ( K B ) 2 2 n K A ω
and
θ 2 = cos 1 1 + a 2 ( i ω ) 2 a 1 ( i ω ) 2 2 a 2 ( i ω ) = cos 1 ω 2 + ( K B ) 2 ( n K A ) 2 2 K B ω .
The arguments of the three sides of the triangle are
0 , arg a 1 ( i ω ) ω τ 1 and arg a 2 ( i ω ) ω τ 2
and the angle balance equations at the end points of the horizontal side show that
τ 1 k ± ( ω ) = 1 ω arg a 1 ( i ω ) + ( 2 k 1 ) π ± θ 1 for k = 0 , 1 , 2 ,
and
τ 2 ( ω ) = 1 ω arg a 2 ( i ω ) + ( 2 1 ) π θ 2 for = 0 , 1 , 2 ,
since the triangle can be located above and under the horizontal axis. Hence,
τ 1 k ± ( ω ) = 1 ω 3 π 2 + ( 2 k 1 ) π ± θ 1 for k = 0 , 1 , 2 ,
and
τ 2 ( ω ) = 1 ω 3 π 2 + ( 2 1 ) π θ 2 for = 0 , 1 , 2 , ,
implying that the stability switching curves are formed as
T k , ± = τ 1 k ± ( ω ) , τ 2 ( ω ) n K A + K B ω n K A K B
with k = 0 , 1 , 2 , and = 0 , 1 , 2 , From (28) and (29), we see that increasing the value of k shifts the curves to the right and increasing the value of shifts the curves up in the delays space.
At each point ( τ 1 , τ 2 ) of the stability switching curves, the direction of stability switches can be assessed by computing the stability index. First, we determine the real and imaginary parts of expressions:
a 1 ( i ω ) e i ω τ 1 = i n K A ω cos ω τ 1 i sin ω τ 1
and
a 2 ( i ω ) e i ω τ 2 = i K B ω cos ω τ 2 i sin ω τ 2
to have
R 1 = n K A sin ω τ 1 ω , I 1 = n K A cos ω τ 1 ω
and
R 2 = K B sin ω τ 2 ω , I 2 = K B cos ω τ 2 ω .
And then, the stability index is given as follows:
S = R 2 I 1 R 1 I 2 = n K 2 A B ω 2 sin ω τ 2 cos ω τ 1 sin ω τ 1 cos ω τ 2
which has the same sign as sin ω τ 2 τ 1 .
Theorem 4.
In the two-delay model, the stability switching curves are T k , + and T k , k = 0 , 1 , 2 , and = 0 , 1 , 2 , and τ 2 = τ 20 .
Theorem 5.
(A) Let ( τ 1 , τ 20 ) be any point on the line τ 2 = τ 20 . When a point crosses the line from below, then at least one pair of eigenvalues changes the sign of the real part from negative to positive. (B) Let ( τ 1 , τ 2 ) be a point on curve T k , + or T k , with a simple pure complex eigenvalue. Assume we look on the curve in increasing value of ω. Then, as a point moves from the right to the left of the corresponding curve, a pair of eigenvalues changes the sign of its real part from negative to positive if S > 0 . If S < 0 , then the sign change is in the opposite direction.
Note: Equation (22) reduces to (13) as τ = τ 1 and τ 2 = 0 . If τ 2 = 0 , then from (29),
θ 2 = ± 3 π 2 + ( 2 1 ) π ,
and with cos θ 2 = 0 and from (27),
ω 2 + K B 2 n K A 2 = 0 ,
implying ω 2 = n K A 2 K B 2 . The same result was obtained as in the single-delay system.

5. Conclusions

In this paper, n-person single-product oligopolies were considered without product differentiation and with incomplete information. It was assumed that the firms knew the price function, and from market data, they also had access to the industry output. However, each firm knew its own cost function but had no information about those of the others. In a cooperative setting, the firms’ usual objective was to find the output levels maximizing the industry profit. Since the cost functions were unknown, they used a dynamic process where the components of the steady state presented the optimal output levels. A model without time delay and two models with one and two delays were analyzed. In the stability analysis, the findings of the paper can be summarized as follows:
1.
Under realistic conditions, the steady state in the no-delay case was always asymptotically stable, meaning that the components of the state trajectory converged to the industry profit maximizing output levels.
2.
In the one-delay symmetric case, the steady state was always asymptotically stable if the number of firms was small; otherwise, asymptotic stability occurred if the length of the delay was smaller than a given threshold value, at which stability was lost via Hopf bifurcation.
3.
In the two-delay case, the stability switching curves were determined in the two-dimensional delay space. The stability region contained the origin and was under or left of these curves.
The study presented in this paper can be extended in several directions. Non-differentiable price and/or cost functions can be assumed, like hyperbolic price and/or piecewise linear cost functions, making the analysis more complicated. The same difficulty is encountered in the nonsymmetric case as well. It is also an interesting problem to work out the details of the solutions based on different cooperative solution concepts.

Author Contributions

Conceptualization, F.S.; methodology, F.S.; software, A.M.; validation, A.M.; formal analysis, F.S.; writing—original draft, F.S. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by the Japan Society for the Promotion of Science (Grant-in-Aid for Scientific Research (C), 20K01566, 23K01386).

Data Availability Statement

Data are contained within the article.

Acknowledgments

The authors appreciate three anonymous reviewers for constructive comments that improved the paper’s presentation.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Cournot, A. Recherches sur les Principes Mathématiques de la Théorie des Richessess; Hachette: Paris, France, 1838; English Translation Researches into the Mathematical Principles of the Theory of Wealth; Kelley: New York, NY, USA, 1960. [Google Scholar]
  2. Burger, E. Einfuhrung in die Theorie der Spiele; De Gruyter: Berlin, Germany, 1959. [Google Scholar]
  3. Friedman, J. Oligopoly and the Theory of Games; North Holland Publishing Company: Amsterdam, The Netherland, 1977. [Google Scholar]
  4. Okuguchi, K. Expectations and Stability in Oligopoly Models; Springer: Berlin, Germany, 1976. [Google Scholar]
  5. Hahn, F. The stability of the Cournot oligopoly solution. Rev. Econ. Stud. 1962, 29, 329–331. [Google Scholar] [CrossRef]
  6. Theocharis, R. On the stability of the Cournot solution on the oligopoly problem. Rev. Econ. Stud. 1959, 27, 133–134. [Google Scholar] [CrossRef]
  7. Furth, D. Stability and instability in oligopoly. J. Econ. Theory 1986, 40, 197–228. [Google Scholar] [CrossRef]
  8. Agiza, H.; Elsadany, A. Nonlinear dynamics in the Cournot duopoly game with heterogeneous players. Phys. A 2003, 320, 512–524. [Google Scholar] [CrossRef]
  9. Puu, T. Attractors, Bifurcations, and Chaos: Nonlinear Phenomena in Economics, 2nd ed.; Springer: Berlin, Germany, 2003. [Google Scholar]
  10. Bellman, R.; Cooke, K.-L. Differential-Difference Equations; Academic Press: New York, NY, USA, 1963. [Google Scholar]
  11. Cushing, J. Integro-Difference Equations and Delay Models in Population Dynamics; Springer: Berlin, Germany, 1977. [Google Scholar]
  12. Driessen, T. Cooperative Games, Solutions and Applications; Kluwer Academic Publishers: Dordrecht, The Netherlands, 1988. [Google Scholar]
  13. Szép, J.; Forgó, F. Introduction to the Theory of Games; Akadémai Kiadó: Budapest, Hungary, 1985. [Google Scholar]
  14. Shapley, L. A Value for n-Person Games. In Contributions to the Theory of Games II; Kuhn, H., Tucker, A., Eds.; Princeton University Press: Princeton, NJ, USA, 1953; pp. 307–317. [Google Scholar]
  15. Petrosyan, L.; Mazalov, V. Recent Advances in Game Theory and Applications; Birkhäuser: Basel, Switzerland, 2016. [Google Scholar]
  16. Dinar, A.; Ratner, A.; Yaron, D. Evaluating cooperative game theory in water resources. Theory Decis. 1992, 32, 1–20. [Google Scholar] [CrossRef]
  17. McKinney, D.; Teasley, R. Cooperative game theory for transboundary river basins: The Syr Darya Basin. In Proceedings of the World Environmental and Water Resources Congress 2007, Restoring Our Natural Habitat, Tampa, FL, USA, 15–19 May 2007; pp. 1–10. [Google Scholar]
  18. Churkin, A.; Bialek, J.; Pozo, D.; Sauma, E.; Korgin, N. Review of cooperative game theory applications in power system expansion planning. Renew. Sustain. Energy Rev. 2021, 145, 111056. [Google Scholar] [CrossRef]
  19. Eryganov, T.; Šomplàr, K.; Nevrly, V. Application of cooperative game theory in waste manamement. Chem. Eng. Trans. 2020, 81, 877–882. [Google Scholar]
  20. Song, D.; Panayides, P. A conceptural application of cooperative game theory to liner shipping strategic alliances. Marit. Policy Manag. 2002, 29, 285–301. [Google Scholar] [CrossRef]
  21. Saeed, N.; Larsen, O. An application of cooperative game among container terminals of one port. Eur. J. Oper. Res. 2010, 203, 393–403. [Google Scholar] [CrossRef]
  22. Lemaire, J. Cooperative game theory and its insurance applications. ASTIN Bull. J. IAA 1991, 21, 17–40. [Google Scholar] [CrossRef]
  23. Molinero, X.; Riquelme, F. Influence of decision models: From cooperative game theory to social netwark analysis. Comput. Sci. Rev. 2021, 39, 100343. [Google Scholar] [CrossRef]
  24. Saad, W.; Han, Z.; Debbah, M.; Hjorungness, A.; Bašar, T. Coalition game theory for communication networks. IEEE Signal Process. Mag. 2009, 26, 77–97. [Google Scholar] [CrossRef]
  25. Tavanayi, M.; Hafezalkotob, A.; Valizadeh, J. Cooperative cellural manufaturing system: A cooperative game theory approach. Sci. Iran. 2021, 28, 2769–2788. [Google Scholar]
  26. Dhamal, S.; Bhat, S.; Anoop, K.; Embar, V. Pattern clustering using cooperative game theory. arXiv 2012, arXiv:1201.0461. [Google Scholar]
  27. Stuart, H., Jr. Cooperative Games and Business Strategy. In Game Theory and Business Applications, Kluwer’s International Series; Chatteree, K., Samuelson, W.F., Eds.; Springer: Boston, MA, USA, 2001; pp. 189–211. [Google Scholar]
  28. Szidarovszky, F.; Bahill, T. Linear Systems Theory, 2nd ed.; CRC Press: Boca Raton, FL, USA; London, UK; New York, NY, USA, 1998. [Google Scholar]
  29. Bischi, G.-I.; Chiarella, C.; Kopel, M.; Szidarovszky, F. Nonlinear Oligopolies: Stability and Bifurcations; Springer: Berlin, Germany, 2010. [Google Scholar]
  30. Matsumoto, A.; Szidarovszky, F. Dynamic Oligopolies with Time Delays; Springer Nature: Singapore, 2018. [Google Scholar]
  31. Gu, K.; Nicolescue, S.-I.; Chen, J. On stability switching curves for general systems with two delays. J. Math. Ann. Appl. 2005, 311, 231–253. [Google Scholar] [CrossRef]
Figure 1. Triangle contitions.
Figure 1. Triangle contitions.
Mathematics 12 00891 g001
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Szidarovszky, F.; Matsumoto, A. Dynamic Cooperative Oligopolies. Mathematics 2024, 12, 891. https://doi.org/10.3390/math12060891

AMA Style

Szidarovszky F, Matsumoto A. Dynamic Cooperative Oligopolies. Mathematics. 2024; 12(6):891. https://doi.org/10.3390/math12060891

Chicago/Turabian Style

Szidarovszky, Ferenc, and Akio Matsumoto. 2024. "Dynamic Cooperative Oligopolies" Mathematics 12, no. 6: 891. https://doi.org/10.3390/math12060891

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop