Abstract
We consider an environmental–economic game where players face not only Cournot competition but also coupling environmental and individual capacity constraints. Under the complementarity problem framework, we study the existence of the (normalized) Nash equilibrium, computability of the equilibria, and the closed form expressions of the optimal weights. We also report numerical results of two examples as well as the insights gained from them.
Similar content being viewed by others
Notes
See [1, Section 4.4] for detailed discussion of this assumption.
References
Cottle, R.W., Pang, J.S., Stone, R.E. (1992). The linear complementarity problem. Cambridge: Academic.
Facchinei, F.F., & Kanzow, C. (2007). Generalized Nash equilibrium problems. 4OR, 5, 173–210.
Facchinei, F., & Pang, J.S. (2003). Finite-dimensional variational inequalities and complementarity problems. New York: Springer.
Hanley, N., Shogren, J.F., White, B. (1997). Environmental economics: in theory and practice. New York: Oxford University Press.
Harker, P.T. (1991). Generalized nash games and quasivariational inequalities. European Journal of Operational Research, 54, 81–94
Haurie. A., & Krawczyk, J.B. (1997). Optimal charges on river effluent from lumped and distributed sources. Environmental Modeling and Assessment, 2, 93–106.
Haurie, A., & Krawczyk, J.B. (2002). An introduction to dynamic games. Internet textbook. http://ecoluinfo.unige.ch/haurie/fame/textbook.pdf. Accessed June 2011.
Hobbs, B.F., & Pang, J.S. (2007). Nash-Cournot equilibria in electric power markets with piecewise linear demand functons and joint constraints. Operations Research, 55, 113–127.
Krawczyk, J.B. (2005). Coupled constraint Nash equilibria in environmental games. Resource and Energy Economics, 27, 157–181.
Lemke, C.E. (1965). Bimatrix equilibrium points and mathematical programming. Management Science, 11, 681–689.
Lemke, C.E., & Howson, J.T. Jr. (1964). Equilibrium points of bimatrix games. SIAM Journal on Applied Mathematics, 12, 413–423.
Luo, Z.Q., Pang, J.S., Ralph, D. (1996).Mathematical programs with equilibrium constraints. New York: Cambridge University Press.
Meinshausen, M., Meinshausen, N., Hare, W., Raper, S.C.B., Frieler, K., Knutti, R., Frame, D.J., Allen, M.R. (2009). Greenhouse-gas emission targets for limiting global warming to 2 °C. Nature, 458, 1158–1163.
Pang, J.S., Han, L., Ramadurai, G., Ukkusuri, S. (2012). A continuous-time linear complementarity system for dynamic user equilibria in single bottleneck traffic flows. Mathematical programming series A . Math program, 133, 437–460 doi:10.1007/s10107-010-0433-z.
Rosen, J.B. (1965). Existence and uniqueness of equilibrium points for concave N-person games. Econometrica, 33, 520–534.
Tidball, M., & Zaccour, G. (2005). An environmental game with coupling constraints. Environmental Modeling and Assessment, 10, 153–158.
Tidball, M., & Zaccour, G. (2009). A differential environmental game with coupling constraints. Optimal Control Applications and Methods, 30, 197–207.
Jogensen, S., Martin-Herran, G., Zaccour, G. (2010). Dynamic games in the economics and management of pollution. Environmental Modeling and Assessment, 15, 433–467.
Acknowledgements
The authors would like to thank the two anonymous reviewers whose comments have significantly improved the presentation of this paper. The authors are also grateful to the editor-in-chief, Dr. Jerzy A. Filar, for his comments and suggestions that have made the paper much more readable to this journal’s audience.
Author information
Authors and Affiliations
Corresponding author
Appendix: Proofs
Appendix: Proofs
Proof of Theorem 1
We first look at the case when β > 0. It follows from Eq. (3) that given the rival firms’ strategies (production levels), each firm’s objective function is a strongly concave function since β > 0. Therefore, each firm’s optimization problem has a unique solution given that it is feasible. Define the feasible set of the game as
where \(\mbox{CAP} \triangleq \left(\mbox{CAP}_f\right)_{f=1,\cdots,\nu}\) and \(e \triangleq \left(e_f\right)_{f=1,\cdots,\nu}\). Given a vector \(p\in \mathcal F\), and an index f ∈ {1, ⋯ ,ν}, define the set
where \(e_{-f} \triangleq \left(e_g \right)_{g\neq f}\) is the vector of coefficients e g of all rival firms. For any given \(p\in \mathcal F\), it is clear that \(\mathcal F_f(p_{-f})\) is nonempty for all f. Therefore, the individual firm’s optimization problem must have a unique solution. In this case, we use \(\mbox{argmax}_{p_f\in \mathcal F_f(p_{-f})}\{h_f(p_f,p_{-f})\}\) to refer to the unique solution, instead of the solution set. For any \(p \in \mathcal F\), define the map
It can be easily verified that Φ(p) is a self map, that is, \(\Phi(p) \in \mathcal F\) for all \(p\in \mathcal F\). Applying classical optimization theory, we can show that Φ(p) is a continuous function of p. In fact, the KKT optimality condition for an individual firm’s optimization problem is as follows: if \(p^*_f = \mbox{argmax}_{p_f\in \mathcal F_f(p_{-f})}\{h(p_f,p_{-f})\}\), then there exist multipliers λ f , μ f , and ξ f such that
Solving ξ f from the first equation and substituting into the last complementarity condition, we obtain the following complementarity problem
Notice that in Eq. (20), d f , e f , c f , and \(\mbox{CAP}_f\) are given data, and Q − f and E − f depends on the rival’s strategy. Notice also that Q − f and E − f are both determined by p f , therefore, we denote Eq. (20) by LCP f (q − f ), and the solution set by \(\mbox{SOL}_f(q_f)\). We now consider the set-valued map \(\Xi_f: q_f \rightrightarrows \mbox{SOL}_f(q_{-f})\). It is clear that the Ξ f is a polyhedron multifunction, namely, the graph of Ξ f can be represented by a union of finite number of polyhedra. Let matrix
define the map \(\widehat{\Xi}_f : q_{-f} \rightrightarrows B\mbox{SOL}_f(q_{-f})\). By the uniqueness of the solution to the individual optimization problem, we know that \(\widehat{\Xi}\) is a single-valued polyhedron multifunction. Thus, by a result in [3, Exercise 5.6.14], \(\widehat{\Xi}_f : q_{-f} \rightrightarrows B\mbox{SOL}_f(q_{-f})\) is in fact a piecewise affine function and hence continuous. Therefore, the map from p − f to \(p^*_f = B\mbox{SOL}_f(q_{-f})\) is a continuous map and so is the map Φ(p). Notice that the set \(\mathcal F\) is compact convex, and the function Φ(p) is a continuous self map from \(\mathcal F\) to \(\mathcal F\). By Brouwer’s fixed point theorem, Φ(p) must have a fixed point \(p^* \in \mathcal F\), namely, Φ(p *) = p *. By the definition of the equilibrium state of the game, p * must be an equilibrium state.
When β = 0, the individual firm’s optimization problem is still convex but not strongly convex, and hence the map Φ(p) is a set-valued map. Therefore, one needs to apply the Kakutani fixed theorem to conclude the equilibrium existence. The details are omitted here. □
Proof Lemma 2
Given a vector \(y= \left(\begin{array}{c}p\\ \kappa \\ \mu \end{array}\right) \gvertneqq 0\), we have
Suppose p f > 0 for some f ∈ {1, ⋯ ,ν}, then the fth component in
is given by
Therefore, we may assume that p f = 0 for all f = 1, ⋯ ,ν. Now, if κ > 0, the corresponding component in H N is e T p = 0. If μ f > 0 for some f ∈ {1, ⋯ ,ν}, the corresponding component in H N is p f = 0. This concludes the proof.□
Proof of Theorem 2
We have shown that H N is semimonotone in Lemma 2. Now assume that there exists τ > 0 such that SOL\((h^N + \tau \mathbf 1_{2\nu+1}, \mathbf H^N)\) contains a sequence of solutions \((p^k,\kappa^k,\mu^k)_{k=1}^{\infty}\) such that
It is clear that p k must be bounded since \(p^k \leq \mbox{CAP} + \tau \mathbf 1_{\nu}\), that is, \(p_f^k \leq \overline{\mbox{CAP}}_f + \tau \) for each f = 1, ⋯ ,ν. We claim that κ k must be bounded. Suppose not, then we can assume without loss of generality that κ k > 0 for all k sufficiently large. Therefore, by the second complementarity condition in Eq. (21), we conclude that
for all k sufficiently large. We can also see that \(e_f \kappa^k\) is unbounded for all f = 1, ⋯ ,ν since e f > 0 for all f = 1, ⋯ ,ν. Therefore we have
must be unbounded for all f = 1, ⋯ ,ν since α is a fixed number. Now, by the first complementarity condition in Eq. (21), we deduce that p k = 0 for all k sufficiently large. However,
for all k sufficiently large. This is a contradiction. Similarly, if μ k is unbounded, that is, \(\mu_f^k\) is unbounded for some f ∈ {1, ⋯ ,ν}, then
for all k sufficiently large. Moreover,
must be unbounded. By the first complementarity condition in Eq. (21), we must have \(p^k_f = 0\) for all k sufficiently large. This is again a contradiction. Thus, we can conclude that μ k must also be bounded. Therefore, for any given τ, SOL\((h^N + \tau \mathbf 1_{2\nu+1}, \mathbf H^N)\) is bounded. By Lemma 1, the theorem holds readily. □
Remark 3
As pointed out by one of the reviewer, this proof actually follows the proof of Theorem 1 in the study by Rosen [15], but has been presented in the particular context of this paper. We include it here for completeness.
Rights and permissions
About this article
Cite this article
Han, L., Ukkusuri, S.V. A Complementarity Approach for an Environmental–Economic Game with Coupling Emission Constraints. Environ Model Assess 18, 147–158 (2013). https://doi.org/10.1007/s10666-012-9335-1
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10666-012-9335-1