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).

Designs in nanoelectronics often lead to challenging simulation problems and include strong feedback couplings. Industry demands provisions for variability in order to guarantee quality and yield. It also requires the incorporation of higher abstraction levels to allow for system simulation in order to shorten the design cycles, while at the same time preserving accuracy. The methods developed here promote a methodology for circuit-and-system-level modelling and simulation based on best practice rules, which are used to deal with coupled electromagnetic field-circuit-heat problems, as well as coupled electro-thermal-stress problems that emerge in nanoelectronic designs. This book covers: (1) advanced monolithic/multirate/co-simulation techniques, which are combined with envelope/wavelet approaches to create efficient and robust simulation techniques for strongly coupled systems that exploit the different dynamics of sub-systems within multiphysics problems, and which allow designers to predict reliability and ageing; (2) new generalized techniques in Uncertainty Quantification (UQ) for coupled problems to include a variability capability such that robust design and optimization, worst case analysis, and yield estimation with tiny failure probabilities are possible (including large deviations like 6-sigma); (3) enhanced sparse, parametric Model Order Reduction techniques with a posteriori error estimation for coupled problems and for UQ to reduce the complexity of the sub-systems while ensuring that the operational and coupling parameters can still be varied and that the reduced models offer higher abstraction levels that can be efficiently simulated. All the new algorithms produced were implemented, transferred and tested by the EDA vendor MAGWEL. Validation was conducted on industrial designs provided by end-users from the semiconductor industry, who shared their feedback, contributed to the measurements, and supplied both material data and process data. In closing, a thorough comparison to measurements on real devices was made in order to demonstrate the algorithms' industrial applicability.

How do people living in small groups without money, markets, police and rigid social classes develop norms of economic and social cooperation that are sustainable over time? This book addresses this fundamental question and explains the origin, structure and spread of stateless societies. Using insights from game theory, ethnography and archaeology, Stanish shows how ritual - broadly defined - is the key. Ritual practices encode elaborate rules of behavior and are ingenious mechanisms of organizing society in the absence of coercive states. As well as asking why and how people choose to co-operate, Stanish also provides the theoretical framework to understand this collective action problem. He goes on to highlight the evolution of cooperation with ethnographic and archaeological data from around of the world. Merging evolutionary game theory concepts with cultural evolutionary theory, this book will appeal to those seeking a transdisciplinary approach to one of the greatest problems in human evolution.

Dynamic games continue to attract strong interest from researchers interested in modelling competitive as well as conflict situations exhibiting an intertemporel aspect. Applications of dynamic games have proven to be a suitable methodology to study the behaviour of players (decision-makers) and to predict the outcome of such situations in many areas including engineering, economics, management science, military, biology and political science.

Dynamic Games Theory and Applications collects thirteen articles written by established researchers. It is an excellent reference for researchers and graduate students covering a wide range of emerging and revisited problems in both cooperative and non-cooperative games in different areas of applications, especially in economics and management science.

During the 1980s, economic theory has been revolutionised by game theory. The game theory approach is now very widely used throughout the profession and has become a major tool for the construction of new economic models. It is the basic tool in the construction of a modern theory of industrial organisation and it has led to important developments in finance, labour economics and international trade. This major new collection - prepared by a leading international authority - is oriented towards researchers, professors and graduate students who are interested in the interface between game theory and economic theory. They include the seminal and most important recent papers on the development and application of game theory in economics.

Nash equilibrium is the central solution concept in Game Theory. Since Nash's original paper in 1951, it has found countless applications in modeling strategic behavior of traders in markets, (human) drivers and (electronic) routers in congested networks, nations in nuclear disarmament negotiations, and more. A decade ago, the relevance of this solution concept was called into question by computer scientists, who proved (under appropriate complexity assumptions) that computing a Nash equilibrium is an intractable problem. And if centralized, specially designed algorithms cannot find Nash equilibria, why should we expect distributed, selfish agents to converge to one? The remaining hope was that at least approximate Nash equilibria can be efficiently computed.Understanding whether there is an efficient algorithm for approximate Nash equilibrium has been the central open problem in this field for the past decade. In this book, we provide strong evidence that even finding an approximate Nash equilibrium is intractable. We prove several intractability theorems for different settings (two-player games and many-player games) and models (computational complexity, query complexity, and communication complexity). In particular, our main result is that under a plausible and natural complexity assumption ("Exponential Time Hypothesis for PPAD"), there is no polynomial-time algorithm for finding an approximate Nash equilibrium in two-player games. The problem of approximate Nash equilibrium in a two-player game poses a unique technical challenge: it is a member of the class PPAD, which captures the complexity of several fundamental total problems, i.e., problems that always have a solution; and it also admits a quasipolynomial time algorithm. Either property alone is believed to place this problem far below NP-hard problems in the complexity hierarchy; having both simultaneously places it just above P, at what can be called the frontier of intractability. Indeed, the tools we develop in this book to advance on this frontier are useful for proving hardness of approximation of several other important problems whose complexity lies between P and NP: Brouwer's fixed point, market equilibrium, CourseMatch (A-CEEI), densest k-subgraph, community detection, VC dimension and Littlestone dimension, and signaling in zero-sum games.

DYNAMIC OPTIMIZATION AND DIFFERENTIAL GAMES has been written to address the increasing number of Operations Research and Management Science problems (that is, applications) that involve the explicit consideration of time and of gaming among multiple agents. It is a book that will be used both as a textbook and as a reference and guide to engineers, operation researchers, applied mathematicians and social scientists whose work involves the theoretical aspects of dynamic optimization and differential games. Included throughout the text are detailed explanations of several original dynamic and game-theoretic mathematical models, which are of particular relevance in todaya (TM)s technologically-driven-global economy: revenue management, supply chain management, electric power systems, urban freight systems, dynamic congestion pricing, dynamic traffic assignment, electronic commerce and the Internet. In addition, there will be some more traditional applications with useful pedagogical content included in Chapter 1.

The book combines an emphasis on deterministic models and methods along with an introduction to stochastic optimal control and stochastic differential games. And most important, the book covers both theory and applications. It develops the key results of deterministic, continuous time, optimal control theory from both the classical calculus of variations perspectives and the more modern approach of infinite dimensional mathematical programming. Infinite dimensional mathematical programming provides greater utility for solving continuous-time-differential-game problems.

Provides well-written self-contained chapters, including problem sets and exercises, making it ideal for the classroom setting; Introduces applied optimization to the hazardous waste blending problem; Explores linear programming, nonlinear programming, discrete optimization, global optimization, optimization under uncertainty, multi-objective optimization, optimal control and stochastic optimal control; Includes an extensive bibliography at the end of each chapter and an index; GAMS files of case studies for Chapters 2, 3, 4, 5, and 7 are linked to http://www.springer.com/math/book/978-0-387-76634-8; Solutions manual available upon adoptions.

This book presents the application of some AI related optimization techniques in the operation and control of electric power systems. With practical applications and examples the use of functional analysis, simulated annealing, Tabu-search, Genetic algorithms and fuzzy systems for the optimization of power systems is discussed in detail. Preliminary mathematical concepts are presented before moving to more advanced material. Researchers and graduate students will benefit from this book. Engineers working in utility companies, operations and control, and resource management will also find this book useful.

Optimization and decision making are integral parts of any manufacturing process and management system. The objective of this book is to demonstrate the confluence of theory and applications of various types of multi-criteria decision making and optimization techniques with reference to textile manufacturing and management. Divided into twelve chapters, it discusses various multi-criteria decision-making methods such as AHP, TOPSIS, ELECTRE, and optimization techniques like linear programming, fuzzy linear programming, quadratic programming, in textile domain. Multi-objective optimization problems have been dealt with two approaches, namely desirability function and evolutionary algorithm. Key Features Exclusive title covering textiles and soft computing fields including optimization and decision making Discusses concepts of traditional and non-traditional optimization methods with textile examples Explores pertinent single-objective and multi-objective optimizations Provides MATLAB coding in the Appendix to solve various types of multi-criteria decision making and optimization problems Includes examples and case studies related to textile engineering and management

This volume collects almost two decades of joint work of Sergiu Hart and Andreu Mas-Colell on game dynamics and equilibria. The starting point was the introduction of the adaptive strategy called regret-matching, which on the one hand is simple and natural, and on the other is shown to lead to correlated equilibria. This initial finding - boundedly rational behavior that yields fully rational outcomes in the long run - generated a large body of work on the dynamics of simple adaptive strategies. In particular, a natural condition on dynamics was identified: uncoupledness, whereby decision-makers do not know each other's payoffs and utilities (so, while chosen actions may be observable, the motivations are not). This condition turns out to severely limit the equilibria that can be reached. Interestingly, there are connections to the behavioral and neurobiological sciences and also to computer science and engineering (e.g., via notions of "regret").Simple Adaptive Strategies is self-contained and unified in its presentation. Together with the formal treatment of concepts, theorems, and proofs, significant space is devoted to informal explanations and illuminating examples. It may be used for advanced graduate courses - in game theory, economics, mathematics, computer science, engineering - and for further research.

Global optimization aims at solving the most general problems of deterministic mathematical programming: to find the global optimum of a nonlinear, nonconvex, multivariate function of continuous and/or integer variables subject to constraints which may be themselves nonlinear and nonconvex. In addition, once the solutions are found, proof of its optimality is also expected from this methodology. Therefore, with these difficulties in mind, global optimization is becoming an increasingly powerful and important methodology. Essays and Surveys in Global Optimization is the most recent examination of its mathematical capability, power, and wide ranging solutions to many fields in the applied sciences.

This text bridges the gulf between theoretical economic principles of negotiation and auction theory and their multifaceted applications in actual practice. It is intended to be a supplement to the already existing literature, as a comprehensive collection of reports detailing experiences and results of very different negotiations and auctions.

The aim of Cooperative Games on Combinatorial Structures is to analyze conflict situations in which two or more players can make coalitions and obtain prizes and penalties. This approach to situations of competition and cooperation was given in the seminal treatise by John von Neumann and Oskar Morgenstern, Theory of Games and Economic Behavior. Cooperative game theory has succeeded in providing many applications of game theory. In this volume, games defined on combinatorial structures will be analyzed, i.e. a set system over a set of players. In many situations the author will work in a closure space. Examples of closure operators are the spanning operator of linear algebra and all convex hull operators. Chapters 1-4 constitute a review of mathematical concepts from Cooperative Game Theory, Graph Theory, Linear and Integer Programming, Combinatorial Optimization, Discrete Convex Analysis and Computational Complexity. The table of contents is a short guide to the topics and methods covered in this book. In Chapters 11 and 12, several notebooks are presented with the system Mathematica by Wolfram in the contexts of the packages DiscreteMath (Skiena) and Cooperative (Carter). There will also be found in the book several research projects. These are intended to offer new ideas that the reader should consider with caution. This book will be of interest to graduate students with some experience in game theory or mathematical programming and professional researchers in game theory, operational research and its applications in economic theory, and the political and social sciences. In addition, it will be especially useful for professionals who are interested in models for understanding and managing conflicts: management and operational research scientists, political and military scientists, and professional negotiators.

The paradigms of dynamic games play an important role in the development of multi-agent models in engineering, economics, and management science. The applicability of their concepts stems from the ability to encompass situations with uncertainty, incomplete information, fluctuating coalition structure, and coupled constraints imposed on the strategies of all the players. This book - an outgrowth of the 10th International Symposium on Dynamic Games - presents current developments of the theory of dynamic games and its applications to various domains, in particular energy-environment economics and management sciences. The volume uses dynamic game models of various sorts to approach and solve several problems pertaining to pursuit-evasion, marketing, finance, climate and environmental economics, resource exploitation, as well as auditing and tax evasions. In addition, it includes some chapters on cooperative games, which are increasingly drawing dynamic approaches to their classical solutions. dynamic game theory and its applications for researchers, practitioners, and graduate students in applied mathematics, engineering, economics, as well as environmental and management sciences.

This book describes the interplay of mechanics, electronics, electrotechnics, automation and biomechanics. It provides a broad overview of mechatronics systems ranging from modeling and dimensional analysis, and an overview of magnetic, electromagnetic and piezo-electric phenomena. It also includes the investigation of the pneumo-fluid-mechanical, as well as electrohydraulic servo systems, modeling of dynamics of an atom/particle embedded in the magnetic field, integrity aspects of the Maxwell's equations, the selected optimization problems of angular velocity control of a DC motor subjected to chaotic disturbances with and without stick-slip dynamics, and the analysis of a human chest adjacent to the elastic backrest aimed at controlling force to minimize relative compression of the chest employing the LQR.This book provides a theoretical background on the analysis of various kinds of mechatronics systems, along with their computational analysis, control, optimization as well as laboratory investigations.

Herbert Scarf is a highly esteemed distinguished American economist. He is internationally famous for his early epoch-making work on optimal inventory policies and his highly influential study with Andrew Clark on optimal policies for a multi-echelon inventory problem, which initiated the important and flourishing field of supply chain management. Equally, he has gained world recognition for his classic study on the stability of the Walrasian price adjustment processes and his fundamental analysis on the relationship between the core and the set of competitive equilibria (the so-called Edgeworth conjecture). Further achievements include his remarkable sufficient condition for the existence of a core in non-transferable utility games and general exchange economies, his seminal paper with Lloyd Shapley on housing markets, and his pioneering study on increasing returns and models of production in the presence of indivisibilities. All in all, however, the name of Scarf is always remembered as a synonym for the computation of economic equilibria and fixed points. In the early 1960s he invented a path-breaking technique for computing equilibrium prices.This work has generated a major research field in economics termed Applied General Equilibrium Analysis and a corresponding area in operations research known as Simplicial Fixed Point Methods. This book comprises all his research articles and consists of four volumes. The volume collects Herbert Scarf's papers in the area of Applied Equilibrium Analysis.

In recent years game theory has had a substantial impact on computer science, especially on Internet- and e-commerce-related issues. Algorithmic Game Theory, first published in 2007, develops the central ideas and results of this exciting area in a clear and succinct manner. More than 40 of the top researchers in this field have written chapters that go from the foundations to the state of the art. Basic chapters on algorithmic methods for equilibria, mechanism design and combinatorial auctions are followed by chapters on important game theory applications such as incentives and pricing, cost sharing, information markets and cryptography and security. This definitive work will set the tone of research for the next few years and beyond. Students, researchers, and practitioners alike need to learn more about these fascinating theoretical developments and their widespread practical application.

As for film and literature, the horror genre has been very popular in the video game. The World of Scary Video Games provides a comprehensive overview of the videoludic horror, dealing with the games labelled as "survival horror" as well as the mainstream and independent works associated with the genre. It examines the ways in which video games have elicited horror, terror and fear since Haunted House (1981). Bernard Perron combines an historical account with a theoretical approach in order to offer a broad history of the genre, outline its formal singularities and explore its principal issues. It studies the most important games and game series, from Haunted House (1981) to Alone in the Dark (1992- ), Resident Evil (1996-present), Silent Hill (1999-present), Fatal Frame (2001-present), Dead Space (2008-2013), Amnesia: the Dark Descent (2010), and The Evil Within (2014). Accessibly written, The World of Scary Video Games helps the reader to trace the history of an important genre of the video game.

Large-Scale Nonlinear Optimization reviews and discusses recent advances in the development of methods and algorithms for nonlinear optimization and its applications, focusing on the large-dimensional case, the current forefront of much research. The chapters of the book, authored by some of the most active and well-known researchers in nonlinear optimization, give an updated overview of the field from different and complementary standpoints, including theoretical analysis, algorithmic development, implementation issues and applications.

This book analyses the changes to the regulation of everyday life that have taken place as a result of datafication, the ever-growing analytical, predictive, and structuring role of algorithms, and the prominence of the platform economy. This new form of regulation - algorithmic governance - ranges from nudging individuals towards predefined outcomes to outright structuration of behaviour through digital architecture. The author reveals the strength and pervasiveness of algorithmic politics through a comparison with the main traditional form of regulation: law. These changes are subsequently demonstrated to reflect a broader shift away from anthropocentric accounts of the world. In doing so, the book adopts a posthumanist framework which focuses on deep embeddedness and interactions between humans, the natural environment, technology, and code.

This is the first comprehensive introduction to the powerful moment approach for solving global optimization problems (and some related problems) described by polynomials (and even semi-algebraic functions). In particular, the author explains how to use relatively recent results from real algebraic geometry to provide a systematic numerical scheme for computing the optimal value and global minimizers. Indeed, among other things, powerful positivity certificates from real algebraic geometry allow one to define an appropriate hierarchy of semidefinite (SOS) relaxations or LP relaxations whose optimal values converge to the global minimum. Several extensions to related optimization problems are also described. Graduate students, engineers and researchers entering the field can use this book to understand, experiment with and master this new approach through the simple worked examples provided.

Why do some games seem to be universal while others have a particular connection to the culture of the people playing them? Around the World in 80 Games is about the mathematics of chance, game theory, gamification, gaming strategies and computer games. Traversing the globe, Marcus du Sautoy looks at the genesis of games new and old, explores how to invent a good game and explains the fascination of a popular lockdown game. From the secrets of whist to hopscotch, Scrabble to Wordle. The most simple games endure: board games, card games and dice games have captivated us for centuries and the acclaimed mathematician and author of The Creativity Code (among many others) will once again bring mathematics to the fore with insight and aplomb in Around the World in 80 Games.

Many important applications in global optimization, algebra, probability and statistics, applied mathematics, control theory, financial mathematics, inverse problems, etc. can be modeled as a particular instance of the Generalized Moment Problem (GMP).This book introduces a new general methodology to solve the GMP when its data are polynomials and basic semi-algebraic sets. This methodology combines semidefinite programming with recent results from real algebraic geometry to provide a hierarchy of semidefinite relaxations converging to the desired optimal value. Applied on appropriate cones, standard duality in convex optimization nicely expresses the duality between moments and positive polynomials.In the second part, the methodology is particularized and described in detail for various applications, including global optimization, probability, optimal control, mathematical finance, multivariate integration, etc., and examples are provided for each particular application.

"Mathematical Optimization and Economic Analysis" is a self-contained introduction to various optimization techniques used in economic modeling and analysis such as geometric, linear, and convex programming and data envelopment analysis. Through a systematic approach, this book demonstrates the usefulness of these mathematical tools in quantitative and qualitative economic analysis.

The book presents specific examples to demonstrate each technique's advantages and applicability as well as numerous applications of these techniques to industrial economics, regulatory economics, trade policy, economic sustainability, production planning, and environmental policy.

Key Features include:

- A detailed presentation of both single-objective and multiobjective optimization;

- An in-depth exposition of various applied optimization problems;

- Implementation of optimization tools to improve the accuracy of various economic models;

- Extensive resources suggested for further reading.

This book is intended for graduate and postgraduate students studying quantitative economics, as well as economics researchers and applied mathematicians. Requirements include a basic knowledge of calculus and linear algebra, and a familiarity with economic modeling.