An equilibrium problem with equilibrium constraints (EPEC) is a member of a new class of mathematical programs that often arise in engineering and economics applications. More generally, an EPEC is a mathematical program to find equilibria that simultaneously solve several mathematical programs with equilibrium constraints (MPEC), each of which is parameterized by decision variables of other MPEC. In particular, we assume the EPEC consists of $ K $ MPEC, and for each $ \nu=1, \ldots, K $, the $ \nu $-th MPEC has the following form with independent decision variables $ x^{\nu} \in \mathbb{R}^{n_{\nu}} $ and shared decision variables $ y \in \mathbb{R}^{n_0} $:
where $ f^{\nu}: \mathbb{R}^n \rightarrow \mathbb{R} $, $ g^{\nu}: \mathbb{R}^n \rightarrow \mathbb{R}^{p_{\nu}} $, $ h^{\nu}: \mathbb{R}^n \rightarrow \mathbb{R}^{q_{\nu}} $, $ G: \mathbb{R}^n \rightarrow \mathbb{R}^m $ and $ H: \mathbb{R}^n \rightarrow \mathbb{R}^m $ are twice continuously differentiable functions in both $ x=(x^{\nu})^K_{\nu=1} $ and $ y $, with $ n=\sum^K_{\nu=0}n_{\nu} $. The notation $ \bar{x}^{-\nu} $ means that $ x^{-\nu}=(x^1, \ldots, x^{\nu-1}, x^{\nu+1}, \ldots, x^K)\in \mathbb{R}^{n-n_{\nu}-n_0} $ is not a variable but a fixed vector. This implies that we can view (1.1), denoted by MPEC $ (\bar{x}^{-\nu}) $, as being parameterized by $ \bar{x}^{-\nu} $. Given $ \bar{x}^{-\nu} $, we assume the solution set of the $ \nu $-th MPEC is nonempty and denote it by SOL (MPEC $ (\bar{x}^{-\nu}) $). The EPEC, associated with $ K $ MPEC defined as the above, is to find a Nash equilibria $ (x^*, y^*)\in \mathbb{R}^n $ such that
The EPEC has recently been studied by some researchers and used to model several problems in applications. Several EPEC models have been developed to study the strategic behavior of generating firms in deregulated electricity markets [1–4]. A sequential nonlinear complementarity problem approach for solving EPEC is proposed in [5]. This approach is related to the relaxation technique for solving MPECs that relaxes the complementarity conditions and drives the relaxation parameter to zero [6]. Based on the strong stationarity conditions of each leader in a multi-leader-follower game, Leyffer and Munson [7] derived a family of nonlinear complementarity problem, nonlinear programming problem and MPEC formulations of the multi-leader-follower game. They also reformulated price-consistent multi-leader-follower game to a standard MPEC by imposing an additional restriction. See also various applications in economics such as Ehrenmann [8], Ehrenmann and Neuho [2], Hu [9], Murphy and Smeers [10], Su [11], Yao et al. [12]; and the algorithm investigation Su [5].Guo and Lin [13, 14] reformulated various stationarities for EPECs as constrained equations and proposed a globally and superlinearly convergent algorithm to solve these constrained equations. Li [15] considered a class of EPECs which is completely separable. In [16, 17], Kulkarni et al. reformulated some EPEC models as MPECs by using potential games and shared constraints. The normalized equilibrium is such an equilibrium point that the Lagrange multipliers (shadow prices) associated with the shared constraints are equal among all players up to constant factors, and its uniqueness is guaranteed under appropriate conditions [18].Note that EPEC is highly nonconvex and hence we study its stationary point.
In this paper, we study normalized stationary points of a class of EPEC where the multipliers of the players on the shared constraints are proportionable. In economic terms, it means that the relative values of shadow prices associated with the common resources are identical for all players at any normalized stationary points. We reformulate this kind of EPEC to a standard MPEC by imposing some additional conditions and solve it by applying the standard MPEC method, which generalizes the work of Leyffer and Munson [7] in which the multipliers are identical for all players. The EPEC model is different from the ones considered in [16, 17] in which the decision variables (on the lower level) vary among different leaders' decision problems, while it is assumed in our model that the leaders have a common knowledge on the solution of the lower level equilibrium problem. Moreover, from the modeling perspective, our research focuses on the leadership role which is different from the framework in [16, 17]. Separability assumption of the EPEC model is also different from the ones studied in [13, 14] and [15].
This paper is organized as follows. In the next section we briefly introduce several stationarity conditions for EPEC and show how equilibrium points can be computed reliably for EPEC by solving nonlinear optimization problems. Section 3 present normalized stationary points of a class of equilibrium problems with equilibrium constraints and reformulate to stationary points of an associated MPEC. In Section 4, we consider the EPEC model for similar products market in the same city and demonstrate the proposed approach on the model. In addition, some concluding remarks are given in Section 5.
The following notations will be used in the paper. We denote the transposed Jacobian matrix of a differentiable function $ h: \mathbb{R}^s\rightarrow \mathbb{R}^t $ at a given point $ x $ by $ \nabla h(x) \in \mathbb{R}^{s\times t} $. For a real-valued function $ h(x, y) $ with the variable $ x \in \mathbb{R}^s $ and $ y \in \mathbb{R}^t $, the partial gradients with respect to $ x $ and $ y $ are denoted by $ \nabla_x h(x, y)\in \mathbb{R}^s $ and $ \nabla_y h(x, y)\in \mathbb{R}^t $, respectively.
In this section, we first review the concepts of the weakly (W-) stationarity, Clarke (C-) stationarity, Mordukhovich (M-) stationarity and strongly (S-) stationarity for MPEC (1.1)(see. e.g., [6, 19–22]).
Definition 2.1 A vector $ (x^{\nu}, y) $ is called W-stationary point of the MPEC (1.1), if there exists a vector multipliers $ (\lambda^{\nu}, \mu^{\nu}, \psi^{\nu}, \sigma^{\nu}) $ such that $ (x^{\nu}, y, \lambda^{\nu}, \mu^{\nu}, \psi^{\nu}, \sigma^{\nu}) $ satisfies the following conditions:
In addition, the vector $ (x^{\nu}, y) $ is called
(a) a C-stationary point if $ \psi_i^{\nu}\sigma_i^{\nu}\geq0 $ when $ G_i(x^{\nu}, y, \bar{x}^{-\nu})= H_i(x^{\nu}, y, \bar{x}^{-\nu})=0 $.
(b) a M-stationary point if either $ min(\psi_i^{\nu}, \sigma_i^{\nu})>0 $ or $ \psi_i^{\nu}\sigma_i^{\nu}=0 $ when $ G_i(x^{\nu}, y, \bar{x}^{-\nu})= H_i(x^{\nu}, y, \bar{x}^{-\nu})=0 $.
(c) a S-stationary point if $ \psi_i^{\nu}\geq0, \sigma_i^{\nu}\geq0 $ when $ G_i(x^{\nu}, y, \bar{x}^{-\nu})= H_i(x^{\nu}, y, \bar{x}^{-\nu})=0 $.
In [7, 23], it is shown that MPEC can be solved reliably and efficiently by replacing the complementarity constraint with $ Ys\leq 0 $, where $ Y $ is the diagonal matrix with $ y $ along its diagonal. Fletche and Leyffer[24] have shown that the strong stationarity of MPEC is equivalent to the KKT conditions of a NLP. Since we only consider finite-dimensional optimization problems, based the stationarity for MPEC (1.1), we define the stationarity for EPEC (1.2)(see. e.g., [5, 25]).
Definition 2.2 We say that a vector $ (x^*, y^*) $ is a C-stationary(M-stationary, S-stationary) point of the EPEC (1.2) if for each $ \nu=1, \ldots, K $, $ (x^{\nu, *}, y^*) $ is a C-stationary(M-stationary, S-stationary) point for the $ MPEC(x^{*, -\nu}) $(1.1).
We have known from [5] that if $ (x^*, y^*) $ is an (possibly local) equilibrium point of EPEC (1.2) and every MPEC of EPEC (1.2) satisfies an MPEC-LICQ, then there exist multipliers $ (\lambda^* , \mu^*, \psi^*, \sigma^*) $ such that $ (x^*, y^*) $ is a S-stationary point of the EPEC (1.2). In the following two propositions, we will consider the relationship of C-stationary (M-stationary) point and (possibly local) equilibrium point in EPEC (1.2).
Proposition 2.1 Let $ (x^*, y^*) $ be an (possibly local) equilibrium point of EPEC (1.2), if for each $ \nu=1, \ldots, K $, the MPEC-MFCQ holds at $ (x^{\nu, *}, y^*) $ for $ MPEC(x^{*, -\nu}) $(1.1), then there exists a vector multipliers $ (\lambda^* , \mu^*, \psi^*, \sigma^*) $ such that $ (x^*, y^*) $ is a C-stationary point of the EPEC (1.2).
Proof Since $ (x^*, y^*) $ be an (possibly local) equilibrium point of the EPEC (1.2), it follows that for each $ \nu=1, \ldots, K $, the point $ (x^{\nu, *}, y^*) $ is a (local) minimizer of the $ MPEC(x^{*, -\nu}) $(1.1). By applying the Theorem 2 of [6] for each $ \nu=1, \ldots, K $, we can show that there exists a vetor multipliers $ (\lambda^{\nu} , \mu^{\nu} , \psi^{\nu} , \sigma^{\nu} ) $ such that $ (x^{\nu, *} , y^*) $ is a C-stationary point of the $ MPEC(x^{*, -\nu}) $(1.1) for each $ \nu=1, \ldots, K $. We can easy obtain the conclusion from the definition of C-stationary point of the EPEC (1.2).
Proposition 2.2 Let $ (x^*, y^*) $ be an (possibly local) equilibrium point of EPEC (1.2), if for each $ \nu=1, \ldots, K $, the NNAMCQ holds at $ (x^{\nu, *}, y^*) $ for $ MPEC(x^{*, -\nu}) $(1.1), then there exists a vector multipliers $ (\lambda^* , \mu^*, \psi^*, \sigma^*) $ such that $ (x^*, y^*) $ is a M-stationary point of the EPEC (1.2).
Proof We can easily obtain the conclusion by applying the Corollary 2.1 of [21]. Since its proof is similar to Proposition 2.1, we omit the proof here.
In this section, we will consider a special local equilibrium points of the EPEC and call it normalized stationary points of the EPEC.
Normalized equilibrium, first introduced by Rosen [18], is a special GNEP. To reduce the number of variables and constraints, which may make the problem more tractable, Leyffer and Munson [7] make a price-consistency assumption. This technique restricts the solutions considered to those for which the multipliers (prices) on the shared constraints are the same. In economic terms, this means that the relative values of shadow prices associated with the common resources are identical for all players at any normalized equilibrium. We need the following separability assumption for objective functions.
Definition 3.1 We say that the EPEC (1.2) is relatively separable if the general constraints consist of a set of constraints independent of other decision variables and a set of constraints common across all players, that is,
and the objective function consists of a separable term and a term relatively common across all players, that is
where $ \beta^{\nu}>0 $.
Assume that the EPEC (1.2) is relatively separable, we can rewrite it as following for each $ \nu=1, \ldots, K $,
Definition 3.2 We say that a vector $ (x^*, y^*) $ is a normalized C-(M-, S-) stationary point of the EPEC (3.1), if $ (x^*, y^*) $ is a C-(M-, S-) stationary point of the EPEC (3.1) and the Lagrange multipliers associated with the shared constraints satisfying:
The following theorem relates normalized stationary point of relatively separable EPEC to a standard MPEC.
Theorem 3.1 Assume that the EPEC (1.2) is relatively separable. Then the normalized C-(M-, S-) stationary point conditions of the EPEC (1.2) are equivalent to the C-(M-, S-) stationary point conditions of the following MPEC:
Proof If the EPEC (1.2) is relatively separable and $ (x^*, y^*) $ is its normalized C-(M-, S-) stationary point, we can reformulate the EPEC(1.2) to the EPEC(3.1) and there exists a vector multipliers $ (\tilde{\lambda}^{\nu}, \tilde{\mu}^{\nu}, \rho^{\nu}, \tau^{\nu}, \psi^{\nu}, \sigma^{\nu}) $, such that $ (x^{\nu}, y, \tilde{\lambda}^{\nu}, \tilde{\mu}^{\nu}, \rho^{\nu}, \tau^{\nu}, \psi^{\nu}, \sigma^{\nu}) $ satisfies the following: $ \nu=1, \ldots, K $,
In addition, when $ G_i(x^*, y^*)= H_i(x^*, y^*)=0 $, we can call the vector $ (x^*, y^*) $ is, $ \nu=1, \ldots, K $,
(a) a C-stationary point if $ \psi_i^{\nu}\sigma_i^{\nu}\geq0 $.
(b) a M-stationary point if either $ min(\psi_i^{\nu}, \sigma_i^{\nu})>0 $ or $ \psi_i^{\nu}\sigma_i^{\nu}=0 $.
(c) a S-stationary point if $ \psi_i^{\nu}\geq0, \sigma_i^{\nu}\geq0 $.
Note that the definition of normalized C-(M-, S-) stationary point of the EPEC (3.1), we have
Namely,
Dividing $ \beta^{\nu} $ into (3.4), we can reformulate (3.4) as follows:
Obviously, if there exists a vector multipliers $ (\tilde{\lambda}^0, \tilde{\mu}^0, \psi^0, \sigma^0, \rho^1, \ldots, \rho^K, \tau^1, \ldots, \tau^K) $ such that the vector $ (x^*, y^*, \tilde{\lambda}^0, \tilde{\mu}^0, \psi^0, \sigma^0, \rho^1, \ldots, \rho^K, \tau^1, \ldots, \tau^K) $ satisfies the (3.7), so the vector $ (x^*, y^*) $ is a W-stationary point of the MPEC (3.3).
Additionally, we have the following conclusion by $ \beta^{\nu}>0, \nu=1, \ldots, K $ and (3.6):
(a) $ \psi^{\nu}\sigma^{\nu}\geq0 \Longleftrightarrow \psi^0\sigma^0\geq0 $.
(b) either $ min(\psi^{\nu}, \sigma^{\nu})>0 $ or $ \psi^{\nu}\sigma^{\nu}=0 $ $ \Longleftrightarrow $ either $ min(\psi^0, \sigma^0)>0 $ or $ \psi^0\sigma^0=0 $.
(c) $ \psi^{\nu}\geq0, \sigma^{\nu}\geq0 \Longleftrightarrow \psi^0\geq0, \sigma^0\geq0 $.
Note that the definition of C-(M-, S-) stationary point of EPEC, we can easily get the conclusion.
Obviously, solving normalized stationary points of relatively separable EPEC is a generalization of the price-consistent multi-leader-follower games in [7]. By introducing the relatively separable assumption and finding normalized stationary points, we produce a model that may be easier to solve than the original standard EPEC. The following examples of Nash game show the results for solving the normalized stationary points:
Example 1 (Leyffer's example) This problem is taken from [7].
where a, b, and c are parameters. The NCP formulation of solving normalized stationary points for this problem is the system of equations
where $ (a\lambda_0, b\lambda_0) $ is Lagrange multiplier vectors for shared constraint. This problem have normalized equilibrium $ (\frac{ac(b-2)}{2(ab-a-b)}, \frac{bc(a-2)}{2(ab-a-b)}) $, which $ \lambda_0=\frac{abc-4c}{2(ab-a-b)} $. It is equivalent to computing a first-order critical point for the single optimization problem:
Example 2 (Harker's example) This problem is taken from [26].There are two players and they solve the following problems:
This is a GNEP with one shared constraint and the solution set is given by
If $ (\frac{8}{3}\lambda_0, \frac{5}{4}\lambda_0), \lambda_0\geq0 $ is Lagrange multiplier vectors for shared constraint. This problem has normalized equilibrium $ (5, 9) $ and $ (\frac{47}{7}, \frac{58}{7}) $, which $ \lambda_0=0 $ and $ \lambda_0=\frac{4}{7} $. It is equivalent to computing a first-order critical point for the single optimization problem:
In this section, we first discuss normalized stationary points of relatively separable EPEC arising from competition of manufacturer for similar products in the same city.
Since similar products have some same function but not exactly the same, similar products have different prices. We consider an oligopoly consisting of $ K+F $ manufacturers that produce similar products noncooperatively before the market demand is realized. The first $ K $ manufacturers (herein leaders) have no capacity installed and thus have to decide now what their future output will be before the demand function is realized. The remaining $ F $ manufacturers (followers) have sufficient capacity installed and thus do not have to make a decision today, but instead they can wait to observe the quantities supplied by the $ K $ leaders as well as the realized demand function before making a decision on their supply quantities.
The market demand are characterized by inverse demand functions $ p_{\nu}(x, y), \nu=1, \ldots, K+F $, where $ p_{\nu}(x, y) $ is the market price of the product made by the manufacturer $ \nu $, $ x=(x_i)_{i=1}^K $, $ x_i $ is the supply quantity of the leader $ i $, and $ y=(y_j)_{j=1}^F $, $ y_j $ is the supply quantity of the follower $ j $.
Before market demand is realized, leader $ i $ chooses his quantity $ x_{i} $. The leader's profit can be formulated as
where $ X_{-i} $ denotes the total bids by the other leaders, $ Y^*=(y_j^*)_{j=1}^K $, where $ y_j^* $ is the strategies of the $ j $ follower. $ x_{i}p_i(x_{i}, X_{-i}, Y^*) $ means the total revenue for leader $ i $, and $ C_{i}(x_{i}) $ denotes the cost function of leader $ i $. The $ jth $ leader's decision problem is to choose the supply quantity $ x_{i} $ that maximizes its profit; that is,
where $ \mathcal{X}_{i}:=\{x_{i}\in [0, +\infty) \mid g_i(x_{i})\leq 0, g(x, y)\leq 0\} $ is nonempty and bounded convex set, for each $ i=1, \ldots, K $.
The $ jth $ follower chooses its supply quantity after observing the aggregate leaders supply $ X $. Thus, the total revenue of the $ j $th follower is $ y_{j}p_j(X^*, y_j, Y_{-j}) $, and its total cost is $ C_{j}(y_{j}) $. Consequently, the jth follower profit is
where $ Y_{-j} $ denotes the total bids by the other followers, $ X^*=(x_i^*)_{i=1}^K $, where $ x_i^* $ is the strategies of the leader $ i $. The $ jth $ follower decision problem is
Note that the existence of the multi-leader-follower games can be obtained under the following assumptions: $ \forall\nu=1, 2, \ldots, K+F $,
$ \bf (A1) $ $ p_{\nu}(\cdot) $ is twice continuously differentiable and decreasing,
$ \bf (A2) $ There holds $ {p_{\nu}}^{'}_{q}(q)+q{p_{\nu}}^{''}_{qq}(q)\leq 0 $ for any $ q\geq 0 $,
$ \bf (A3) $ The cost functions $ C_{\nu}(q_{\nu}) $, are twice continuously differentiable and their first and second derivatives are nonnegative for all $ q_{\nu}\ge 0 $.
Under Assumptions (A1)–(A3), one can easily show that $ R^{\nu}(x, y) $ is concave, which guarantees the existence of multi-leader-follower games of the model. Additionally, we suppose that the multipliers of the leaders on the shared constraints are proportionable; that is,
where $ \beta_{\nu}>0 $.
If (4.4) is convex and satisfies a constraint qualification for each follower, then the condition that each follower chooses an optimal strategy is equivalent to the following KKT conditions:
The aim of each leader $ i $, $ i=1, \ldots, K $, is to choose a strategy $ x_i $ that solves the following MPEC:
Consider the above normalized stationary points of relatively separable EPEC with two leaders and one follower and set the data as follows:
● The inverse demand functions are given by
When $ x_1\in (0, \sqrt{y}) $ is bigger, $ P_1 $ is bigger. On the other hand, when $ x_1\in (\sqrt{y}, +\infty) $ is bigger, $ P_1 $ is smaller. Actually, the supply quantities of leaders are far more than the follower's and they are in the same order of magnitude. Consequently, $ x_1 $ is in $ (\sqrt{y}, +\infty) $ in general. when there is not enough demand for its product, the price goes down. While the product is in short supply relative to the demand, the price will be bid up. The effective level of various variables was different.
● The cost functions are given by
● The constraint functions of the leaders are given by
where $ a_i\geq 0, b_i\geq0, c_i\geq0, i=1, 2, 3 $; $ x_1\geq0, x_2\geq0, y\geq0 $.
Then the problem can be written as follows:
By Theorem 3.1, the normalized C-(M-, S-) stationary point of the EPEC (4.6) is the standard C-(M-, S-) stationary point of the following MPEC:
Conversely, if $ (x^*, y^*) $ is the C-(M-, S-) stationary point of (4.7) then $ (x^*, y^*) $ is the normalized C-(M-, S-) stationary point of the EPEC (4.6).
We set the parameters by $ a_1=68, b_1=4, a_2=78, b_2=5, a_3=60, b_3=3. c_{1}=22, c_{2}=26, c_3=28. $ We formulate the solving normalized stationary points of relatively separable EPEC to a standard MPEC and solve the MPEC in Matlab R2010a. The computational results are
The results reveal that the proposed methods were able to solve normalized stationary points of relatively separable EPEC successfully.
Although the example is basic, it is thought to be competent to show the difficulties in this field of research and efficiency of our method.
We introduce relatively separable EPECs and solve its normalized stationary points, that result in a standard MPEC. In this approach, the special equilibrium problem with equilibrium constraints is solved by a single optimization problem, unlike the traditional approach that solve a sequence of related optimization problems. Additionally, we provide numerical results and application demonstrating our new approach.