Skip to main content
Log in

Computing equilibria for markets with constant returns production technologies

  • S.I.: SING 14
  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

This paper is concerned with the computation of equilibrium for an exchange economy with constant returns production technologies. We convert such an economy into a pure exchange economy by allocating the production to each consumer’s endowment evenly. In this way, the market clearing condition of the original economy is reformulated as that of a pure exchange economy, together with an additional complementarity condition to ensure the feasibility of production plans. A homotopy method is proposed to solve these two problems simultaneously. With this approach, the economic equilibrium model with constant returns production can be handled in a similar way to the pure exchange economy. A path-following algorithm is then developed for computing equilibria in these economies.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Notes

  1. T\({\hat{a}}\)tonnement processes Uzawa (1960) and global Newton methods Smale (1976) can also be used to find an equilibrium, but their computation is more complicated than homotopy methods and Newton methods.

  2. Simplicial methods are also theoretical sound. Any problem that can be solved by homotopy methods is also solvable with simplicial method. One main advantage of homotopy method is that the differentiability of the problem is considered, which makes it numerically more efficient in computation.

  3. Utilities are usually desired to be (at least) three times differentiable. If \(u^i\) is non-smooth, we need to use some regularization techniques in mathematical optimization. As we will see, utilities need not be strictly quasi-concave and strictly increasing. With our approach, the algorithm works if they are quasi-concave and non-decreasing.

  4. van der Laan and Kremers (1993) assume the cost function (the optimal value of (2)) is known and differentiable. Then, a optimal solution can be obtained by taking partial derivatives of the cost function with respect to prices.

  5. Since the matrix A(p) is defined according to the function \(a^k\), for each firm k, A(p) can be different if different \(a^k\) is chosen. For ease of reference, we use A(p) in the definition of equilibrium. This means that the equilibrium is defined according to the matrix function A(p), rather than the production functions \(\{f^k\}\). However, in many cases, it is non-trivial to determine A(p) with given \(\{f^k\}\). This issue will be addressed in the next section.

  6. In the literature, it is usually assumed that firms have owners. Consumer i’s profit share in firm k is given by \(\theta ^i_k\ge 0\), and \(\sum _i\theta ^i_k=1\) for each firm k. However, when firms have constant returns production technologies, they make zero profit from producing commodities at equilibria, which makes equilibria independent from consumers’ profit shares. If production has [for example, in Garg et al. (2018)] decreasing marginal returns, different values of \(\theta ^i\) would result in different equilibria.

  7. The cost function \(c^k:{\mathbb {R}}^m_+\rightarrow {\mathbb {R}}\) indicates the minimal cost to produce one unit of output of commodity \(\pi (k)\), given the prices for the inputs \(p^{-\pi (k)}\). From production theory, cost functions are continuous, see Varian (1992), but not necessarily differentiable.

  8. The introduction of variable q is not necessary. But as we will see in the next section, it makes easier the determination of a starting point of the path-following algorithm.

  9. According to this lemma, under the assumption of no production without input, there must exist a solution \(\xi \) to the system \(-A(q)^\top \xi \in {\mathbb {R}}^{m+1}_{++}\) with \(\xi \in {\mathbb {R}}^l_{++}\).

  10. If \(g:{\mathbb {R}}^m\rightarrow {\mathbb {R}}\) is concave and \(h:{\mathbb {R}}\rightarrow {\mathbb {R}}\) is convex and non-increasing, then the composition h(g(x)) is convex.

  11. (9) must have an optimal solution when \(t\in [0,1)\). The derivatives of the objective function in (9) decrease to \(-\infty \) as \(\alpha ^{-\pi (k)}\) nears the boundary, and converge to \(p>0\) as \(\alpha ^{-\pi (k)}\) becomes extremely large. From the continuity of the derivatives in the feasible set, there must exists \(\alpha ^{-\pi (k)}\) such that the derivatives equal zero.

  12. The logarithmic barrier terms approximate the 0-infinity indicator function on set \(C^k(p,t)\) as \(t\rightarrow 1\), and thus converge to zero if \(\alpha ^{-\pi (k)}\in C^k(p,t)\). For the use of logarithmic barrier function in constrained optimization, we refer interested readers to Chapter 11.2 in Boyd et al. (2004).

  13. The no production without input assumption (Assumption 1) is made on the original production activity matrix A(p), and hence on each \(f^k\). It is not hard to verify that this property also holds for the perturbed production matrix A(pt). From (9), we have \(f^k(\alpha ^{-\pi (k)})>1\) and/or \(\sum _{j\ne \pi (k)}q^0_j \alpha _j>1\). In the former case, the production activity with A(pt) is more inefficient. In the latter case, we have \(\sum _{j\ne \pi (k)}\alpha _j>1/\max _{j'}\{q^0_{j'}\}>1\). Then, \((A(p,t)y)_j=\sum _{k:\pi (k)=j}y_k-\sum _{k:\pi (k)\ne j} y_k \alpha ^k_j\) and we have \(\sum _j(A(p,t)y)_j = \sum _k y_k- \sum _k y_k\sum _{j\ne \pi (k)}\alpha ^k_j = \sum _k y_k(1- \sum _{j\ne \pi (k)}\alpha ^k_j)\le 0\) if \(y\ge 0\). Therefore, \(A(p,t)y\ge 0\) and \(y\ge 0\) implies \(y=0\).

  14. To compute an equilibrium, the utility functions need not to be strictly increasing or even differentiable. The logarithmic term in (5) makes the agents face strictly increasing and concave utilities in the artificial economies along the homotopy path. The nondifferentiablity can be smoothed with the regularization technique in Zhan and Dang (2018).

  15. The activity matrix A violates our definition in Sect. 2, as there are two commodities as outputs and the quantities of outputs are not normalized to one. However, it can be handled with our approach.

  16. The values of endowments and coefficients of utilities are picked uniformly at random from [1, 2]. For the activity matrix A, to satisfy Assumption 1, half of the commodities are set as inputs while others are outputs. Absolute value of each element in the matrix is drawn uniformly at random from [1, 2].

  17. The algorithm in Zhan and Dang (2018) is applicable to all utility functions that can be expressed as \(u(x)=\min \{ f^1(x),f^2(x),\dots ,f^k(x)\}\) with \(f^\ell (x)\) being a smooth concave function for all \(\ell \). The efficiency of this algorithm is shown with a numerical comparison to the complementarity pivot algorithm in Garg et al. (2015).

References

  • Allgower, E. L., & Georg, K. (1990). Numerical continuation methods: An introduction. New York: Springer.

    Book  Google Scholar 

  • Arrow, K. J., & Debreu, G. (1954). Existence of an equilibrium for a competitive economy. Econometrica, 265–290.

  • Borkovsky, R. N., Doraszelski, U., & Kryukov, Y. (2010). A user’s guide to solving dynamic stochastic games using the homotopy method. Operations Research, 58(4–part–2), 1116–1132.

    Article  Google Scholar 

  • Boyd, S., Boyd, S. P., & Vandenberghe, L. (2004). Convex optimization. Cambridge: Cambridge University Press.

    Book  Google Scholar 

  • Brown, D. J., DeMarzo, P. M., & Eaves, B. C. (1996). Computing zeros of sections of vector bundles using homotopies and relocalization. Mathematics of Operations Research, 21(1), 26–43.

    Article  Google Scholar 

  • Burfisher, M. E. (2017). Introduction to computable general equilibrium models. Cambridge: Cambridge University Press.

    Google Scholar 

  • Chen, X., Dai, D., Du, Y., & Teng, S.-H. (2009). Settling the complexity of Arrow–Debreu equilibria in markets with additively separable utilities. In Proceedings of FOCS, 273–282.

  • Chen, Y., & Dang, C. (2019). A differentiable homotopy method to compute perfect equilibria. Mathematical Programming, 1–33.

  • Dafermos, S. (1990). Exchange price equilibria and variational inequalities. Mathematical Programming, 46(1), 391–402.

    Article  Google Scholar 

  • Dang, C., Ye, Y., & Zhu, Z. (2011). An interior-point path-following algorithm for computing a Leontief economy equilibrium. Computational Optimization and Applications, 50(2), 223–236.

    Article  Google Scholar 

  • Eaves, B. C. (1972). Homotopies for computation of fixed points. Mathematical Programming, 3(1), 1–22.

    Article  Google Scholar 

  • Eaves, B. C. (1986). Thoughts on computing market equilibrium with SLCP. The Computation and Modelling of Economic Equilibria (A. Talman and G. van der Laan, Eds), pp 1–17.

  • Eaves, B. C., & Schmedders, K. (1999). General equilibrium models and homotopy methods. Journal of Economic Dynamics and Control, 23(9), 1249–1279.

    Article  Google Scholar 

  • Esteban-Bravo, M. (2004). Computing equilibria in general equilibrium models via interior-point methods. Computational Economics, 23(2), 147–171.

    Article  Google Scholar 

  • Esteban-Bravo, M. (2008). An interior-point algorithm for computing equilibria in economies with incomplete asset markets. Journal of Economic Dynamics and Control, 32(3), 677–694.

    Article  Google Scholar 

  • Facchinei, F., & Pang, J.-S. (2007). Finite-dimensional variational inequalities and complementarity problems. New York: Springer.

    Google Scholar 

  • Garg, J., Mehta, R., Sohoni, M., & Vazirani, V. V. (2015). A complementary pivot algorithm for market equilibrium under separable, piecewise-linear concave utilities. SIAM Journal on Computing, 44(6), 1820–1847.

    Article  Google Scholar 

  • Garg, J., Mehta, R., & Vazirani, V. V. (2018). Substitution with satiation: A new class of utility functions and a complementary pivot algorithm. Mathematics of Operations Research, 43(3), 996–1024.

    Article  Google Scholar 

  • Herings, P. J. J., & Kubler, F. (2002). Computing equilibria in finance economies. Mathematics of Operations Research, 27(4), 637–646.

    Article  Google Scholar 

  • Herings, P. J. J., & Peeters, R. (2005). A globally convergent algorithm to compute all nash equilibria for n-person games. Annals of Operations Research, 137(1), 349–368.

    Article  Google Scholar 

  • Herings, P. J. J., & Peeters, R. (2010). Homotopy methods to compute equilibria in game theory. Economic Theory, 42(1), 119–156.

    Article  Google Scholar 

  • Herings, P. J. J., & Schmedders, K. (2006). Computing equilibria in finance economies with incomplete markets and transaction costs. Economic Theory, 27(3), 493–512.

    Article  Google Scholar 

  • Jain, K. (2007). A polynomial time algorithm for computing an Arrow–Debreu market equilibrium for linear utilities. SIAM Journal on Computing, 37(1), 303–318.

    Article  Google Scholar 

  • Jofré, A., Rockafellar, R. T., & Wets, R. J. (2007). Variational inequalities and economic equilibrium. Mathematics of Operations Research, 32(1), 32–50.

    Article  Google Scholar 

  • Mas-Colell, A. (1974). A note on a theorem of F. Browder Mathematical Programming, 6(1), 229–233.

    Article  Google Scholar 

  • Merrill, O. (1972). Applications and extensions of an algorithm that computes fixed points of certain upper semi-continuous point to set mappings. University of Michigan, Ph. D. Thesis.

  • Scarf, H. (1967). The approximation of fixed points of a continuous mapping. SIAM Journal on Applied Mathematics, 15(5), 1328–1343.

    Article  Google Scholar 

  • Schmedders, K. (1999). A homotopy algorithm and an index theorem for the general equilibrium model with incomplete asset markets. Journal of Mathematical Economics, 32(2), 225–241.

    Article  Google Scholar 

  • Shoven, J. B., & Whalley, J. (1992). Applying general equilibrium. Cambridge: Cambridge University Press.

    Google Scholar 

  • Smale, S. (1976). A convergent process of price adjustment and global Newton methods. Journal of Mathematical Economics, 3(2), 107–120.

    Article  Google Scholar 

  • Uzawa, H. (1960). Walras’ tatonnement in the theory of exchange. The Review of Economic Studies, 182–194.

  • van den Elzen, A., van der Laan, G., & Talman, D. (1994). An adjustment process for an economy with linear production technologies. Mathematics of Operations Research, 19(2), 341–351.

    Article  Google Scholar 

  • van der Laan, G., & Kremers, H. (1993). On the existence and computation of an equilibrium in an economy with constant returns to scale production. Annals of Operations Research, 44(2), 143–160.

    Article  Google Scholar 

  • Varian, H. R. (1992). Microeconomic analysis (3rd ed.). New York: Norton.

    Google Scholar 

  • Vazirani, V. V., & Yannakakis, M. (2011). Market equilibrium under separable, piecewise-linear, concave utilities. Journal of the ACM, 58(3), 10.

    Article  Google Scholar 

  • Ye, Y. (2008). A path to the Arrow–Debreu competitive market equilibrium. Mathematical Programming, 111(1–2), 315–348.

    Google Scholar 

  • Zhan, Y., & Dang, C. (2018). A smooth path-following algorithm for market equilibrium under a class of piecewise-smooth concave utilities. Computational Optimization and Applications, 71(2), 381–402.

    Article  Google Scholar 

  • Zhu, Z., Dang, C., & Ye, Y. (2012). A FPTAS for computing a symmetric Leontief competitive economy equilibrium. Mathematical Programming, 131(1), 113–129.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yang Zhan.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

This work was partially supported by National Nature Science Foundation of China (61976184).

Appendix

Appendix

Theorem 4

(Transversality Theorem) Let \(L:S\times {\mathbb {R}}^l\rightarrow {\mathbb {R}}^s\) be \(C^r\), where \(S\subset {\mathbb {R}}^n\) is an open set and \(r\ge 1+\max \{0,n-s\}\). If zero is a regular value of L, then zero is a regular value of \(L(\cdot ,{\hat{\gamma }}):S\rightarrow {\mathbb {R}}^s\) for almost all fixed \({\hat{\gamma }}\in {\mathbb {R}}^l\).

The proof for Lemma 3.

Proof

According to (8), the Jacobian matrix of \(H(\theta ,t)\) is given by

$$\begin{aligned} DH(\theta ,t)= \left[ \begin{array}{c@{\quad }c@{\quad }c@{\quad }c@{\quad }c} U &{} W_q &{} W_y &{} \mathbf{0} &{} T_{1}\\ -tI_{m+1} &{} I_{m+1}&{} \mathbf{0} &{} \mathbf{0} &{}q^0-p \\ A(q,t)^\top &{} Q^\top p &{} \mathbf{0} &{} I_{l} &{} T_{2}\\ \mathbf{0} &{}\mathbf{0} &{}diag(v) &{} diag(y) &{} -r^{0} \end{array}\right] _{s\times (s+1)}, \end{aligned}$$

where \(I_{m+1}\) and \(I_l\) are identity matrices of \((m+1)\times (m+1)\) and \(l\times l\), respectively, U is the derivative of \(\sum _ix^i(p,q,y,t)\) with respect to p, \(W_q\) and \(W_y\) are derivatives of \(\sum _i{\overline{\omega }}^i(q,y,t)\) with respect to q and y, respectively, and Q is the derivative of A(qt) with respect to q. At \(t=0\) and \(H(\theta ,0)=0\), \(U=-diag((1/p^0_j)_{j\in M})\), \(W_q=\mathbf{0} \) and \(W_y=\mathbf{0} \). With the fact that \(p=p^0\in {\mathbb {R}}^{m+1}_{++}\) and \(v=v^0\in {\mathbb {R}}^l_{++}\), the Jacobian matrix is clearly of full row rank. \(\square \)

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zhan, Y., Dang, C. Computing equilibria for markets with constant returns production technologies. Ann Oper Res 301, 269–284 (2021). https://doi.org/10.1007/s10479-020-03733-2

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-020-03733-2

Keywords

Navigation