A simplicial approach for discrete fixed point theorems

DOI10.1007/s00453-008-9183-1zbMath1176.58003OpenAlexW1993876750MaRDI QIDQ1014795

Xiaotie Deng, Xi Chen

Publication date: 29 April 2009

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-008-9183-1

zbMATH Keywords

fixed point theoremSperner's lemmasimplicial structuredirection-preserving map

Mathematics Subject Classification ID

Fixed-point theorems on manifolds (58C30)

Related Items (1)

The existence of equilibria for the rank game

Cites Work

• Exponential lower bounds for finding Brouwer fixed points
• The computation of fixed points and applications
• Sperner's lemma and robust machines
• A discrete fixed point theorem and its applications.
• Solving discrete zero point problems
• Discrete fixed point theorem reconsidered
• The complexity of computing a Nash equilibrium
• On algorithms for discrete and approximate brouwer fixed points
• A Simplicial Approach for Discrete Fixed Point Theorems
• On the Complexity of 2D Discrete Fixed Point Problem
• A class of simplicial restart fixed point algorithms without an extra dimension
• The Solution of Systems of Piecewise Linear Equations
• Lectures on Polytopes
• Homotopies for computation of fixed points
• Equilibrium Points of Bimatrix Games
• Lattice Embedding of Direction-Preserving Correspondence over Integrally Convex Set
• A Vector Labeling Method for Solving Discrete Zero Point and Complementarity Problems
• Fundamentals of Computation Theory
• The Approximation of Fixed Points of a Continuous Mapping
• Homotopies for computation of fixed points on unbounded regions

This page was built for publication: A simplicial approach for discrete fixed point theorems