Solving Discrete Zero Point Problems with Vector Labeling

Gerard van der Laan, Dolf Talman () and Zaifu Yang ()
Additional contact information
Zaifu Yang: Faculty of Business Administration, Yokohama University

No 05-106/1, Tinbergen Institute Discussion Papers from Tinbergen Institute

Abstract: 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 Zⁿ to the n-dimensional Euclidean space Rⁿ. 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.

Keywords: integer lattice; zero point; vector labeling rule; simplicial algorithm; Borsuk-Ulam; discrete complementarity (search for similar items in EconPapers)
JEL-codes: C61 C62 C68 C72 (search for similar items in EconPapers)
Date: 2005-11-28
View list of references View citations in EconPapers

Downloads: (external link)
http://www.tinbergen.nl/discussionpapers/05106.pdf (application/pdf)

Related works:
Working Paper: Solving discrete zero point problems with vector labeling (2005)
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: http://EconPapers.repec.org/RePEc:dgr:uvatin:20050106

Access Statistics for this paper

More papers in Tinbergen Institute Discussion Papers from Tinbergen Institute
Series data maintained by Walther Schoonenberg ().