Advanced Search
MyIDEAS: Login to save this paper or follow this series

Solving Discrete Systems of Nonlinear Equations

Contents:

Author Info

  • Gerard van der Laan

    (VU University, Amsterdam, The Netherlands)

  • Dolf Talman

    (Tilburg University, The Netherlands)

  • Zaifu Yang

    (Yokohama National University, Japan)

Abstract

This discussion paper led to a publication in 'European Journal of Operational Research' , 214(3), 493-500. We study the existence problem of a zero point of a function defined on a finite set of elements of the integer lattice of the n-dimensional Euclidean space. It is assumed that the set is integrally convex, which implies that the convex hull of the set can be subdivided in simplices such that every vertex is an element of the integer lattice and each simplex of the triangulation lies in a cube of size one. With respect to this triangulation we assume that the function satisfies some property that replaces continuity. Under this property and some boundary condition the function has a zero point. To prove this we use a simplicial algorithm that terminates with a zero point within a finite number of iterations. The standard technique of applying a fixed point theorem to a piecewise linear approximation cannot be applied, because the `continuity property' is too weak to assure that a zero point of the piecewise linear approximation induces a zero point of the function itself. We apply the main existence result to prove the existence of a pure Cournot-Nash equilibrium in a Cournot oligopoly model. We further obtain a discrete analogue of the well-known Borsuk-Ulam theorem and a theorem for the existence of a solution for the discrete nonlinear complementarity problem.

Download Info

If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
File URL: http://papers.tinbergen.nl/09062.pdf
Download Restriction: no

Bibliographic Info

Paper provided by Tinbergen Institute in its series Tinbergen Institute Discussion Papers with number 09-062/1.

as in new window
Length:
Date of creation: 16 Jul 2009
Date of revision:
Handle: RePEc:dgr:uvatin:20090062

Contact details of provider:
Web page: http://www.tinbergen.nl

Related research

Keywords: Discrete system of equations; triangulation; simplicial algorithm; fixed point; zero point;

Other versions of this item:

Find related papers by JEL classification:

This paper has been announced in the following NEP Reports:

References

References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
as in new window
  1. Talman, A.J.J. & Yang, Z.F., 2009. "A discrete multivariate mean value theorem with applications," Open Access publications from Tilburg University urn:nbn:nl:ui:12-3129885, Tilburg University.
  2. Gerard van der Laan & Dolf Talman & Zaifu Yang, 2004. "Solving Discrete Zero Point Problems," Tinbergen Institute Discussion Papers 04-112/1, Tinbergen Institute.
  3. Herings, P.J.J. & Talman, A.J.J. & Yang, Z.F., 2001. "Variational inequality problems with a continuum of solutions: Existence and computation," Open Access publications from Tilburg University urn:nbn:nl:ui:12-86829, Tilburg University.
  4. Laan, G. van der & Talman, A.J.J. & Yang, Z.F., 2007. "Computing integral solutions of complementarity problems," Open Access publications from Tilburg University urn:nbn:nl:ui:12-327117, Tilburg University.
  5. Iimura, Takuya & Murota, Kazuo & Tamura, Akihisa, 2005. "Discrete fixed point theorem reconsidered," Journal of Mathematical Economics, Elsevier, vol. 41(8), pages 1030-1036, December.
  6. 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.
  7. Iimura, Takuya, 2003. "A discrete fixed point theorem and its applications," Journal of Mathematical Economics, Elsevier, vol. 39(7), pages 725-742, September.
  8. Laan, G. van der & Talman, A.J.J. & Yang, Z.F., 2007. "A vector labeling method for solving discrete zero point and complementarity problems," Open Access publications from Tilburg University urn:nbn:nl:ui:12-284192, Tilburg University.
  9. Talman, A.J.J. & Laan, G. van der, 1979. "A restart algorithm for computing fixed points without an extra dimension," Open Access publications from Tilburg University urn:nbn:nl:ui:12-153012, Tilburg University.
Full references (including those not matched with items on IDEAS)

Citations

Lists

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

Statistics

Access and download statistics

Corrections

When requesting a correction, please mention this item's handle: RePEc:dgr:uvatin:20090062. See general information about how to correct material in RePEc.

For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Antoine Maartens (+31 626 - 160 892)).

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 references are entirely missing, you can add them using this form.

If the full references list an item that is present in RePEc, but the system did not link 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 profile, as there may be some citations waiting for confirmation.

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