Combinatorial integer labeling theorems on finite sets with applications
From MaRDI portal
Publication:963665
DOI10.1007/s10957-009-9603-7zbMath1187.90244OpenAlexW2118586355MaRDI QIDQ963665
Gerard van der Laan, Adolphus J. J. Talman, Zaifu Yang
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
Related Items (1)
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.
This page was built for publication: Combinatorial integer labeling theorems on finite sets with applications
