Combinatorial integer labeling theorems on finite sets with applications

DOI10.1007/s10957-009-9603-7zbMath1187.90244MaRDI QIDQ963665

Gerard van der Laan, Zaifu Yang, Adolphus J. J. Talman

Publication date: 13 April 2010

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-009-9603-7

zbMATH Keywords

integer labeling; Tucker lemma; discrete nonlinear equations; simplicial algorithms; sperner lemma

Mathematics Subject Classification ID

90C27: Combinatorial optimization

Related Items

Existence of a pure strategy equilibrium in finite symmetric games where payoff functions are integrally concave

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Combinatorial analogs of Brouwer's fixed-point theorem on a bounded polyhedron
• Nash equilibrium with strategic complementarities
• A discrete multivariate mean value theorem with applications
• A constructive proof of a permutation-based generalization of Sperner's lemma
• A constructive proof of Tucker's combinatorial lemma
• The computation of fixed points and applications
• Walrasian equilibrium with gross substitutes
• Discrete convexity and unimodularity. I.
• Computing integral solutions of complementarity problems
• Solving discrete zero point problems
• Submodular functions and optimization.
• Discrete fixed point theorem reconsidered
• On the Solutions of Discrete Nonlinear Complementarity and Related Problems
• On the existence and approximation of zeroes
• Equilibria and Indivisibilities: Gross Substitutes and Complements
• A Theory of Exit in Duopoly
• Combinatorial Theorems on the Simplotope that Generalize Results on the Simplex and Cube
• ORIENTABILITY OF PSEUDOMANIFOLD AND GENERALIZATIONS OF SPERNER'S LEMMA
• A class of simplicial restart fixed point algorithms without an extra dimension
• A Modified Integer Labeling for Complementarity Algorithms
• On the Computation of Fixed Points in the Product Space of Unit Simplices and an Application to Noncooperative N Person Games
• Job Matching, Coalition Formation, and Gross Substitutes
• A restart algorithm for computing fixed points without an extra dimension
• Homotopies for computation of fixed points
• Discrete Convex Analysis
• A Vector Labeling Method for Solving Discrete Zero Point and Complementarity Problems
• Simplicial maps from an orientable n-pseudomanifold into Sm with the octahedral triangulation
• The Approximation of Fixed Points of a Continuous Mapping
• SIMPLICIAL APPROXIMATION OF FIXED POINTS
• Existence of balanced simplices on polytopes.