This book contains three well-written research tutorials that inform the graduate reader about the forefront of current research in multi-agent optimization. These tutorials cover topics that have not yet found their way in standard books and offer the reader the unique opportunity to be guided by major researchers in the respective fields. Multi-agent optimization, lying at the intersection of classical optimization, game theory, and variational inequality theory, is at the forefront of modern optimization and has recently undergone a dramatic development. It seems timely to provide an overview that describes in detail ongoing research and important trends. This book concentrates on Distributed Optimization over Networks; Differential Variational Inequalities; and Advanced Decomposition Algorithms for Multi-agent Systems. This book will appeal to both mathematicians and mathematically oriented engineers and will be the source of inspiration for PhD students and researchers.

The ?nite-dimensional nonlinear complementarity problem (NCP) is a s- tem of ?nitely many nonlinear inequalities in ?nitely many nonnegative variables along with a special equation that expresses the complementary relationship between the variables and corresponding inequalities. This complementarity condition is the key feature distinguishing the NCP from a general inequality system, lies at the heart of all constrained optimi- tion problems in ?nite dimensions, provides a powerful framework for the modeling of equilibria of many kinds, and exhibits a natural link between smooth and nonsmooth mathematics. The ?nite-dimensional variational inequality (VI), which is a generalization of the NCP, provides a broad unifying setting for the study of optimization and equilibrium problems and serves as the main computational framework for the practical solution of a host of continuum problems in the mathematical sciences. The systematic study of the ?nite-dimensional NCP and VI began in the mid-1960s; in a span of four decades, the subject has developed into a very fruitful discipline in the ?eld of mathematical programming. The - velopments include a rich mathematical theory, a host of e?ective solution algorithms, a multitude of interesting connections to numerous disciplines, and a wide range of important applications in engineering and economics. As a result of their broad associations, the literature of the VI/CP has bene?ted from contributions made by mathematicians (pure, applied, and computational), computer scientists, engineers of many kinds (civil, ch- ical, electrical, mechanical, and systems), and economists of diverse exp- tise (agricultural, computational, energy, ?nancial, and spatial).

The ?nite-dimensional nonlinear complementarity problem (NCP) is a s- tem of ?nitely many nonlinear inequalities in ?nitely many nonnegative variables along with a special equation that expresses the complementary relationship between the variables and corresponding inequalities. This complementarity condition is the key feature distinguishing the NCP from a general inequality system, lies at the heart of all constrained optimi- tion problems in ?nite dimensions, provides a powerful framework for the modeling of equilibria of many kinds, and exhibits a natural link between smooth and nonsmooth mathematics. The ?nite-dimensional variational inequality (VI), which is a generalization of the NCP, provides a broad unifying setting for the study of optimization and equilibrium problems and serves as the main computational framework for the practical solution of a host of continuum problems in the mathematical sciences. The systematic study of the ?nite-dimensional NCP and VI began in the mid-1960s; in a span of four decades, the subject has developed into a very fruitful discipline in the ?eld of mathematical programming. The - velopments include a rich mathematical theory, a host of e?ective solution algorithms, a multitude of interesting connections to numerous disciplines, and a wide range of important applications in engineering and economics. As a result of their broad associations, the literature of the VI/CP has bene?ted from contributions made by mathematicians (pure, applied, and computational), computer scientists, engineers of many kinds (civil, ch- ical, electrical, mechanical, and systems), and economists of diverse exp- tise (agricultural, computational, energy, ?nancial, and spatial).

This comprehensive book presents a rigorous and state-of-the-art treatment of variational inequalities and complementarity problems in finite dimensions. This class of mathematical programming problems provides a powerful framework for the unified analysis and development of efficient solution algorithms for a wide range of equilibrium problems in economics, engineering, finance, and applied sciences. New research material and recent results, not otherwise easily accessible, are presented in a self-contained and consistent manner. The book is published in two volumes, with the first volume concentrating on the basic theory and the second on iterative algorithms. Both volumes contain abundant exercises and feature extensive bibliographies. Written with a wide range of readers in mind, including graduate students and researchers in applied mathematics, optimization, and operations research as well as computational economists and engineers, this book will be an enduring reference on the subject and provide the foundation for its sustained growth.

This comprehensive book presents a rigorous and state-of-the-art treatment of variational inequalities and complementarity problems in finite dimensions. This class of mathematical programming problems provides a powerful framework for the unified analysis and development of efficient solution algorithms for a wide range of equilibrium problems in economics, engineering, finance, and applied sciences. New research material and recent results, not otherwise easily accessible, are presented in a self-contained and consistent manner. The book is published in two volumes, with the first volume concentrating on the basic theory and the second on iterative algorithms. Both volumes contain abundant exercises and feature extensive bibliographies. Written with a wide range of readers in mind, including graduate students and researchers in applied mathematics, optimization, and operations research as well as computational economists and engineers, this book will be an enduring reference on the subject and provide the foundation for its sustained growth.

The theory of optimization, understood in a broad sense, is the basis of modern applied mathematics, covering a large spectrum of topics from theoretical considerations (structure, stability) to applied operational research and engineering applications. The compiled material of this book puts on display this versatility, by exhibiting the three parallel and complementary components of optimization: theory, algorithms, and practical problems.

The book contains an expanded version of three series of lectures delivered by the authors at the CRM in July 2009. The first part is a self-contained course on the general moment problem and its relations with semidefinite programming. The second part is dedicated to the problem of determination of Nash equilibria from an algorithmic viewpoint. The last part presents congestion models for traffic networks and develops modern optimization techniques for finding traffic equilibria based on stochastic optimization and game theory.