IDEAS home Printed from https://ideas.repec.org/p/tin/wpaper/20050106.html
   My bibliography  Save this paper

Solving Discrete Zero Point Problems with Vector Labeling

Author

Listed:
  • Gerard van der Laan

    (Faculty of Economics and Business Administration, Vrije Universiteit Amsterdam)

  • Dolf Talman

    (Department of Econometrics & Operations Research, and CentER, Tilburg University)

  • Zaifu Yang

    (Faculty of Business Administration, Yokohama University)

Abstract

This discussion paper resulted in a publication in the 'SIAM Journal on Optimization', 2007, 18, 290-308. In this paper we present two general results on the existence of a discrete zero point of a function from the n-dimensional integer lattice Zn to the n-dimensional Euclidean space Rn. Under two different boundary conditions, we give a constructive proof using a combinatorial argument based on a simplicial algorithm with vector labeling and lexicographic linear programming pivot steps. We also adept the algorithm to prove the existence of a solution to the discrete complementarity problem.

Suggested Citation

  • Gerard van der Laan & Dolf Talman & Zaifu Yang, 2005. "Solving Discrete Zero Point Problems with Vector Labeling," Tinbergen Institute Discussion Papers 05-106/1, Tinbergen Institute.
    • Handle: RePEc:tin:wpaper:20050106
    as

    Download full text from publisher

    File URL: https://papers.tinbergen.nl/05106.pdf
    Download Restriction: no
    ---><---

    Other versions of this item:

    References listed on IDEAS

    as
    1. van der Laan, G. & Talman, A.J.J. & Yang, Z.F., 2005. "Computing Integral Solutions of Complementarity Problems," Other publications TiSEM b8e0c74e-2219-4ab0-99a2-0, Tilburg University, School of Economics and Management.
    2. P. J. J. Herings & G. A. Koshevoy & A. J. J. Talman & Z. Yang, 2004. "General Existence Theorem of Zero Points," Journal of Optimization Theory and Applications, Springer, vol. 120(2), pages 375-394, February.
    3. Gerard van der Laan & Dolf Talman & Zaifu Yang, 2004. "Solving Discrete Zero Point Problems," Tinbergen Institute Discussion Papers 04-112/1, Tinbergen Institute.
    4. Iimura, Takuya, 2003. "A discrete fixed point theorem and its applications," Journal of Mathematical Economics, Elsevier, vol. 39(7), pages 725-742, September.
    5. Herbert E. Scarf, 1967. "The Approximation of Fixed Points of a Continuous Mapping," Cowles Foundation Discussion Papers 216R, Cowles Foundation for Research in Economics, Yale University.
    6. Talman, A.J.J. & van der Laan, G., 1979. "A restart algorithm for computing fixed points without an extra dimension," Other publications TiSEM 1f2102f8-e6da-4e9c-a2ed-9, Tilburg University, School of Economics and Management.
    7. C. E. Lemke, 1965. "Bimatrix Equilibrium Points and Mathematical Programming," Management Science, INFORMS, vol. 11(7), pages 681-689, May.
    8. G. van der Laan, 1981. "Simplicial fixed point algorithms," Statistica Neerlandica, Netherlands Society for Statistics and Operations Research, vol. 35(1), pages 58-58, March.
    9. Peter M. Reiser, 1981. "A Modified Integer Labeling for Complementarity Algorithms," Mathematics of Operations Research, INFORMS, vol. 6(1), pages 129-139, February.
    10. M. Seetharama Gowda & Jong-Shi Pang, 1992. "On Solution Stability of the Linear Complementarity Problem," Mathematics of Operations Research, INFORMS, vol. 17(1), pages 77-83, February.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Talman, Dolf & Yang, Zaifu, 2009. "A discrete multivariate mean value theorem with applications," European Journal of Operational Research, Elsevier, vol. 192(2), pages 374-381, January.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. van der Laan, Gerard & Talman, Dolf & Yang, Zaifu, 2011. "Solving discrete systems of nonlinear equations," European Journal of Operational Research, Elsevier, vol. 214(3), pages 493-500, November.
    2. Talman, Dolf & Yang, Zaifu, 2009. "A discrete multivariate mean value theorem with applications," European Journal of Operational Research, Elsevier, vol. 192(2), pages 374-381, January.
    3. van der Laan, G. & Talman, A.J.J. & Yang, Z.F., 2007. "A vector labeling method for solving discrete zero point and complementarity problems," Other publications TiSEM 070869d0-4e42-4d34-85f9-b, Tilburg University, School of Economics and Management.
    4. van der Laan, G. & Talman, A.J.J. & Yang, Z.F., 2007. "Combinatorial Integer Labeling Thorems on Finite Sets with an Application to Discrete Systems of Nonlinear Equations," Other publications TiSEM 264c28a5-10b6-44e1-9694-4, Tilburg University, School of Economics and Management.
    5. G. Laan & A. J. J. Talman & Z. Yang, 2010. "Combinatorial Integer Labeling Theorems on Finite Sets with Applications," Journal of Optimization Theory and Applications, Springer, vol. 144(2), pages 391-407, February.
    6. van der Laan, G. & Talman, A.J.J. & Yang, Z.F., 2005. "Computing Integral Solutions of Complementarity Problems," Other publications TiSEM b8e0c74e-2219-4ab0-99a2-0, Tilburg University, School of Economics and Management.
    7. Dolf Talman & Zaifu Yang, 2012. "On a Parameterized System of Nonlinear Equations with Economic Applications," Journal of Optimization Theory and Applications, Springer, vol. 154(2), pages 644-671, August.
    8. Gerard van der Laan & Dolf Talman & Zaifu Yang, 2004. "Solving Discrete Zero Point Problems," Tinbergen Institute Discussion Papers 04-112/1, Tinbergen Institute.
    9. Talman, A.J.J. & van der Heyden, L., 1981. "Algorithms for the linear complementarity problem which allow an arbitrary starting point," Research Memorandum FEW 99, Tilburg University, School of Economics and Management.
    10. Doup, T.M. & van der Laan, G. & Talman, A.J.J., 1984. "The (2n+1-2)-ray algorithm : A new simplicial algorithm to compute economic equilibria," Research Memorandum FEW 151, Tilburg University, School of Economics and Management.
    11. Chuangyin Dang & Hans van Maaren, 1998. "A Simplicial Approach to the Determination of an Integer Point of a Simplex," Mathematics of Operations Research, INFORMS, vol. 23(2), pages 403-415, May.
    12. Ruys, P.H.M. & van der Laan, G., 1987. "Computation of an industrial equilibrium," Research Memorandum FEW 257, Tilburg University, School of Economics and Management.
    13. C. Dang, 2001. "Computing an Integer Point of a Class of Convex Sets," Journal of Optimization Theory and Applications, Springer, vol. 108(2), pages 333-348, February.
    14. Jugal Garg & Ruta Mehta & Vijay V. Vaziranic, 2018. "Substitution with Satiation: A New Class of Utility Functions and a Complementary Pivot Algorithm," Mathematics of Operations Research, INFORMS, vol. 43(3), pages 996-1024, August.
    15. Herings, P.J.J. & Talman, A.J.J. & Yang, Z.F., 1999. "Variational Inequality Problems With a Continuum of Solutions : Existence and Computation," Other publications TiSEM 73e2f01b-ad4d-4447-95ba-a, Tilburg University, School of Economics and Management.
    16. R. B. Bapat & S. K. Neogy, 2016. "On a quadratic programming problem involving distances in trees," Annals of Operations Research, Springer, vol. 243(1), pages 365-373, August.
    17. Rahul Savani & Bernhard von Stengel, 2016. "Unit vector games," International Journal of Economic Theory, The International Society for Economic Theory, vol. 12(1), pages 7-27, March.
    18. Yang, Z.F., 1994. "A simplicial algorithm for testing the integral properties of polytopes : A revision," Other publications TiSEM 72b67872-ca37-4bb5-8a13-7, Tilburg University, School of Economics and Management.
    19. S. R. Mohan, 1997. "Degeneracy Subgraph of the Lemke Complementary Pivot Algorithm and Anticycling Rule," Journal of Optimization Theory and Applications, Springer, vol. 94(2), pages 409-423, August.
    20. Yang, Z.F., 1994. "A simplicial algorithm for testing the integral property of a polytope," Discussion Paper 1994-75, Tilburg University, Center for Economic Research.

    More about this item

    Keywords

    integer lattice; zero point; vector labeling rule; simplicial algorithm; Borsuk-Ulam; discrete complementarity;
    All these keywords.

    JEL classification:

    • C61 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Optimization Techniques; Programming Models; Dynamic Analysis
    • C62 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Existence and Stability Conditions of Equilibrium
    • C68 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Computable General Equilibrium Models
    • C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games
    • C58 - Mathematical and Quantitative Methods - - Econometric Modeling - - - Financial Econometrics

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:tin:wpaper:20050106. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Tinbergen Office +31 (0)10-4088900 (email available below). General contact details of provider: https://edirc.repec.org/data/tinbenl.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.