There has been an increase in attention toward systems involving large numbers of small players, giving rise to the theory of mean field games, mean field type control and nonlinear Markov games. Exhibiting various real world problems involving major and minor agents, this book presents a systematic continuous-space approximation approach for mean-field interacting agents models and mean-field games models. After describing Markov-chain methodology and a modeling of mean-field interacting systems, the text presents various structural conditions on the chain to yield respective socio-economic models, focusing on migration models via binary interactions. The specific applications are wide-ranging - including inspection and corruption, cyber-security, counterterrorism, coalition building and network growth, minority games, and investment policies and optimal allocation - making this book relevant to a wide audience of applied mathematicians interested in operations research, computer science, national security, economics, and finance.

- Includes industrial case studies - Includes chapters on cyber physical systems, machine learning, deep learning, cyber security, robotics, smart manufacturing and predictive analytics - surveys current trends and challenges in metaheuristics and industry 4.0

The chapters of this Handbook volume covers nine main topics that are representative of recent
theoretical and algorithmic developments in the field. In addition to the nine papers that present the state of the art, there is an article on
the early history of the field.

The handbook will be a useful reference to experts in the field as well as students and others who want to learn about discrete optimization.

All of the chapters in this handbook are written by authors who have made significant original contributions to their topics. Herewith a brief introduction to the chapters of the handbook.

"On the history of combinatorial optimization (until 1960)" goes back to work of Monge in the 18th century on the assignment problem and presents six problem areas: assignment, transportation,
maximum flow, shortest tree, shortest path and traveling salesman.

The branch-and-cut algorithm of integer programming is the computational workhorse of discrete optimization. It provides the tools that have been implemented in commercial software such as CPLEX
and Xpress MP that make it possible to solve practical problems in supply chain, manufacturing, telecommunications and many other areas.
"Computational integer programming and cutting planes" presents the key ingredients
of these algorithms.

Although branch-and-cut based on linear programming relaxation is the most widely used integer programming algorithm, other approaches are
needed to solve instances for which branch-and-cut performs poorly and to understand better the structure of integral polyhedra. The next three chapters discuss alternative approaches.

"The structure of grouprelaxations" studies a family of polyhedra obtained by dropping certain
nonnegativity restrictions on integer programming problems.

Although integer programming is NP-hard in general, it is polynomially solvable in fixed dimension. "Integer programming, lattices, and results in fixed dimension" presents results in this area including algorithms that use reduced bases of integer lattices that are capable of solving certain classes of integer programs that defy solution by branch-and-cut.

Relaxation or dual methods, such as cutting plane algorithms, progressively remove infeasibility while maintaining optimality to the relaxed problem. Such algorithms have the disadvantage of
possibly obtaining feasibility only when the algorithm terminates.Primal methods for integer programs, which move from a feasible solution to a better feasible solution, were studied in the 1960's
but did not appear to be competitive with dual methods. However, recent development in primal methods presented in "Primal integer programming" indicate that this approach is not just interesting theoretically but may have practical implications as well.

The study of matrices that yield integral polyhedra has a long tradition in integer programming. A major breakthrough occurred in the 1990's with the development of polyhedral and structural results
and recognition algorithms for balanced matrices. "Balanced matrices" is a tutorial on the
subject.

Submodular function minimization generalizes some linear combinatorial optimization problems such as minimum cut and is one of the fundamental problems of the field that is solvable in polynomial
time. "Submodular function minimization"presents the theory and algorithms of this subject.

In the search for tighter relaxations of combinatorial optimization problems, semidefinite programming provides a generalization of
linear programming that can give better approximations and is still polynomially solvable. This subject is discussed in "Semidefinite programming and integer programming,"

Many real world problems have uncertain data that is known only probabilistically. Stochastic programming treats this topic, but until recently it was limited, for computational reasons, to
stochastic linear programs. Stochastic integer programming is now a high profile research area and recent developments are presented in
"Algorithms for stochastic mixed-integer programming
models,"

Resource constrained scheduling is an example of a class of combinatorial optimization problems that is not naturally formulated with linear constraints so that linear programming based methods do
not work well. "Constraint programming" presents an alternative enumerative approach that is complementary to branch-and-cut. Constraint programming, primarily designed for feasibility problems, does not use a relaxation to obtain bounds. Instead nodes of the search tree are
pruned by constraint propagation, which tightens bounds on variables until their values are fixed or their domains are shown to be empty.

This book is devoted to a detailed study of the subgradient projection method and its variants for convex optimization problems over the solution sets of common fixed point problems and convex feasibility problems. These optimization problems are investigated to determine good solutions obtained by different versions of the subgradient projection algorithm in the presence of sufficiently small computational errors. The use of selected algorithms is highlighted including the Cimmino type subgradient, the iterative subgradient, and the dynamic string-averaging subgradient. All results presented are new. Optimization problems where the underlying constraints are the solution sets of other problems, frequently occur in applied mathematics. The reader should not miss the section in Chapter 1 which considers some examples arising in the real world applications. The problems discussed have an important impact in optimization theory as well. The book will be useful for researches interested in the optimization theory and its applications.

Focuses on the latest research in the field of differential equations in engineering applications Discusses the most recent research findings that are occurring across different institutions Identifies the gaps in the knowledge of differential equations Presents the most fruitful areas for further research in advanced processes Offers the most forthcoming studies in modeling and simulation along with real-world case studies

This book includes selected peer-reviewed papers presented at the International Conference on Modeling, Simulation and Optimization (CoMSO 2021), organized by National Institute of Technology, Silchar, Assam, India, during December 16-18, 2021. The book covers topics of modeling, simulation and optimization, including computational modeling and simulation, system modeling and simulation, device/VLSI modeling and simulation, control theory and applications, modeling and simulation of energy systems and optimization. The book disseminates various models of diverse systems and includes solutions of emerging challenges of diverse scientific fields.

This book is devoted to problems of stochastic control and stopping that are time inconsistent in the sense that they do not admit a Bellman optimality principle. These problems are cast in a game-theoretic framework, with the focus on subgame-perfect Nash equilibrium strategies. The general theory is illustrated with a number of finance applications.In dynamic choice problems, time inconsistency is the rule rather than the exception. Indeed, as Robert H. Strotz pointed out in his seminal 1955 paper, relaxing the widely used ad hoc assumption of exponential discounting gives rise to time inconsistency. Other famous examples of time inconsistency include mean-variance portfolio choice and prospect theory in a dynamic context. For such models, the very concept of optimality becomes problematic, as the decision maker's preferences change over time in a temporally inconsistent way. In this book, a time-inconsistent problem is viewed as a non-cooperative game between the agent's current and future selves, with the objective of finding intrapersonal equilibria in the game-theoretic sense. A range of finance applications are provided, including problems with non-exponential discounting, mean-variance objective, time-inconsistent linear quadratic regulator, probability distortion, and market equilibrium with time-inconsistent preferences. Time-Inconsistent Control Theory with Finance Applications offers the first comprehensive treatment of time-inconsistent control and stopping problems, in both continuous and discrete time, and in the context of finance applications. Intended for researchers and graduate students in the fields of finance and economics, it includes a review of the standard time-consistent results, bibliographical notes, as well as detailed examples showcasing time inconsistency problems. For the reader unacquainted with standard arbitrage theory, an appendix provides a toolbox of material needed for the book.

This book offers a timely snapshot of current soft-computing research and solutions to decision-making and optimization problems, which are ubiquitous in the current social and technological context, addressing fields including logistics, transportation and data analysis. Written by leading international experts from the United States, Brazil and Cuba, as well as the United Kingdom, France, Finland and Spain, it discusses theoretical developments in and practical applications of soft computing in fields where these methods are crucial to obtaining better models, including: intelligent transportation systems, maritime logistics, portfolio selection, decision- making, fuzzy cognitive maps, and fault detection. The book is dedicated to Professor Jose L. Verdegay, a pioneer who has been actively pursuing research in fuzzy sets theory and soft computing since 1982, in honor of his 65th birthday.

The 2020 International Conference on Uncertainty Quantification & Optimization gathered together internationally renowned researchers in the fields of optimization and uncertainty quantification. The resulting proceedings cover all related aspects of computational uncertainty management and optimization, with particular emphasis on aerospace engineering problems. The book contributions are organized under four major themes: Applications of Uncertainty in Aerospace & Engineering Imprecise Probability, Theory and Applications Robust and Reliability-Based Design Optimisation in Aerospace Engineering Uncertainty Quantification, Identification and Calibration in Aerospace Models This proceedings volume is useful across disciplines, as it brings the expertise of theoretical and application researchers together in a unified framework.

The contributions included in the volume are drawn from presentations at ODS2019 - International Conference on Optimization and Decision Science, which was the 49th annual meeting of the Italian Operations Research Society (AIRO) held at Genoa, Italy, on 4-7 September 2019. This book presents very recent results in the field of Optimization and Decision Science. While the book is addressed primarily to the Operations Research (OR) community, the interdisciplinary contents ensure that it will also be of very high interest for scholars and researchers from many scientific disciplines, including computer sciences, economics, mathematics, and engineering. Operations Research is known as the discipline of optimization applied to real-world problems and to complex decision-making fields. The focus is on mathematical and quantitative methods aimed at determining optimal or near-optimal solutions in acceptable computation times. This volume not only presents theoretical results but also covers real industrial applications, making it interesting for practitioners facing decision problems in logistics, manufacturing production, and services. Readers will accordingly find innovative ideas from both a methodological and an applied perspective.

This book studies R. Buckminster Fuller's World Game and similar world games, past and present. Proposed by Fuller in 1964 and first played in colleges and universities across North America at a time of growing ecological crisis, the World Game attempted to turn data analysis, systems modelling, scenario building, computer technology, and information design to more egalitarian ends to meet human needs. It challenged players to redistribute finite planetary resources more equitably, to 'make the world work'. Criticised and lauded in equal measure, the World Game has evolved through several formats and continues today in correspondence with debates on planetary stewardship, gamification, data management, and the democratic deficit. This book looks again at how the World Game has been played, focusing on its architecture, design, and gameplay. With hindsight, the World Game might appear naive, utopian, or technocratic, but we share its problems, if not necessarily its solutions. Such a study will be of interest to scholars working in art history, design history, game studies, media studies, architecture, and the environmental humanities.

An innovative feature of this book is its econocentric structure, focusing on digital designs. From the outset, econocentrism is assumed to be a core engine of capitalism, like money. The new coronavirus pandemic has changed lifestyles worldwide, which are unlikely ever to return in their original form. This great transformation will change the nature of the socio-economic system itself and will be centered on digital designs. At present, money already is beginning to undergo a major revolution in that sense. Many books dealing with digital designs and innovations have been published, but few if any of them focus on monetary and analytical methods in the way that this present volume does.The book then contains 6 parts: Evolution of money and thinking complexities in the AI era; Goods market and the future of labor market; Computational social approaches to social dilemmas, smart city, cryptocurrencies; Artificial market experiments; The randomness and high frequencies in financial data; Other trading strategy issues and the effects of AI usage. These issues may be indispensable subjects in our age. Study these subject, and have a step forward to the future society!

This book introduces research presented at the "International Conference on Artificial Intelligence: Advances and Applications-2019 (ICAIAA 2019)," a two-day conference and workshop bringing together leading academicians, researchers as well as students to share their experiences and findings on all aspects of engineering applications of artificial intelligence. The book covers research in the areas of artificial intelligence, machine learning, and deep learning applications in health care, agriculture, business and security. It also includes research in core concepts of computer networks, intelligent system design and deployment, real-time systems, WSN, sensors and sensor nodes, SDN and NFV. As such it is a valuable resource for students, academics and practitioners in industry working on AI applications.

This book investigates Reliability-based Multidisciplinary Design Optimization (RBMDO) theory and its application in the design of deep manned submersibles (DMSs). Multidisciplinary Design Optimization (MDO) is an effective design method for large engineering systems like aircraft, warships, and satellites, which require designers and engineers from various disciplines to cooperate with each other. MDO can be used to handle the conflicts that arise between these disciplines, and focuses on the optimal design of the system as a whole. However, it can also push designs to the brink of failure. In order to keep the system balanced, Reliability-based Design (RBD) must be incorporated into MDO. Consequently, new algorithms and methods have to be developed for RBMDO theory. This book provides an essential overview of MDO, RBD, and RBMDO and subsequently introduces key algorithms and methods by means of case analyses. In closing, it introduces readers to the design of DMSs and applies RBMDO methods to the design of the manned hull and the general concept design. The book is intended for all students and researchers who are interested in system design theory, and for engineers working on large, complex engineering systems.

The contributions appearing in this volume are a snapshot of the different topics that were discussed during the Second Conference "Mathematics and Image Processing held at the University of Orl ans in 2010. They mainly concern, image reconstruction, texture extraction and image classification and involve a variety of different methods and applications. Therefore it was impossible to split the papers into generic groups which is why they are presented in alphabetic order. However they mainly concern: texture analysis (5 papers) with different techniques (variational analysis, wavelet and morphological component analysis, fractional Brownian fields), geometrical methods (2 papers ) for restoration and invariant feature detection, classification (with multifractal analysis), neurosciences imaging and analysis of Multi-Valued Images.

The book is devoted to intelligent design of structures as a novel kind of designing based on computational intelligence. The proposed methodology based on computational intelligence has some heuristic and learning attributes typical for natural intelligence. Computer models of the structures are built on the base of the finite element method (FEM), the boundary element method (BEM) or coupling of FEM and BEM. The short description of possible discrete models of structures using these methods is included in the Chapter 2. Various kinds of intelligent approaches using sequential, parallel, distributed, fuzzy and hybrid evolutionary, immune and particle swarm algorithms and neural computing are presented in Chapter 3. Different kinds of optimization such as shape, topology, size and material optimization for structures under static and dynamical mechanical and thermo-mechanical loadings, structures with cracks and composite structures are considered in Chapter 4. Multi-objective optimization for coupled problems is also taken into account. Several numerical examples illustrating these kinds of optimization are presented for 2-D (plane-stress or plane-strain, plates, shells) as well as 3-D structures. Chapter 5 is devoted to special problems related to solving inverse problems in which boundary conditions, defects such as voids or cracks and material characteristics, are unknown. Closing comments summarizing the book are presented in Chapter 6.

The chapters in this volume explore how various methods from game theory can be utilized to optimize security and risk-management strategies. Emphasizing the importance of connecting theory and practice, they detail the steps involved in selecting, adapting, and analyzing game-theoretic models in security engineering and provide case studies of successful implementations in different application domains. Practitioners who are not experts in game theory and are uncertain about incorporating it into their work will benefit from this resource, as well as researchers in applied mathematics and computer science interested in current developments and future directions. The first part of the book presents the theoretical basics, covering various different game-theoretic models related to and suitable for security engineering. The second part then shows how these models are adopted, implemented, and analyzed. Surveillance systems, interconnected networks, and power grids are among the different application areas discussed. Finally, in the third part, case studies from business and industry of successful applications of game-theoretic models are presented, and the range of applications discussed is expanded to include such areas as cloud computing, Internet of Things, and water utility networks.

Metaheuristics exhibit desirable properties like simplicity, easy parallelizability, and ready applicability to different types of optimization problems. After a comprehensive introduction to the field, the contributed chapters in this book include explanations of the main metaheuristics techniques, including simulated annealing, tabu search, evolutionary algorithms, artificial ants, and particle swarms, followed by chapters that demonstrate their applications to problems such as multiobjective optimization, logistics, vehicle routing, and air traffic management. The authors are leading researchers in this domain, with considerable teaching and applications experience, and the book will be of value to industrial practitioners, graduate students, and research academics.

Global optimization is one of the fastest developing fields in mathematical optimization. In fact, an increasing number of remarkably efficient deterministic algorithms have been proposed in the last ten years for solving several classes of large scale specially structured problems encountered in such areas as chemical engineering, financial engineering, location and network optimization, production and inventory control, engineering design, computational geometry, and multi-objective and multi-level optimization. These new developments motivated the authors to write a new book devoted to global optimization problems with special structures. Most of these problems, though highly nonconvex, can be characterized by the property that they reduce to convex minimization problems when some of the variables are fixed. A number of recently developed algorithms have been proved surprisingly efficient for handling typical classes of problems exhibiting such structures, namely low rank nonconvex structures. Audience: The book will serve as a fundamental reference book for all those who are interested in mathematical optimization.

This proceedings presents the result of the 8th International Conference in Network Analysis, held at the Higher School of Economics, Moscow, in May 2018. The conference brought together scientists, engineers, and researchers from academia, industry, and government. Contributions in this book focus on the development of network algorithms for data mining and its applications. Researchers and students in mathematics, economics, statistics, computer science, and engineering find this collection a valuable resource filled with the latest research in network analysis. Computational aspects and applications of large-scale networks in market models, neural networks, social networks, power transmission grids, maximum clique problem, telecommunication networks, and complexity graphs are included with new tools for efficient network analysis of large-scale networks. Machine learning techniques in network settings including community detection, clustering, and biclustering algorithms are presented with applications to social network analysis.

This monograph studies optimization problems for rigid punches in elastic media and for high-speed penetration of rigid strikers into deformed elastoplastic, concrete, and composite media using variational calculations, tools from functional analysis, and stochastic and min-max (guaranteed) optimization approaches with incomplete data. The book presents analytical and numerical results developed by the authors during the last ten years.

This book is a compilation of recent research on distributed optimization algorithms for the integral load management of plug-in electric vehicle (PEV) fleets and their potential services to the electricity system. It also includes detailed developed Matlab scripts. These algorithms can be implemented and extended to diverse applications where energy management is required (smart buildings, railways systems, task sharing in micro-grids, etc.). The proposed methodologies optimally manage PEV fleets' charge and discharge schedules by applying classical optimization, game theory, and evolutionary game theory techniques. Taking owner's requirements into consideration, these approaches provide services like load shifting, load balancing among phases of the system, reactive power supply, and task sharing among PEVs. The book is intended for use in graduate optimization and energy management courses, and readers are encouraged to test and adapt the scripts to their specific applications.

This textbook provides a hands-on treatment of the subject of optimization. A comprehensive set of problems and exercises makes it suitable for use in one or two semesters of an advanced undergraduate course or a first-year graduate course. Each half of the book contains a full semester's worth of complementary yet stand-alone material. The practical orientation of the topics chosen and a wealth of useful examples also make the book suitable as a reference work for practitioners in the field. In this second edition the authors have added sections on recent innovations, techniques, and methodologies.

In everyday life we must often reach decisions while knowing that the outcome will not only depend on our own choice, but also on the choices of others. These situations are the focus of epistemic game theory. Unlike classical game theory, it explores how people may reason about their opponents before they make their final choice in a game. Packed with examples and practical problems based on stories from everyday life, this is the first textbook to explain the principles of epistemic game theory. Each chapter is dedicated to one particular, natural way of reasoning. The book then shows how each of these ways of reasoning will affect the final choices that can rationally be made and how these choices can be found by iterative procedures. Moreover, it does so in a way that uses elementary mathematics and does not presuppose any previous knowledge of game theory.