Combinatorial integer labeling theorems on finite sets with applications

DOI10.1007/S10957-009-9603-7MaRDI QIDQ963665zbMATH OpenOpenAlexFDO

Authors Gerard van der Laan, Dolf Talman, Zaifu Yang

Publication date 13 April 2010

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

Copyright license Creative Commons Attribution-NonCommercial 4.0 International

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

zbMATH Keywords

Tucker lemmadiscrete nonlinear equationsinteger labelingsimplicial algorithmssperner lemma

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• scientific article; zbMATH DE number 1802665
• Combinatorial Theorems on the Simplotope that Generalize Results on the Simplex and Cube
• Existence of balanced simplices on polytopes.
• A Vector Labeling Method for Solving Discrete Zero Point and Complementarity Problems
• A combinatorial analog of a theorem of F.J. Dyson

Cites work

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

Cited in

(2)

• Existence of a pure strategy equilibrium in finite symmetric games where payoff functions are integrally concave
• scientific article; zbMATH DE number 1802665 (Why is no real title available?)

This page was built for publication: Combinatorial integer labeling theorems on finite sets with applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q963665)