Combinatorial integer labeling theorems on finite sets with applications

DOI10.1007/S10957-009-9603-7zbMATH Open1187.90244OpenAlexW2118586355MaRDI QIDQ963665FDOQ963665

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)

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

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

zbMATH Keywords

Tucker lemmadiscrete nonlinear equationsinteger labelingsimplicial algorithmssperner lemma

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

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

Cited In (2)

• Existence of a pure strategy equilibrium in finite symmetric games where payoff functions are integrally concave
• Title not available (Why is that?)

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)