Computing equilibria and fixed points. The solution of nonlinear inequalities
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Mathematical programming (90C99) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to game theory, economics, and finance (91-01) Computational methods for problems pertaining to game theory, economics, and finance (91-08) General equilibrium theory (91B50)
This book is an extensive introduction to simplicial algorithms for the computation of fixed points, equilibria, and stationary points of maps in finite dimensional Euclidean space. The book emphasizes the so called simplicial algorithms which are based on the adjacency of simplices on a triangulation and labeling schemes of its vertices to help find approximations to the points in question. The details of such algorithms fill most of the book but it also includes some ``non-standard material: (1) A basic discussion of the algebraic theory of Groebner bases, the Buchberger algorithm, and the Hilbert Nullstellensatz. This is the content of Chapter 12. (2) The book contains a discussion of a technique to decide whether a given simplex contains or not a point with integer coordinates (see Chapter 6) which is based on work by \textit{H. E. Scarf} [Econometrica 49, 1-32 (1981; Zbl 0446.90006)] and \textit{C. Dang} and \textit{N. van Maaren} [Comput. Optim. Appl. 14, No. 1, 133-155 (1999)]. (3) It contains a large discussion of intersection theory that studies conditions under which a collection of sets covering a polyhedron has a non-empty intersection (see Chapter 13). The rest of the book is organized as follows: Chapter 1 contains an introduction to the notation and the classical fixed points theorems. Chapter 2 discusses applications of fixed point theorems. Chapters 3, 4, 5 discuss algorithms by Scarf, Merril, Kuhn-MacKinnon, Eaves Eaves-Saigal and van der Laan-Talman. Chapter 7 discusses the calculation of stationary points (again from the perspective of simplicial techniques). Chapter 8 introduces a fixed point theorem that states conditions for the existence of a continuum of fixed points and it is proved with an algorithm. Chapter 9 discusses the computations inside arbitrary polytopes (versus the classical cases of simplices and \(\mathbb{R}^n\)). Chapter 10 deals with computation of antipodal fixed points of continuous functions on a symmetric cubical set which provides a constructive proof of Borsuk-Ulam's fixed point theorem. Chapter 11 contains a discussion of how to use Kuhn's algorithm for the computation of all roots of a univariate polynomial with complex coefficients (this is later connected with Gröbner basis theory).
- A discrete multivariate mean value theorem with applications
- A constructive proof of Ky Fan's coincidence theorem
- Matching models with a conservation law: The existence and global structure of the set of stationary equilibria
- Existence and welfare properties of equilibrium in an exchange economy with multiple divisible and indivisible commodities and linear production technologies
- Consensus-halving via theorems of Borsuk-Ulam and Tucker
- A polytopal generalization of Sperner's lemma
- A recursive algorithm for the infinity-norm fixed point problem
- On a parameterized system of nonlinear equations with economic applications
- On modeling and complete solutions to general fixpoint problems in multi-scale systems with applications
- Equilibrium points, periodic solutions and the Brouwer fixed point theorem for convex and non-convex domains
- Equivalent forms of the Brouwer fixed point theorem. II.
- The existence of equilibrium in a simple exchange model
- Two-player envy-free multi-cake division
- Computing integral solutions of complementarity problems
- A path to the Arrow-Debreu competitive market equilibrium
- Existence of equilibrium and price adjustments in a finance economy with incomplete markets
- Solving discrete zero point problems
- A constructive proof of Ky Fan's generalization of Tucker's lemma
- A combinatorial lemma and its applications
- Application of Canonical Duality Theory to Fixed Point Problem
- Circumscribed ellipsoid algorithm for fixed-point problems
- scientific article; zbMATH DE number 4018246 (Why is no real title available?)
- scientific article; zbMATH DE number 4145674 (Why is no real title available?)
- scientific article; zbMATH DE number 3947534 (Why is no real title available?)
- scientific article; zbMATH DE number 46010 (Why is no real title available?)
- Numerical construction of LISS Lyapunov functions under a small-gain condition
- A User's guide to the topological Tverberg conjecture
- Existence of balanced simplices on polytopes.
- General existence theorem of zero points
- Univariate representations of solutions to generic polynomial complementarity problems
- Extended antipodal theorems
- Existence of equilibrium solution for a non-cooperative game with fuzzy goals and parameters
- Exchange market equilibria with Leontief's utility: freedom of pricing leads to rationality
- A fixed point theorem for the infinite-dimensional simplex
- Computing the cores of strategic games with punishment-dominance relations
- Combinatorial integer labeling theorems on finite sets with applications
This page was built for publication: Computing equilibria and fixed points. The solution of nonlinear inequalities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4935258)
