The computation of fixed points and applications
From MaRDI portal
Publication:1228114
zbMath0332.54003MaRDI QIDQ1228114
Publication date: 1976
Published in: Lecture Notes in Economics and Mathematical Systems (Search for Journal in Brave)
Set-valued maps in general topology (54C60) Continuous maps (54C05) Trade models (91B60) Fixed-point and coincidence theorems (topological aspects) (54H25) Fixed points and coincidences in algebraic topology (55M20) Research exposition (monographs, survey articles) pertaining to general topology (54-02) Algorithms in computer science (68W99)
Related Items
On the complexity of a piecewise linear algorithm for approximating roots of complex polynomials, A combinatorial lemma and its applications, A continuous deformation algorithm for variational inequality problems on polytopes, A simplicial homotopy algorithm for computing zero points on polytopes, Remarks on endpoints of multivalued mappings in geodesic spaces, Fast parameter estimation in loss tomography for networks of general topology, Covering with Euclidean boxes, A relaxed-projection splitting algorithm for variational inequalities in Hilbert spaces, Using convex envelopes to solve the interactive fixed-charge linear programming problem, Computing economic equilibria using benefit and surplus functions, On the complexity of an expanded Tarski's fixed point problem under the componentwise ordering, A remark on discontinuity at fixed point, Homotopy methods to compute equilibria in game theory, A PL homotopy continuation method with the use of an odd map for the artificial level, On the geometry of paths generated by PL homotopy methods, Solving non-monotone equilibrium problems via a DIRECT-type approach, A variant of Harsanyi's tracing procedures to select a perfect equilibrium in normal form games, The topological correctness of PL approximations of isomanifolds, Notes on computation of Kakutani fixed points, On approximation of asymmetric separators of the \(n\)-cube, A constructive proof of a permutation-based generalization of Sperner's lemma, Modified projection methods for solving multi-valued variational inequality without monotonicity, On the computation of multi-dimensional solution manifolds of parametrized equations, A combined relaxation method for variational inequalities with nonlinear constraints, An adjustment process for nonconvex production economies, A fixed point theorem for the infinite-dimensional simplex, Intersection theorems with a continuum of intersection points, On parallel branch and bound frameworks for global optimization, A direct splitting method for nonsmooth variational inequalities, On a parameterized system of nonlinear equations with economic applications, Computing integral solutions of complementarity problems, Some NP-complete problems in quadratic and nonlinear programming, KKM-type theorems for best proximity points, Topological degree and number of Nash equilibrium points of bimatrix games, Topological degree and the Sperner lemma, Fixed points for fuzzy mappings, Understanding PPA-completeness, Asymptotically efficient triangulations of the \(d\)-cube, General equilibrium models and homotopy methods, Exchange price equilibria and variational inequalities, A mixed 0-1 linear programming approach to the computation of all pure-strategy Nash equilibria of a finite \(n\)-person game in normal form, A differentiable homotopy method to compute perfect equilibria, State and parameter estimation for nonlinear systems, Fixed point theorems for discontinuous mapping, Adaptive quadratures over volumes, The Hairy Ball problem is PPAD-complete, Lower bounds for packing densities, An algorithm to solve boundary value problems for differential iinclusions and applications in optimal control, A path to the Arrow-Debreu competitive market equilibrium, Intermediate value theorem for simplices for simplicial approximation of fixed points and zeros, On the existence and approximation of zeroes, The \(D_ 2\)-triangulation for simplicial homotopy algorithms for computing solutions of nonlinear equations, Globally-biased disimpl algorithm for expensive global optimization, Some computational methods for systems of nonlinear equations and systems of polynomial equations, The 8T-LE partition applied to the obtuse triangulations of the 3D-cube, A unified approach to the implementation of several restart fixed point algorithms and a new variable dimension algorithm, Combinatorial integer labeling theorems on finite sets with applications, $J'$: A New Triangulation of $R^n $, The Middle-Cut Triangulations of the n-Cube, Solving variational inequality and fixed point problems by line searches and potential optimization, Computation of the Nash equilibrium selected by the tracing procedure in \(N\)-person games, Computation of Leray-Schauder fixed points, Solving discrete zero point problems, Two-player envy-free multi-cake division, Computation of equilibria in an economy with increasing returns to scale technologies, A quadratically-convergent fixed-point algorithm for economic equilibria and linearly constrained optimization, Exploiting structure in piecewise-linear homotopy algorithms for solving equations, A new subdivision for computing fixed points with a homotopy algorithm, A class of simplicial restart fixed point algorithms without an extra dimension, Symmetric finite volume schemes for eigenvalue problems in arbitrary dimensions, On new methods to construct lower bounds in simplicial branch and bound based on interval arithmetic, Scalar labelings for homotopy paths, Borsuk's theorem through complementary pivoting, Edge pricing of multicommodity networks for selfish users with elastic demands, A simplicial approach for discrete fixed point theorems, A constructive proof of Ky Fan's coincidence theorem, Consensus-halving via theorems of Borsuk-Ulam and Tucker, Generalizations of fixed point theorems and computation, A geometrical interpretation of the without-exception feasibility of PL homotopy methods, Compensation type algorithms for neural nets: Stability and convergence, Best proximity point results for Geraghty type \(\mathcal{Z}\)-proximal contractions with an application, Subdivision of simplices relative to a cutting plane and finite concave minimization, A variable-dimension simplicial algorithm for antipodal fixed-point theorems, A differentiable path-following method to compute subgame perfect equilibria in stationary strategies in robust stochastic games and its applications, A constructive proof of Ky Fan's generalization of Tucker's lemma, On the existence of a continuum of constrained equilibria, The transition from a Drèze equilibrium to a Walrasian equilibrium, General network equilibrium analysis, Numerical continuation methods: a perspective, Piecewise linear methods for nonlinear equations and optimization, An algorithm for computing multivariable root loci by pivoting, General economic equilibrium and variational inequalities: Existence, uniqueness and sensitivity, Assymptotically efficient triangulations of the d-cube∗, A simple and relatively efficient triangulation of the n-cube, An overview of the emergence of weaker continuity notions, various classes of contractive mappings and related fixed point theorems, Low diameter graph decompositions, Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications, An economic equilibrium model on a multicommodity network, \(D_ 3\)-triangulation for simplicial deformation algorithms for computing solutions of nonlinear equations, Complementarity enhanced Nash's mappings and differentiable homotopy methods to select perfect equilibria, Equilibria on a Congested Transportation Network, Tracing Isomanifolds in \(\mathbb{R}\) d in Time Polynomial in d using Coxeter–Freudenthal–Kuhn Triangulations, Triangulate flat cones on simplices, Averaged Subgradient Methods for Constrained Convex Optimization and Nash Equilibria Computation, Red–green refinement of simplicial meshes in $d$ dimensions, Best proximity problems for new types of $\mathcal{Z}$-proximal contractions with an application, A Lower Bound Technique for Triangulations of Simplotopes, Unnamed Item, On Finding Large Sets of Rewards in Two-Player ETP–ESP Games, Fixed point theorems for discontinuous functions and applications, Conjugate gradient predictor corrector method for solving large scale problems, Polyhedral methods for piecewise-linear functions. I: The lambda method, Computing an integer point of a class of convex sets., Computing an integer point of a simplex with an arbitrary starting homotopy-like simplicial algorithm, Existence of balanced simplices on polytopes., A note on vector labelling algorithm, A modification of todd's triangulationJ 3, A combined relaxation method for decomposable variational inequalities*, Envy-free division of discrete cakes, Piecewise linear paths to minimize convex functions may not be monotonic, Finding all solutions to polynomial systems and other systems of equations, A restart algorithm for computing fixed points without an extra dimension, The octahedral algorithm, a new simplicial fixed point algorithm, On accelerating PL continuation algorithms by predictor—corrector methods, Variable dimension algorithms: Basic theory, interpretations and extensions of some existing methods, On the computational complexity of piecewise-linear homotopy algorithms, Quadratically constrained quadratic programming: Some applications and a method for solution, An efficient simplicial algorithm for computing a zero of a convex union of smooth functions, A new variable dimension algorithm for the fixed point problem
