Market failure at medium intervals is inevitable in a capitalist economy. Such failures may not be seriously seen in the short run because market adjusts demand through hoarding of inventory or import of required goods and services. The market also adjusts demand in the long run through expansion of concerned industrial output and also by the entry of new firms. The crucial variable is price which also adjusts the commodity and the labor market. The problem comes when there are issues of overproduction, over capacity utilization of plants, over liquidation and excess supply of money, change in demand because of change in tastes and habits of consumers, households and the public. All these create knife edge disturbances in the economy. As a consequence they need adjustment through some variables such as employment and growth of population, saving propensity, technology, exhaustion of existing inventory, monetary and fiscal balancing. In this volume an attempt has been made to appraise the working of a market economy where short term disturbances may occur, market efficiency reduces, recessionary cycle emerges and after certain fundamental measures the market recovers. Starting with a brief recent history of the crisis and the recession, discussions in this volume turn to how deliberations in macroeconomics yield implications for specific policies, some of which have been tried and others still to be tested. Further in the volume we propose policies necessary for efficient regulation of the economic system, and give a brief assessment of the extent to which global policy coordination has been mulled in policy circles even if these are not seriously practiced.

This special volume focuses on optimization and control of processes governed by partial differential equations. The contributors are mostly participants of the DFG-priority program 1253: Optimization with PDE-constraints which is active since 2006. The book is organized in sections which cover almost the entire spectrum of modern research in this emerging field. Indeed, even though the field of optimal control and optimization for PDE-constrained problems has undergone a dramatic increase of interest during the last four decades, a full theory for nonlinear problems is still lacking. The contributions of this volume, some of which have the character of survey articles, therefore, aim at creating and developing further new ideas for optimization, control and corresponding numerical simulations of systems of possibly coupled nonlinear partial differential equations. The research conducted within this unique network of groups in more than fifteen German universities focuses on novel methods of optimization, control and identification for problems in infinite-dimensional spaces, shape and topology problems, model reduction and adaptivity, discretization concepts and important applications. Besides the theoretical interest, the most prominent question is about the effectiveness of model-based numerical optimization methods for PDEs versus a black-box approach that uses existing codes, often heuristic-based, for optimization.

Traditional game theory requires at least two individuals. This book extends game theory to the inner workings of a single person. Using game theory to analyse single individuals makes sense if one thinks of individuals as consisting of two or more relatively autonomous partitions that might have conflicting motives. This is not to say that individuals are literally made up from multiple selves; it only suffices that we adopt a portrayal of the individual as a multilayered entity or of a dual nature, in a manner similar to Adam Smith's depiction of an "impartial spectator" existing within the individual, The notion that individuals may be considered as collections of distinct partitions or "sub-selves" has been challenging writers from diverse fields for many centuries. This book breaks new ground in combining psychological with evolutionary game theory, making for a highly promising way towards a better understanding of the individual and the development of their behaviour, along with the individual's own perceptions on it.

This book presents select peer-reviewed papers presented at the International Conference on Numerical Optimization in Engineering and Sciences (NOIEAS) 2019. The book covers a wide variety of numerical optimization techniques across all major engineering disciplines like mechanical, manufacturing, civil, electrical, chemical, computer, and electronics engineering. The major focus is on innovative ideas, current methods and latest results involving advanced optimization techniques. The contents provide a good balance between numerical models and analytical results obtained for different engineering problems and challenges. This book will be useful for students, researchers, and professionals interested in engineering optimization techniques.

This handbook gathers state-of-the-art research on optimization problems in power distribution systems, covering classical problems as well as the challenges introduced by distributed power generation and smart grid resources. It also presents recent models, solution techniques and computational tools to solve planning problems for power distribution systems and explains how to apply them in distributed and variable energy generation resources. As such, the book therefore is a valuable tool to leverage the expansion and operation planning of electricity distribution networks.

This book, compiles, presents, and explains the most important meta-heuristic and evolutionary optimization algorithms whose successful performance has been proven in different fields of engineering, and it includes application of these algorithms to important engineering optimization problems. In addition, this book guides readers to studies that have implemented these algorithms by providing a literature review on developments and applications of each algorithm. This book is intended for students, but can be used by researchers and professionals in the area of engineering optimization.

This book uses a small volume to present the most basic results for deterministic two-person differential games. The presentation begins with optimization of a single function, followed by a basic theory for two-person games. For dynamic situations, the author first recalls control theory which is treated as single-person differential games. Then a systematic theory of two-person differential games is concisely presented, including evasion and pursuit problems, zero-sum problems and LQ differential games.The book is intended to be self-contained, assuming that the readers have basic knowledge of calculus, linear algebra, and elementary ordinary differential equations. The readership of the book could be junior/senior undergraduate and graduate students with majors related to applied mathematics, who are interested in differential games. Researchers in some other related areas, such as engineering, social science, etc. will also find the book useful.

Optimization, simulation and control play an increasingly important role in science and industry. Because of their numerous applications in various disciplines, research in these areas is accelerating at a rapid pace.

This volume brings together the latest developments in these areas of research as well as presents applications of these results to a wide range of real-world problems. The book is composed of invited contributions by experts from around the world who work to develop and apply new optimization, simulation and control techniques either at a theoretical level or in practice. Some key topics presented include: equilibrium problems, multi-objective optimization, variational inequalities, stochastic processes, numerical analysis, optimization in signal processing, and various other interdisciplinary applications.

This volume can serve as a useful resource for researchers, practitioners, and advanced graduate students of mathematics and engineering working in research areas where results in optimization, simulation and control can be applied.

This book systematically studies how game theory can be used to improve security in chemical industrial areas, capturing the intelligent interactions between security managers and potential adversaries. The recent unfortunate terrorist attacks on critical infrastructures show that adversaries are intelligent and strategic. Game theoretic models have been extensively used in some domains to model these strategic adversaries. However, there is a lack of such advanced models to be employed by chemical security managers. In this book, game theoretic models for protecting chemical plants as well as clusters are proposed. Different equilibrium concepts are explored, with user-friendly explanation of how to reflect them to realistic cases. Based on efficient analysis of the properties of security issues in chemical plants/clusters, models in this book are capable to support resources allocations, cost-effectiveness analysis, cooperation incentives and alike.

This book presents a study to determine the current limitations in the area of Photovoltaics (PV) as a source of renewable energy and proposes strategies to overcome them by applying optimization approaches in three main areas, namely related to photovoltaic solar cells, modules, and systems. These include grid metallization design of Si-based solar cells and modules; cost-effectiveness analysis between Si-based monofacial and bifacial grid-connected PV systems; optimal diesel replacement strategy for the progressive introduction of PV and batteries; dispatch strategy optimization for PV hybrid systems in real time. The novelty of the work presented in this book is of high interest to the scientific community but also to the PV manufacturers, installation companies, and investors.

Constrained optimization is a challenging branch of operations research that aims to create a model which has a wide range of applications in the supply chain, telecommunications and medical fields. As the problem structure is split into two main components, the objective is to accomplish the feasible set framed by the system constraints. The aim of this book is expose optimization problems that can be expressed as graphs, by detailing, for each studied problem, the set of nodes and the set of edges. This graph modeling is an incentive for designing a platform that integrates all optimization components in order to output the best solution regarding the parameters' tuning. The authors propose in their analysis, for optimization problems, to provide their graphical modeling and mathematical formulation and expose some of their variants. As a solution approaches, an optimizer can be the most promising direction for limited-size instances. For large problem instances, approximate algorithms are the most appropriate way for generating high quality solutions. The authors thus propose, for each studied problem, a greedy algorithm as a problem-specific heuristic and a genetic algorithm as a metaheuristic.

This comprehensive introduction to analyzing linear models with the SAS System examines the features and capabilities of the REG, ANOVA and GLM procedures. Readers will learn how to apply the appropriate procedure to data analysis problems and understand PROC GLM output. In-depth discussions are also included on multivariate linear models, lack-of-fit analysis, covariance and heterogeneity of slopes, a classification with both crossed and nested effects, and analysis of variance for balanced data.

The objective of the third edition of Game Theory: A Nontechnical Introduction to the Analysis of Strategy is to introduce the ideas of game theory in a way that is approachable, intuitive, and interdisciplinary. Relying on the Karplus Learning Cycle, the book is intended to teach by example. Noncooperative equilibrium concepts such as Nash equilibrium play the central role. In this third edition, increased stress is placed on the concept of rationalizable strategies, which has proven in teaching practice to assist students in making the bridge from intuitive to more formal concepts of noncooperative equilibrium.The Instructor Manual and PowerPoint Slides for the book are available upon request for all instructors who adopt this book as a course text. Please send your request to [email protected].

This book builds on two recently published books by the same authors on fuzzy graph theory. Continuing in their tradition, it provides readers with an extensive set of tools for applying fuzzy mathematics and graph theory to social problems such as human trafficking and illegal immigration. Further, it especially focuses on advanced concepts such as connectivity and Wiener indices in fuzzy graphs, distance, operations on fuzzy graphs involving t-norms, and the application of dialectic synthesis in fuzzy graph theory. Each chapter also discusses a number of key, representative applications. Given its approach, the book provides readers with an authoritative, self-contained guide to - and at the same time an inspiring read on - the theory and modern applications of fuzzy graphs. For newcomers, the book also includes a brief introduction to fuzzy sets, fuzzy relations and fuzzy graphs.

This volume contains eight papers written by Adam Brandenburger and his co-authors over a period of 25 years. These papers are part of a program to reconstruct game theory in order to make how players reason about a game a central feature of the theory. The program - now called epistemic game theory - extends the classical definition of a game model to include not only the game matrix or game tree, but also a description of how the players reason about one another (including their reasoning about other players' reasoning). With this richer mathematical framework, it becomes possible to determine the implications of how players reason for how a game is played. Epistemic game theory includes traditional equilibrium-based theory as a special case, but allows for a wide range of non-equilibrium behavior.

This book explains classic routing and transportation problems and solutions, before offering insights based on successful real-world solutions. The chapters in Part I introduce and explain the traveling salesperson problem (TSP), vehicle routing problems (VRPs), and multi-objective problems, with an emphasis on heuristic approaches and software engineering aspects. In turn, Part II demonstrates how to exploit geospatial data, routing algorithms, and visualization. In Part III, the above techniques and insights are combined in real-world success stories from domains such as food delivery in rural areas, postal delivery, workforce routing, and urban logistics. The book offers a valuable supporting text for advanced undergraduate and graduate courses and projects in Computer Science, Engineering, Operations Research, and Mathematics. It is accompanied by a repository of source code, allowing readers to try out the algorithms and techniques discussed.

This edited book reports on recent developments in the theory of evolutionary computation, or more generally the domain of randomized search heuristics. It starts with two chapters on mathematical methods that are often used in the analysis of randomized search heuristics, followed by three chapters on how to measure the complexity of a search heuristic: black-box complexity, a counterpart of classical complexity theory in black-box optimization; parameterized complexity, aimed at a more fine-grained view of the difficulty of problems; and the fixed-budget perspective, which answers the question of how good a solution will be after investing a certain computational budget. The book then describes theoretical results on three important questions in evolutionary computation: how to profit from changing the parameters during the run of an algorithm; how evolutionary algorithms cope with dynamically changing or stochastic environments; and how population diversity influences performance. Finally, the book looks at three algorithm classes that have only recently become the focus of theoretical work: estimation-of-distribution algorithms; artificial immune systems; and genetic programming. Throughout the book the contributing authors try to develop an understanding for how these methods work, and why they are so successful in many applications. The book will be useful for students and researchers in theoretical computer science and evolutionary computing.

This book presents current advances in the theory of dynamic games and their applications in several disciplines. The selected contributions cover a variety of topics ranging from purely theoretical developments in game theory, to numerical analysis of various dynamic games, and then progressing to applications of dynamic games in economics, finance, and energy supply.

A unified collection of state-of-the-art advances in theoretical and numerical analysis of dynamic games and their applications, the work is suitable for researchers, practitioners, and graduate students in applied mathematics, engineering, economics, as well as environmental and management sciences.

Discrete event systems (DES) have become pervasive in our daily lives. Examples include (but are not restricted to) manufacturing and supply chains, transportation, healthcare, call centers, and financial engineering. However, due to their complexities that often involve millions or even billions of events with many variables and constraints, modeling these stochastic simulations has long been a "hard nut to crack." The advance in available computer technology, especially of cluster and cloud computing, has paved the way for the realization of a number of stochastic simulation optimization for complex discrete event systems. This book will introduce two important techniques initially proposed and developed by Professor Y C Ho and his team; namely perturbation analysis and ordinal optimization for stochastic simulation optimization, and present the state-of-the-art technology, and their future research directions.

This book highlights recent advances in the field of districting, territory design, and zone design. Districting problems deal essentially with tactical decisions, and involve mainly dividing a set of geographic units into clusters or territories subject to some planning requirements. This book presents models, theory, algorithms (exact or heuristic), and applications that would bring research on districting systems up-to-date and define the state-of-the-art. Although papers have addressed real-world problems that require districting or territory division decisions, this is the first comprehensive book that directly addresses these problems. The chapters capture the diverse nature of districting applications, as the book is divided into three different areas of research. Part I covers recent up-to-date surveys on important areas of districting such as police districting, health care districting, and districting algorithms based on computational geometry. Part II focuses on recent advances on theory, modeling, and algorithms including mathematical programming and heuristic approaches, and finally, Part III contains successful applications in real-world districting cases.

This book introduces new concepts for cooperative game theory, and particularly solutions that determine the distribution of a coalitional surplus among the members of the coalition. It also addresses several generalizations of cooperative game theory. Drawing on methods of welfare economics, new value solutions are derived for Non-Transferable Utility games with and without differences of bargaining power among the members of the coalition. Cooperation in intertemporal games is examined, and conditions that permit the reduction of these games to games in coalition function form are outlined. Biform games and games that combine non-cooperative search and matching of coalition members with cooperative solutions (i.e., efficient contracts) within the coalition are considered.

This book presents models and algorithms for complex scheduling problems. Besides resource-constrained project scheduling problems with applications also job-shop problems with flexible machines, transportation or limited buffers are discussed. Discrete optimization methods like linear and integer programming, constraint propagation techniques, shortest path and network flow algorithms, branch-and-bound methods, local search and genetic algorithms, and dynamic programming are presented. They are used in exact or heuristic procedures to solve the introduced complex scheduling problems. Furthermore, methods for calculating lower bounds are described. Most algorithms are formulated in detail and illustrated with examples. In this second edition some errors were corrected, some parts were explained in more detail, and new material has been added. In particular, further generalizations of the RCPSP, additional practical applications and some more algorithms were integrated.

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.