On the stability of finding approximate fixed points by simplicial methods
DOI10.1186/S13660-016-1162-5zbMATH Open1354.55003OpenAlexW2520273147WikidataQ59466215 ScholiaQ59466215MaRDI QIDQ314957FDOQ314957
Authors: Qi-Qing Song, Guang-Hui Yang, Chong-Yi Zhong, Hui Yang 
Publication date: 19 September 2016
Published in: Journal of Inequalities and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/s13660-016-1162-5
Recommendations
- scientific article; zbMATH DE number 4073956
- Constructive proofs of fixed point theorems for set valued operators by simplicial algorithms
- On computing fixed points using vector labelling and algorithms.
- A Simplicial Approach for Discrete Fixed Point Theorems
- scientific article; zbMATH DE number 4018247
Simplicial sets and complexes in algebraic topology (55U10) Fixed points and coincidences in algebraic topology (55M20)
Cites Work
- Equilibrium points in n -person games
- Essential equilibria of \(n\)-person noncooperative games
- The stability of the set of KKM points
- On existence and essential stability of solutions of symmetric variational relation problems
- Essential and Non Essential Fixed Points
- Existence of an Equilibrium for a Competitive Economy
- The Approximation of Fixed Points of a Continuous Mapping
- Essential equilibria in normal-form games
- Sensitivity analysis for generalized quasi-variational relation problems in locally \(G\)-convex spaces
- Generic stability and essential components of generalized KKM points and applications
- Title not available (Why is that?)
- Title not available (Why is that?)
- Essential Sets and Fixed Points
- Essential stability of solutions for maximal element theorem with applications
- Fixed points of contractible valued correspondences
- Sandwich method for finding fixed points
- The essential components of coincident points for weakly inward and outward set-valued mappings
- On the existence and essential components of solution sets for systems of generalized quasi-variational relation problems
- Invarianz bei linearen Approximationen
- On essential sets of fixed points for functions
- Pricing network edges for heterogeneous selfish users
- A class of simplicial restart fixed point algorithms without an extra dimension
- A restart algorithm for computing fixed points without an extra dimension
- Essential components of Nash equilibria for games parametrized by payoffs and strategies
- Homotopies for computation of fixed points
- The stability of coincident points for multivalued mappings
- Essential equilibria
- SIMPLICIAL APPROXIMATION OF FIXED POINTS
- Homotopy methods to compute equilibria in game theory
- On the stability of the solution for multiobjective generalized games with the payoffs perturbed
Cited In (5)
- Intermediate value theorem for simplices for simplicial approximation of fixed points and zeros
- A Simplicial Algorithm for Computing Robust Stationary Points of a Continuous Function on the Unit Simplex
- Title not available (Why is that?)
- Title not available (Why is that?)
- Constructive proofs of fixed point theorems for set valued operators by simplicial algorithms
This page was built for publication: On the stability of finding approximate fixed points by simplicial methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q314957)
