Please use this identifier to cite or link to this item: http://hdl.handle.net/10419/86352
Authors: 
van der Laan, Gerard
Talman, Dolf
Yang, Zaifu
Year of Publication: 
2005
Series/Report no.: 
Tinbergen Institute Discussion Paper 05-106/1
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 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.
Subjects: 
integer lattice
zero point
vector labeling rule
simplicial algorithm
Borsuk-Ulam
discrete complementarity
JEL: 
C61
C62
C68
C72
C58
Document Type: 
Working Paper

Files in This Item:
File
Size
256.45 kB





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.