Computing Equilibria and Fixed Points is devoted to the computation of equilibria, fixed points and stationary points. This volume is written with three goals in mind: (i) To give a comprehensive introduction to fixed point methods and to the definition and construction of Gröbner bases; (ii) To discuss several interesting applications of these methods in the fields of general equilibrium theory, game theory, mathematical programming, algebra and symbolic computation; (iii) To introduce several advanced fixed point and stationary point theorems. These methods and topics should be of interest not only to economists and game theorists concerned with the computation and existence of equilibrium outcomes in economic models and cooperative and non-cooperative games, but also to applied mathematicians, computer scientists and engineers dealing with models of highly nonlinear systems of equations (or polynomial equations).

This monograph gives an introductory treatment of the most important iterative methods for constructing fixed points of nonlinear contractive type mappings. For each iterative method considered, it summarizes the most significant contributions in the area by presenting some of the most relevant convergence theorems. It also presents applications to the solution of nonlinear operator equations as well as the appropriate error analysis of the main iterative methods.

The central idea underlying this work is to convert the Walrasian general equilibrium structure (formalized in the 1950s by Kenneth Arrow, Gerard Debreu and others) from an abstract representation of an economy into realistic models of actual economies.

Computer science and economics have engaged in a lively interaction over the past fifteen years, resulting in the new field of algorithmic game theory. Many problems that are central to modern computer science, ranging from resource allocation in large networks to online advertising, involve interactions between multiple self-interested parties. Economics and game theory offer a host of useful models and definitions to reason about such problems. The flow of ideas also travels in the other direction, and concepts from computer science are increasingly important in economics. This book grew out of the author's Stanford University course on algorithmic game theory, and aims to give students and other newcomers a quick and accessible introduction to many of the most important concepts in the field. The book also includes case studies on online advertising, wireless spectrum auctions, kidney exchange, and network management.

Optimal Solution of Nonlinear Equations is a text/monograph designed to provide an overview of optimal computational methods for the solution of nonlinear equations, fixed points of contractive and noncontractive mapping, and for the computation of the topological degree. It is of interest to any reader working in the area of Information-Based Complexity. The worst-case settings are analyzed here. Several classes of functions are studied with special emphasis on tight complexity bounds and methods which are close to or achieve these bounds. Each chapter ends with exercises, including companies and open-ended research based exercises.

This proceedings volume addresses advances in global optimization—a multidisciplinary research field that deals with the analysis, characterization and computation of global minima and/or maxima of nonlinear, non-convex and nonsmooth functions in continuous or discrete forms. The volume contains selected papers from the third biannual World Congress on Global Optimization in Engineering & Science (WCGO), held in the Yellow Mountains, Anhui, China on July 8-12, 2013. The papers fall into eight topical sections: mathematical programming; combinatorial optimization; duality theory; topology optimization; variational inequalities and complementarity problems; numerical optimization; stochastic models and simulation and complex simulation and supply chain analysis.