Skip to main content

Equilibria and Weighted Complementarity Problems

  • Conference paper
  • First Online:
Numerical Analysis and Optimization (NAO 2017)

Part of the book series: Springer Proceedings in Mathematics & Statistics ((PROMS,volume 235))

Included in the following conference series:

  • 965 Accesses

Abstract

We review some results about market equilibria and weighted complementarity problems (wCP). The latter problem consists in finding a pair of vectors (xs) belonging to the intersection of a manifold with a cone, such that their product in a certain algebra, \(x\circ s\), equals a given weight vector w. When w is the zero vector, then wCP reduces to a Complementarity Problem (CP). The motivation for introducing the more general notion of a wCP lies in the fact that several equilibrium problems in economics can be formulated in a natural way as wCP. Moreover, those formulations lend themselves to the development of highly efficient algorithms for solving the corresponding equilibrium problems. For example, Fisher’s competitive market equilibrium model can be formulated as a wCP that can be efficiently solved by interior-point methods. The Quadratic Programming and Weighted Centering problem, which generalizes the notion of a Linear Programming and Weighted Centering problem proposed by Anstreicher, can also be formulated as a special linear monotone wCP. The paper summarizes some previous results about the convergence of two interior-point methods for general monotone linear wCP and a corrector-predictor method for sufficient linear wCP. Some recent smoothing Newton methods for monotone linear wCP are also presented.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Achdou, Y., Pironneau, O.: Computational Methods for Option Pricing, vol. 30 of Frontiers in Applied Mathematics. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA, 2005

    Google Scholar 

  2. Amundson, N.R., Caboussat, A., He, J.W., Seinfeld, J.H.: Primal-dual interior-point method for an optimization problem related to the modeling of atmospheric organic aerosols. J. Optim. Theory Appl. 130(3), 375–407 (2006)

    Article  MathSciNet  Google Scholar 

  3. Anitescu, M., Lesaja, G., Potra, F.A.: Equivalence between different formulations of the linear complementarity problem. Optim. Methods Softw. 7(3), 265–290 (1997)

    Article  MathSciNet  Google Scholar 

  4. Anstreicher, K.M.: Volumetric path following algorithms for linear programming. Math. Program. 76(1, Ser. B):245–263 (1997)

    Article  MathSciNet  Google Scholar 

  5. Anstreicher, K.M.: Interior-point algorithms for a generalization of linear programming and weighted centring. Optim. Methods Softw. 27(4–5), 605–612 (2012)

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  7. Atkinson, D.S., Vaidya, P.M.: A scaling technique for finding the weighted analytic center of a polytope. Math. Program. 57(2, Ser. B), 163–192 (1992)

    Article  MathSciNet  Google Scholar 

  8. Benson, H.Y., Sen, A., Shanno, D.F., Vanderbei, R.J.: Interior-point algorithms, penalty methods and equilibrium problems. Comput. Optim. Appl. 34(2), 155–182 (2006)

    Article  MathSciNet  Google Scholar 

  9. Bonnans, J.F., Gonzaga, C.C.: Convergence of interior point algorithms for the monotone linear complementarity problem. Mathe. Oper. Res. 21, 1–25 (1996)

    Article  MathSciNet  Google Scholar 

  10. Bonnans, J.F., Potra, F.A.: On the convergence of the iteration sequence of infeasible path following algorithms for linear complementarity problems. Mathe. Oper. Res. 22(2), 378–407 (1997)

    Article  MathSciNet  Google Scholar 

  11. Caboussat, A., Leonard, A.: Numerical method for a dynamic optimization problem arising in the modeling of a population of aerosol particles. C. R. Math. Acad. Sci. Paris 346(11–12), 677–680 (2008)

    Article  MathSciNet  Google Scholar 

  12. Chen, X., Deng, X., Teng, S.-H.: Settling the complexity of computing two-player Nash equilibria. J. ACM 56(3):Art. 14, 57 (2009)

    Article  MathSciNet  Google Scholar 

  13. Chen, X., Huang, L.-S., Teng, S.-H.: Market equilibria with hybrid linear-Leontief utilities. Theoret. Comput. Sci. 410(17), 1573–1580 (2009)

    Article  MathSciNet  Google Scholar 

  14. Cottle, R.W., Pang, J.-S., Stone, R.E.: The Linear Complementarity Problem. Academic Press, Boston, MA (1992)

    MATH  Google Scholar 

  15. Cottle, R.W., Pang, J.-S., Venkateswaran, V.: Sufficient matrices and the linear complementarity problem. Linear Algebra Appl. 114(115), 231–249 (1989)

    Article  MathSciNet  Google Scholar 

  16. Daskalakis, C., Goldberg, P.W., Papadimitriou, C.H.: The complexity of computing a Nash equilibrium. SIAM J. Comput. 39(1), 195–259 (2009)

    Article  MathSciNet  Google Scholar 

  17. Denault, M., Pigeon, B.: Résolution numérique de problèmes de complémentarité linéaire et évaluation d’options américaines. INFOR Inf. Syst. Oper. Res. 42(1), 1–21 (2004)

    MathSciNet  Google Scholar 

  18. Devanur, N.R., Papadimitriou, C.H., Saberi, A., Vazirani, V.V.: Market equilibrium via a primal-dual algorithm for a convex program. J. ACM 55(5):Art. 22, 18 (2008)

    Article  MathSciNet  Google Scholar 

  19. Dong, L., Tang, J., Song, X.: A non-monotone inexact non-interior continuation method based on a parametric smoothing function for LWCP. Int. J. Comput. Math. 1–13 (2017)

    Google Scholar 

  20. Eisenberg, E., Gale, D.: Consensus of subjective probabilities: the pari-mutuel method. Ann. Math. Statist. 30, 165–168 (1959)

    Article  MathSciNet  Google Scholar 

  21. Esteban-Bravo, M.: Computing equilibria in general equilibrium models via interior-point methods. Comput. Econom. 23, 147–171 (2004)

    Article  Google Scholar 

  22. Esteban-Bravo, M.: An interior-point algorithm for computing equilibria in economies with incomplete asset markets. J. Econom. Dynam. Control 32(3), 677–694 (2008)

    Article  MathSciNet  Google Scholar 

  23. Facchinei, F., Pang, J.S.: Finite-dimensional Variational Inequalities and Complementarity Problems. Springer Series in Operations Research. Springer, New York (2003)

    MATH  Google Scholar 

  24. Ferris, M.C., Pang, J.S.: Engineering and economic applications of complementarity problems. SIAM Rev. 39(4), 669–713 (1997)

    Article  MathSciNet  Google Scholar 

  25. Fischer, A.: A special Newton-type optimization method. Optimization 24(3–4), 269–284 (1992)

    Article  MathSciNet  Google Scholar 

  26. Flores, P., Leine, R., Glocker, C.: Modeling and analysis of planar rigid multibody systems with translational clearance joints based on the non-smooth dynamics approach. Multibody Syst. Dyn. 23(2), 165–190 (2010)

    Article  MathSciNet  Google Scholar 

  27. Freund, R.M.: Projective transformations for interior-point algorithms, and a superlinearly convergent algorithm for the \({\rm w}\)-center problem. Math. Program. 58(3, Ser. A), 385–414 (1993)

    Google Scholar 

  28. Garg, D., Jain, K., Talwar, K., Vazirani, V.V.: A primal-dual algorithm for computing Fisher equilibrium in the absence of gross substitutability property. Theoret. Comput. Sci. 378(2), 143–152 (2007)

    Article  MathSciNet  Google Scholar 

  29. Goel, G., Vazirani, V.V.: A perfect price discrimination market model with production, and a rational convex program for it. Math. Oper. Res. 36(4), 762–782 (2011)

    Article  MathSciNet  Google Scholar 

  30. Gonzaga, C.C.: The largest step path following algorithm for monotone linear complementarity problems. Math. Program. 76(2, Ser. A), 309–332 (1997)

    Article  MathSciNet  Google Scholar 

  31. Gowda, M.S.: Reducing a monotone horizontal LCP to an LCP. Appl. Math. Lett. 8(1), 97–100 (1995)

    Article  MathSciNet  Google Scholar 

  32. Granas, A., Dugundji, J.: Fixed Point Theory. Springer Monographs in Mathematics. Springer, New York (2003)

    Book  Google Scholar 

  33. Güler, Osman: Generalized linear complementarity problems. Math. Oper. Res. 20(2), 441–448 (1995)

    Article  MathSciNet  Google Scholar 

  34. Gurtuna, F., Petra, C., Potra, F.A., Shevchenko, O., Vancea, A.: Corrector-predictor methods for sufficient linear complementarity problems. Comput. Optim. Appl. 48(3), 453–485 (2011)

    Article  MathSciNet  Google Scholar 

  35. Guu, S.-M., Cottle, R.W.: On a subclass of \({\bf P}_0\). Linear. Algebra. Appl. 223/224, 325–335 (1995). Special issue honoring Miroslav Fiedler and Vlastimil Pták

    Google Scholar 

  36. Ikonen, S., Toivanen, J.: Operator splitting methods for American option pricing. Appl. Math. Lett. 17(7), 809–814 (2004)

    Article  MathSciNet  Google Scholar 

  37. Jain, K.: A polynomial time algorithm for computing an Arrow-Debreu market equilibrium for linear utilities. SIAM J. Comput. 37(1), 303–318 (2007) (electronic)

    Article  MathSciNet  Google Scholar 

  38. Jain, K., Vazirani, V.V.: Eisenberg-Gale markets: algorithms and game-theoretic properties. Games Econom. Behav. 70(1), 84–106 (2010)

    Article  MathSciNet  Google Scholar 

  39. Jian, Z.: A smoothing Newton algorithm for weighted linear complementarity problem. Optim. Lett. 10(3), 499–509 (2016)

    Article  MathSciNet  Google Scholar 

  40. Kojima, M., Megiddo, N., Noma, T., Yoshise, A.: A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems. Lecture Notes in Comput, vol. 538. Sci. Springer, New York (1991)

    Book  Google Scholar 

  41. Koulisianis, M.D., Papatheodorou, T.S.: Pricing of American options using linear complementarity formulation: methods and their evaluation. Neural Parallel Sci. Comput. 11(4), 423–443 (2003)

    MathSciNet  MATH  Google Scholar 

  42. Landry, C., Caboussat, A., Hairer, E.: Solving optimization-constrained differential equations with discontinuity points, with application to atmospheric chemistry. SIAM J. Sci. Comput. 31(5), 3806–3826 (2009)

    Article  MathSciNet  Google Scholar 

  43. Liu, X., Potra, F.A.: Corrector-predictor methods for sufficient linear complementarity problems in a wide neighborhood of the central path. SIAM J. Optim. 17(3), 871–890 (2006)

    Article  MathSciNet  Google Scholar 

  44. McCartin, B.J., Labadie, S.M.: Accurate and efficient pricing of vanilla stock options via the Crandall-Douglas scheme. Appl. Math. Comput. 143(1), 39–60 (2003)

    MathSciNet  MATH  Google Scholar 

  45. McShane, K.A.: Superlinearly convergent \({O(\sqrt{n}L)}\)-iteration interior-point algorithms for linear programming and the monotone linear complementarity problem. SIAM J. Optim. 4(2), 247–261 (1994)

    Article  MathSciNet  Google Scholar 

  46. Mizuno, S., Todd, M.J., Ye, Y.: On adaptive-step primal-dual interior-point algorithms for linear programming. Mathe. Oper. Res. 18(4), 964–981 (1993)

    Article  MathSciNet  Google Scholar 

  47. Nesterov, Y., Nemirovsky, A.: Interior Point Polynomial Methods in Convex Programming. SIAM Publications. SIAM, Philadelphia (1994)

    Book  Google Scholar 

  48. Pfeiffer, F., Foerg, M., Ulbrich, H.: Numerical aspects of non-smooth multibody dynamics. Comput. Methods Appl. Mech. Engrg. 195(50–51), 6891–6908 (2006)

    Article  MathSciNet  Google Scholar 

  49. Potra, F.A.: Corrector-predictor methods for monontone linear complementarity problems in a wide neighborhood of the central path. Math. Program. 111(1-2, Ser. B), 243–272 (2008)

    Article  Google Scholar 

  50. Potra, F.A.: Weighted complementarity problems-a new paradigm for computing equilibria. SIAM J. Optim. 22(4), 1634–1654 (2012)

    Article  MathSciNet  Google Scholar 

  51. Potra, F.A., Liu, X.: Predictor-corrector methods for sufficient linear complementarity problems in a wide neighborhood of the central path. Optim. Methods Softw. 20(1), 145–168 (2005)

    Article  MathSciNet  Google Scholar 

  52. Potra, F.A., Ye, Y.: Interior-point methods for nonlinear complementarity problems. JOTA 88(3), 617–647 (1996)

    Article  MathSciNet  Google Scholar 

  53. Potra, F.A.: Sufficient weighted complementarity problems. Comput. Optim. Appl. 64(2), 467–488 (2016)

    Article  MathSciNet  Google Scholar 

  54. Stoer, J.: High order long-step methods for solving linear complementarity problems. Ann. Oper. Res. 103, 149–159 (2001). Optimization and numerical algebra (Nanjing, 1999)

    Google Scholar 

  55. Tasora, A., Anitescu, M.: A fast NCP solver for large rigid-body problems with contacts, friction, and joints. In: Multibody Dynamics, vol. 12 of Computer Methods Applied Science, pp. 45–55. Springer, Berlin (2009)

    Google Scholar 

  56. Vaidya, P.M.: A new algorithm for minimizing convex functions over convex sets. Math. Program 73(3, Ser. A), 291–341 (1996)

    Article  MathSciNet  Google Scholar 

  57. Väliaho, H.: \({P}_*\)-matrices are just sufficient. Linear Algebra its Appl. 239, 103–108 (1996)

    MathSciNet  MATH  Google Scholar 

  58. Vazirani, V.V.: The notion of a rational convex program, and an algorithm for the Arrow-Debreu Nash bargaining game. J. ACM 59(2):Art. 7, 36 (2012)

    Article  MathSciNet  Google Scholar 

  59. Vazirani, V.V., Yannakakis, M.: Market equilibrium under separable, piecewise-linear, concave utilities. J. ACM 58(3):Art. 10, 25 (2011)

    Article  MathSciNet  Google Scholar 

  60. Walras, L.: Éléments d’économie politique pure; ou. Théorie de la richesse socialle. L. Corbaz, Paris (1874)

    MATH  Google Scholar 

  61. Ye, Y.: Interior Point Algorithms: Theory and Analysis. Wiley-Interscience Series in Discrete Mathematics and Optimization, Wiley, Hoboken (1997)

    Book  Google Scholar 

  62. Ye, Y.: Exchange market equilibria with Leontief’s utility: freedom of pricing leads to rationality. Theoret. Comput. Sci. 378(2), 134–142 (2007)

    Article  MathSciNet  Google Scholar 

  63. Ye, Y.: A path to the Arrow-Debreu competitive market equilibrium. Math. Program. 111(1-2, Ser. B), 315–348 (2008)

    Article  MathSciNet  Google Scholar 

  64. Zhu, Y., Wu, X., Chern, I.: Derivative Securities and Difference Methods. Springer Finance. Springer, New York (2004)

    Book  Google Scholar 

  65. Zhu, Z. Dang, C., Ye, Y.: A FPTAS for computing a symmetric Leontief competitive economy equilibrium. Math. Program., 131(1-2, Ser. A), 113–129, 2012

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

This material is based upon work supported by the National Science Foundation under Grant No. DMS-1311923.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Florian A. Potra .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Potra, F.A. (2018). Equilibria and Weighted Complementarity Problems. In: Al-Baali, M., Grandinetti, L., Purnama, A. (eds) Numerical Analysis and Optimization. NAO 2017. Springer Proceedings in Mathematics & Statistics, vol 235. Springer, Cham. https://doi.org/10.1007/978-3-319-90026-1_12

Download citation

Publish with us

Policies and ethics