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

Computing Integral Solutions of Complementarity Problems

Contents:

Author Info

  • Gerard van der Laan

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

  • Dolf Talman

    ()
    (Tilburg University)

  • Zaifu Yang

    ()
    (Yokohama National University)

Abstract

In this paper an algorithm is proposed to find an integral solution of (nonlinear) complementarity problems. The algorithm starts with a nonnegative integral point and generates a unique sequence of adjacent integral simplices of varying dimension. Conditions are stated under which the algorithm terminates with a simplex one of whose vertices is an integral solution of the complementarity problem under consideration.

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/05006.pdf
Download Restriction: no

Bibliographic Info

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

as in new window
Length:
Date of creation: 10 Jan 2005
Date of revision:
Handle: RePEc:dgr:uvatin:20050006

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

Related research

Keywords: Discrete set; complementarity problem; algorithm; triangulation;

Other versions of this item:

Find related papers by JEL classification:

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. & Laan , G. van der, 1987. "Simplicial approximation of solutions to the nonlinear complementarity problem with lower and upper bounds," Open Access publications from Tilburg University urn:nbn:nl:ui:12-153048, Tilburg University.
  2. Iimura, Takuya, 2003. "A discrete fixed point theorem and its applications," Journal of Mathematical Economics, Elsevier, vol. 39(7), pages 725-742, September.
  3. C. E. Lemke, 1965. "Bimatrix Equilibrium Points and Mathematical Programming," Management Science, INFORMS, INFORMS, vol. 11(7), pages 681-689, May.
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 in new window

Cited by:
  1. Laan, G. van der & Talman, A.J.J. & Yang, Z.F., 2010. "Combinatorial integer labeling theorems on finite sets with applications," Open Access publications from Tilburg University urn:nbn:nl:ui:12-3764045, Tilburg University.
  2. Laan, G. van der & Talman, A.J.J. & Yang, Z.F., 2011. "Solving discrete systems of nonlinear equations," Open Access publications from Tilburg University urn:nbn:nl:ui:12-4839550, Tilburg University.
  3. Talman, A.J.J. & Yang, Z.F., 2006. "A Discrete Multivariate Mean Value Theorem with Applications," Discussion Paper, Tilburg University, Center for Economic Research 2006-106, Tilburg University, Center for Economic Research.
  4. Laan, G. van der & Talman, A.J.J. & Yang, Z.F., 2005. "Solving Discrete Zero Point Problems with Vector Labeling," Discussion Paper, Tilburg University, Center for Economic Research 2005-122, Tilburg University, Center for Economic Research.
  5. Gerard van der Laan & Dolf Talman & Zaifu Yang, 2007. "Combinatorial Integer Labeling Theorems on Finite Sets with an Application to Discrete Systems of Nonlinear Equations," Tinbergen Institute Discussion Papers, Tinbergen Institute 07-084/1, Tinbergen Institute.
  6. Gerard van der Laan & Dolf Talman & Zaifu Yang, 2009. "Solving Discrete Systems of Nonlinear Equations," Tinbergen Institute Discussion Papers, Tinbergen Institute 09-062/1, Tinbergen Institute.
  7. 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.

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:20050006. 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.