Oligopoly theory is one of the most intensively studied areas of mathematical economics. On the basis of the pioneering works of Cournot (1838), many res- rchers have developed and extensively examined the different variants of oligopoly models. Initially, the existence and uniqueness of the equilibrium of the different types of oligopolies was the main concern, and later the dynamic extensions of these models became the focus. The classical result of Theocharis (1960) asserts that under discrete time scales and static expectations, the equilibrium of a sing- product oligopoly without product differentiation and with linear price and cost functions is asymptotically stable if and only if it is a duopoly. In the continuous time case, asymptotic stability is guaranteed for any number of ?rms. In these cases the resulting dynamical systems are also linear, where local and global asymptotic stability are equivalent to each other. The classical book of Okuguchi (1976) gives a comprehensive summary of the earlier results and developments. The multipr- uct extensionshave been discussed in Okuguchiand Szidarovszky(1999);however, nonlinear features were barely touched upon in these contributions. WiththedevelopmentofthecriticalcurvemethodbyGumowskiandMira(1980) (see also Mira et al. (1996))fordiscrete time systemsand the introductionof cont- uously distributed information lags by Invernizzi and Medio (1991) in continuous time systems, increasing attention has been given to the global dynamics of n- linear oligopolies. The authors of this book have devoted a great deal of research effort to this area.

This book is a detailed introduction to selective maintenance and updates readers on recent advances in this field, emphasizing mathematical formulation and optimization techniques. The book is useful for reliability engineers and managers engaged in the practice of reliability engineering and maintenance management. It also provides references that will lead to further studies at the end of each chapter. This book is a reference for researchers in reliability and maintenance and can be used as an advanced text for students.

This book presents a panorama about the recent progress of industrial mathematics from the point of view of both industrials and researchers. The chapters correspond to a selection of the contributions presented in the "Industry Day" and in the Minisymposium "EU - MATHS - IN: Success Stories of Applications of Mathematics to Industry" organized in the framework of the International Conference ICIAM 2019 held in Valencia (Spain) on July 15-19, 2019. In the Industry Day, included for the first time in this series of Conferences, representatives of companies from different countries and several sectors presented their view about the benefits regarding the usage of mathematical tools and/or collaboration with mathematicians. The contributions of this special session were addressed to industry people. Minisymposium contributions detailed some collaborations between mathematicians and industrials that led to real benefits in several European companies. All the speakers were affiliated in some of the European National Networks that constitute the European Service Network of Mathematics for Industry and Innovation (EU-MATHS-IN).

This book introduces an analytic framework constructed upon the iterated Prisoners' Dilemma game to model and analyze transboundary water interactions along the Nile River. It presents a thorough and in-depth analysis of the historical path through which conflict and cooperation have been generated among the Nile riparians over large-scale developmental schemes. This is done through modeling water interactions in the basin as an iterated Prisoners' Dilemma game and employing process-tracing method to compare four distinguishable rounds of the game: the colonial round, the Cold War round, the post-Cold War round, and the post-2011 round. The book examines the influences of the changing political contexts at the domestic, regional, and global levels on the game outcomes. This framework is initially applied on several cases of international rivers worldwide, while the rest of the book is devoted to the Nile case. The book's central argument is that the riparians' interests, capabilities, and beliefs are heterogeneous in varying degrees and that the changing multilevel political contexts influence the level of such heterogeneities among the riparians, which ultimately drive the equilibrium dynamics in the Nile game to generate different conflictive and cooperative outcomes over time. Although the book's main conclusion indicates that the absence of economic interdependence and regional integration will transfer the game into tug-of-war, which will impose harsh punishment on the basin communities and ecosystems on the long term, the final chapter lists a group of recommendations addressed to the riparian states and international donors, exploring the way for boosting cooperation and preventing conflicts in the basin. Presenting clear theoretical, methodological, and policy implications, this book is appropriate for students and scholars of international relations, hydrology, and development studies.

Mathematical Puzzle Tales from Mount Olympus uses fascinating tales from Greek Mythology as the background for introducing mathematics puzzles to the general public. A background in high school mathematics will be ample preparation for using this book, and it should appeal to anyone who enjoys puzzles and recreational mathematics. Features: Combines the arts and science, and emphasizes the fact that mathematics straddles both domains. Great resource for students preparing for mathematics competitions, and the trainers of such students.

This text provides a framework in which the main objectives of the field of uncertainty quantification (UQ) are defined and an overview of the range of mathematical methods by which they can be achieved. Complete with exercises throughout, the book will equip readers with both theoretical understanding and practical experience of the key mathematical and algorithmic tools underlying the treatment of uncertainty in modern applied mathematics. Students and readers alike are encouraged to apply the mathematical methods discussed in this book to their own favorite problems to understand their strengths and weaknesses, also making the text suitable for a self-study. Uncertainty quantification is a topic of increasing practical importance at the intersection of applied mathematics, statistics, computation and numerous application areas in science and engineering. This text is designed as an introduction to UQ for senior undergraduate and graduate students with a mathematical or statistical background and also for researchers from the mathematical sciences or from applications areas who are interested in the field. T. J. Sullivan was Warwick Zeeman Lecturer at the Mathematics Institute of the University of Warwick, United Kingdom, from 2012 to 2015. Since 2015, he is Junior Professor of Applied Mathematics at the Free University of Berlin, Germany, with specialism in Uncertainty and Risk Quantification.

This book presents an epistemic framework for dealing with information-knowledge and certainty-uncertainty problems within the space of quality-quantity dualities. It bridges between theoretical concepts of entropy and entropy measurements, proposing the concept and measurement of fuzzy-stochastic entropy that is applicable to all areas of knowing under human cognitive limitations over the epistemological space. The book builds on two previous monographs by the same author concerning theories of info-statics and info-dynamics, to deal with identification and transformation problems respectively. The theoretical framework is developed by using the toolboxes such as those of the principle of opposites, systems of actual-potential polarities and negative-positive dualities, under different cost-benefit time-structures. The category theory and the fuzzy paradigm of thought, under methodological constructionism-reductionism duality, are used in the fuzzy-stochastic and cost-benefit spaces to point to directions of global application in knowing, knowledge and decision-choice actions. Thus, the book is concerned with a general theory of entropy, showing how the fuzzy paradigm of thought is developed to deal with the problems of qualitative-quantitative uncertainties over the fuzzy-stochastic space, which will be applicable to conditions of soft-hard data, fact, evidence and knowledge over the spaces of problem-solution dualities, decision-choice actions in sciences, non-sciences, engineering and planning sciences to abstract acceptable information-knowledge elements.

Reviews the literature of the Moth-Flame Optimization algorithm; Provides an in-depth analysis of equations, mathematical models, and mechanisms of the Moth-Flame Optimization algorithm; Proposes different variants of the Moth-Flame Optimization algorithm to solve binary, multi-objective, noisy, dynamic, and combinatorial optimization problems; Demonstrates how to design, develop, and test different hybrids of Moth-Flame Optimization algorithm; Introduces several applications areas of the Moth-Flame Optimization algorithm focusing in sustainability.

This book proposes novel methods for solving different types of non-cooperative games with interval/fuzzy/intuitionistic fuzzy payoffs. It starts by discussing several existing methods and shows that some mathematically incorrect assumptions have been considered in all these methods. It then proposes solutions to adapt those methods and validate the new proposed methods, such as Gaurika method Ambika-I-IV, Mehar method and others, by using them for solving existing numerical problems. The book offers a comprehensive guide on non-cooperative games with fuzzy payoffs to both students and researchers. It provides them with the all the necessary tools to understand the methods and the theory behind them.

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

Optimization problems were and still are the focus of mathematics from antiquity to the present. Since the beginning of our civilization, the human race has had to confront numerous technological challenges, such as finding the optimal solution of various problems including control technologies, power sources construction, applications in economy, mechanical engineering and energy distribution amongst others. These examples encompass both ancient as well as modern technologies like the first electrical energy distribution network in USA etc. Some of the key principles formulated in the middle ages were done by Johannes Kepler (Problem of the wine barrels), Johan Bernoulli (brachystochrone problem), Leonhard Euler (Calculus of Variations), Lagrange (Principle multipliers), that were formulated primarily in the ancient world and are of a geometric nature. In the beginning of the modern era, works of L.V. Kantorovich and G.B. Dantzig (so-called linear programming) can be considered amongst others. This book discusses a wide spectrum of optimization methods from classical to modern, alike heuristics. Novel as well as classical techniques is also discussed in this book, including its mutual intersection. Together with many interesting chapters, a reader will also encounter various methods used for proposed optimization approaches, such as game theory and evolutionary algorithms or modelling of evolutionary algorithm dynamics like complex networks.

Many systems architecture optimization problems are characterized by a variable number of optimization variables. Many classical optimization algorithms are not suitable for such problems. The book presents recently developed optimization concepts that are designed to solve such problems. These new concepts are implemented using genetic algorithms and differential evolution. The examples and applications presented show the effectiveness of the use of these new algorithms in optimizing systems architectures. The book focuses on systems architecture optimization. It covers new algorithms and its applications, besides reviewing fundamental mathematical concepts and classical optimization methods. It also provides detailed modeling of sample engineering problems. The book is suitable for graduate engineering students and engineers. The second part of the book includes numerical examples on classical optimization algorithms, which are useful for undergraduate engineering students. While focusing on the algorithms and their implementation, the applications in this book cover the space trajectory optimization problem, the optimization of earth orbiting satellites orbits, and the optimization of the wave energy converter dynamic system: architecture and control. These applications are illustrated in the starting of the book, and are used as case studies in later chapters for the optimization methods presented in the book.

This book surveys the state-of-the-art in the theory of combinatorial games, that is games not involving chance or hidden information. Enthusiasts will find a wide variety of exciting topics, from a trailblazing presentation of scoring to solutions of three piece ending positions of bidding chess. Theories and techniques in many subfields are covered, such as universality, Wythoff Nim variations, misere play, partizan bidding (a.k.a. Richman games), loopy games, and the algebra of placement games. Also included are an updated list of unsolved problems, extremely efficient algorithms for taking and breaking games, a historical exposition of binary numbers and games by David Singmaster, chromatic Nim variations, renormalization for combinatorial games, and a survey of temperature theory by Elwyn Berlekamp, one of the founders of the field. The volume was initiated at the Combinatorial Game Theory Workshop, January 2011, held at the Banff International Research Station.

This book describes the fundamental and theoretical concepts of optimization algorithms in a systematic manner, along with their potential applications and implementation strategies in mining engineering. It explains basics of systems engineering, linear programming, and integer linear programming, transportation and assignment algorithms, network analysis, dynamic programming, queuing theory and their applications to mine systems. Reliability analysis of mine systems, inventory management in mines, and applications of non-linear optimization in mines are discussed as well. All the optimization algorithms are explained with suitable examples and numerical problems in each of the chapters. Features include: * Integrates operations research, reliability, and novel computerized technologies in single volume, with a modern vision of continuous improvement of mining systems. * Systematically reviews optimization methods and algorithms applied to mining systems including reliability analysis. * Gives out software-based solutions such as MATLAB (R), AMPL, LINDO for the optimization problems. * All discussed algorithms are supported by examples in each chapter. * Includes case studies for performance improvement of the mine systems. This book is aimed primarily at professionals, graduate students, and researchers in mining engineering.

Optimal feedback control arises in different areas such as aerospace engineering, chemical processing, resource economics, etc. In this context, the application of dynamic programming techniques leads to the solution of fully nonlinear Hamilton-Jacobi-Bellman equations. This book presents the state of the art in the numerical approximation of Hamilton-Jacobi-Bellman equations, including post-processing of Galerkin methods, high-order methods, boundary treatment in semi-Lagrangian schemes, reduced basis methods, comparison principles for viscosity solutions, max-plus methods, and the numerical approximation of Monge-Ampere equations. This book also features applications in the simulation of adaptive controllers and the control of nonlinear delay differential equations. Contents From a monotone probabilistic scheme to a probabilistic max-plus algorithm for solving Hamilton-Jacobi-Bellman equations Improving policies for Hamilton-Jacobi-Bellman equations by postprocessing Viability approach to simulation of an adaptive controller Galerkin approximations for the optimal control of nonlinear delay differential equations Efficient higher order time discretization schemes for Hamilton-Jacobi-Bellman equations based on diagonally implicit symplectic Runge-Kutta methods Numerical solution of the simple Monge-Ampere equation with nonconvex Dirichlet data on nonconvex domains On the notion of boundary conditions in comparison principles for viscosity solutions Boundary mesh refinement for semi-Lagrangian schemes A reduced basis method for the Hamilton-Jacobi-Bellman equation within the European Union Emission Trading Scheme

In a series of conversational essays, this textbook discusses the manner in which economic thought addresses a broad array of everyday issues beyond classical textbook treatments. In the spirit of popular economics books, the author uncovers economic issues and solutions from individuals, businesses, society, and the country as a whole in a decidedly non-technical and relatable manner. Should the federal government mandate use of child safety seats on commercial airlines? Can genetic information substitute for a college degree? The contents of this book touch on many of these contemporary topics in an accessible way. Addressing undergraduate and graduate students, as well as scholars in different fields of economics, this book is a must-read for everybody interested in a better understanding of economic thought.

This work presents recent mathematical methods in the area of optimal control with a particular emphasis on the computational aspects and applications. Optimal control theory concerns the determination of control strategies for complex dynamical systems, in order to optimize some measure of their performance. Started in the 60's under the pressure of the "space race" between the US and the former USSR, the field now has a far wider scope, and embraces a variety of areas ranging from process control to traffic flow optimization, renewable resources exploitation and management of financial markets. These emerging applications require more and more efficient numerical methods for their solution, a very difficult task due the huge number of variables. The chapters of this volume give an up-to-date presentation of several recent methods in this area including fast dynamic programming algorithms, model predictive control and max-plus techniques. This book is addressed to researchers, graduate students and applied scientists working in the area of control problems, differential games and their applications.

The rich, multi-faceted and multi-disciplinary field of matching-based market design is an active and important one due to its highly successful applications with economic and sociological impact. Its home is economics, but with intimate connections to algorithm design and operations research. With chapters contributed by over fifty top researchers from all three disciplines, this volume is unique in its breadth and depth, while still being a cohesive and unified picture of the field, suitable for the uninitiated as well as the expert. It explains the dominant ideas from computer science and economics underlying the most important results on market design and introduces the main algorithmic questions and combinatorial structures. Methodologies and applications from both the pre-Internet and post-Internet eras are covered in detail. Key chapters discuss the basic notions of efficiency, fairness and incentives, and the way market design seeks solutions guided by normative criteria borrowed from social choice theory.

This book discusses an important area of numerical optimization, called interior-point method. This topic has been popular since the 1980s when people gradually realized that all simplex algorithms were not convergent in polynomial time and many interior-point algorithms could be proved to converge in polynomial time. However, for a long time, there was a noticeable gap between theoretical polynomial bounds of the interior-point algorithms and efficiency of these algorithms. Strategies that were important to the computational efficiency became barriers in the proof of good polynomial bounds. The more the strategies were used in algorithms, the worse the polynomial bounds became. To further exacerbate the problem, Mehrotra's predictor-corrector (MPC) algorithm (the most popular and efficient interior-point algorithm until recently) uses all good strategies and fails to prove the convergence. Therefore, MPC does not have polynomiality, a critical issue with the simplex method. This book discusses recent developments that resolves the dilemma. It has three major parts. The first, including Chapters 1, 2, 3, and 4, presents some of the most important algorithms during the development of the interior-point method around the 1990s, most of them are widely known. The main purpose of this part is to explain the dilemma described above by analyzing these algorithms' polynomial bounds and summarizing the computational experience associated with them. The second part, including Chapters 5, 6, 7, and 8, describes how to solve the dilemma step-by-step using arc-search techniques. At the end of this part, a very efficient algorithm with the lowest polynomial bound is presented. The last part, including Chapters 9, 10, 11, and 12, extends arc-search techniques to some more general problems, such as convex quadratic programming, linear complementarity problem, and semi-definite programming.

This book deals with critical infrastructure safety analysis based on reliability modelling of multistate ageing system. It shows how changes of the operation process as well as climate-weather changes in the operating area of the critical infrastructure do influence the safety parameters of its assets. Building upon previous authors' research, the book formulates an integrated modeling approach where the multistate critical infrastructure safety model is combined with semi-Markov models for its operation process and for the climate-weather change process. This approach is shown to be successful in determining basic critical infrastructure safety, risk and resilience indicators, regardless of the number of assets and the number of their safety states. Besides the theory, the book reports on a successful application to the safety analysis of a real critical infrastructure, such as a port oil terminal. All in all, this book proposes a comprehensive and timely review of cutting-edge mathematical methods for safety identification, prediction and evaluation of critical infrastructures. It demonstrates that these methods can be applied in practice for analyzing safety of critical infrastructure under time-varying operation and climate-weather change processes.

This book details cutting-edge research into human-like driving technology, utilising game theory to better suit a human and machine hybrid driving environment. Covering feature identification and modelling of human driving behaviours, the book explains how to design an algorithm for decision making and control of autonomous vehicles in complex scenarios. Beginning with a review of current research in the field, the book uses this as a springboard from which to present a new theory of human-like driving framework for autonomous vehicles. Chapters cover system models of decision making and control, driving safety, riding comfort and travel efficiency. Throughout the book, game theory is applied to human-like decision making, enabling the autonomous vehicle and the human driver interaction to be modelled using noncooperative game theory approach. It also uses game theory to model collaborative decision making between connected autonomous vehicles. This framework enables human-like decision making and control of autonomous vehicles, which leads to safer and more efficient driving in complicated traffic scenarios. The book will be of interest to students and professionals alike, in the field of automotive engineering, computer engineering and control engineering.