Political Game Theory, first published in 2007, is a self-contained introduction to game theory and its applications to political science. The book presents choice theory, social choice theory, static and dynamic games of complete information, static and dynamic games of incomplete information, repeated games, bargaining theory, mechanism design and a mathematical appendix covering, logic, real analysis, calculus and probability theory. The methods employed have many applications in various disciplines including comparative politics, international relations and American politics. Political Game Theory is tailored to students without extensive backgrounds in mathematics, and traditional economics, however there are also many special sections that present technical material that will appeal to more advanced students. A large number of exercises are also provided to practice the skills and techniques discussed.

This book presents the latest findings on stochastic dynamic programming models and on solving optimal control problems in networks. It includes the authors' new findings on determining the optimal solution of discrete optimal control problems in networks and on solving game variants of Markov decision problems in the context of computational networks. First, the book studies the finite state space of Markov processes and reviews the existing methods and algorithms for determining the main characteristics in Markov chains, before proposing new approaches based on dynamic programming and combinatorial methods. Chapter two is dedicated to infinite horizon stochastic discrete optimal control models and Markov decision problems with average and expected total discounted optimization criteria, while Chapter three develops a special game-theoretical approach to Markov decision processes and stochastic discrete optimal control problems. In closing, the book's final chapter is devoted to finite horizon stochastic control problems and Markov decision processes. The algorithms developed represent a valuable contribution to the important field of computational network theory.

This book on PDE Constrained Optimization contains contributions on the mathematical analysis and numerical solution of constrained optimal control and optimization problems where a partial differential equation (PDE) or a system of PDEs appears as an essential part of the constraints. The appropriate treatment of such problems requires a fundamental understanding of the subtle interplay between optimization in function spaces and numerical discretization techniques and relies on advanced methodologies from the theory of PDEs and numerical analysis as well as scientific computing. The contributions reflect the work of the European Science Foundation Networking Programme ’Optimization with PDEs’ (OPTPDE).

Statistical Decision Problems presents a quick and concise introduction into the theory of risk, deviation and error measures that play a key role in statistical decision problems. It introduces state-of-the-art practical decision making through twenty-one case studies from real-life applications. The case studies cover a broad area of topics and the authors include links with source code and data, a very helpful tool for the reader. In its core, the text demonstrates how to use different factors to formulate statistical decision problems arising in various risk management applications, such as optimal hedging, portfolio optimization, cash flow matching, classification, and more. The presentation is organized into three parts: selected concepts of statistical decision theory, statistical decision problems, and case studies with portfolio safeguard. The text is primarily aimed at practitioners in the areas of risk management, decision making, and statistics. However, the inclusion of a fair bit of mathematical rigor renders this monograph an excellent introduction to the theory of general error, deviation, and risk measures for graduate students. It can be used as supplementary reading for graduate courses including statistical analysis, data mining, stochastic programming, financial engineering, to name a few. The high level of detail may serve useful to applied mathematicians, engineers, and statisticians interested in modeling and managing risk in various applications.

The International Conference on Health Care Systems Engineering (HCSE) provided a timely opportunity to discuss statistical analysis and operations management issues in health care delivery systems. The conference took place in Milan between May 22nd and 24th, 2013. Scientists and practitioners discussed new ideas, methods and technologies for improving the operation of health care organizations. The event and this resulting volume emphasize research in the field of health care systems engineering developed in close collaboration with clinicians. Topics applicable to researchers and practitioners include: hospital drug logistics, operating theatres, modelling and simulation in patient care and healthcare organizations, home care services.

This book shows how the use of S-variables (SVs) in enhancing the range of problems that can be addressed with the already-versatile linear matrix inequality (LMI) approach to control can, in many cases, be put on a more unified, methodical footing. Beginning with the fundamentals of the SV approach, the text shows how the basic idea can be used for each problem (and when it should not be employed at all). The specific adaptations of the method necessitated by each problem are also detailed. The problems dealt with in the book have the common traits that: analytic closed-form solutions are not available; and LMIs can be applied to produce numerical solutions with a certain amount of conservatism. Typical examples are robustness analysis of linear systems affected by parametric uncertainties and the synthesis of a linear controller satisfying multiple, often conflicting, design specifications. For problems in which LMI methods produce conservative results, the SV approach is shown to achieve greater accuracy. The authors emphasize the simplicity and easy comprehensibility of the SV approach and show how it can be implemented in programs without difficulty so that its power becomes readily apparent. The S-variable Approach to LMI-based Robust Control is a useful reference for academic control researchers, applied mathematicians and graduate students interested in LMI methods and convex optimization and will also be of considerable assistance to practising control engineers faced with problems of conservatism in their systems and controllers.

This book gives a complete classification of all algebras with the Kadison-Singer property, when restricting to separable Hilbert spaces. The Kadison-Singer property deals with the following question: given a Hilbert space H and an abelian unital C*-subalgebra A of B(H), does every pure state on A extend uniquely to a pure state on B(H)? This question has deep connections to fundamental aspects of quantum physics, as is explained in the foreword by Klaas Landsman. The book starts with an accessible introduction to the concept of states and continues with a detailed proof of the classification of maximal Abelian von Neumann algebras, a very explicit construction of the Stone-Cech compactification and an account of the recent proof of the Kadison-Singer problem. At the end accessible appendices provide the necessary background material. This elementary account of the Kadison-Singer conjecture is very well-suited for graduate students interested in operator algebras and states, researchers who are non-specialists of the field, and/or interested in fundamental quantum physics.

This book examines optimization problems that in practice involve random model parameters. It details the computation of robust optimal solutions, i.e., optimal solutions that are insensitive with respect to random parameter variations, where appropriate deterministic substitute problems are needed. Based on the probability distribution of the random data and using decision theoretical concepts, optimization problems under stochastic uncertainty are converted into appropriate deterministic substitute problems. Due to the probabilities and expectations involved, the book also shows how to apply approximative solution techniques. Several deterministic and stochastic approximation methods are provided: Taylor expansion methods, regression and response surface methods (RSM), probability inequalities, multiple linearization of survival/failure domains, discretization methods, convex approximation/deterministic descent directions/efficient points, stochastic approximation and gradient procedures and differentiation formulas for probabilities and expectations. In the third edition, this book further develops stochastic optimization methods. In particular, it now shows how to apply stochastic optimization methods to the approximate solution of important concrete problems arising in engineering, economics and operations research.

The authors present a new formal framework for finding the long-run competitive market equilibrium through short-run equilibria by exploiting the operating policies and plant valuations. This "short-run approach" develops ideas of Boiteux and Koopmans. Applied to the peak-load pricing of electricity generated by thermal, hydro and pumped-storage plants, it gives a sound and practical method of valuing the fixed assets-in this case, the river flows and the geological sites suitable for reservoirs. Its main mathematical basis is the producer's short-run profit maximization programme and its dual; their solutions have relatively simple forms that can greatly ease the fixed-point problem of solving for the general equilibrium. Since the optimal values (profit and cost functions) are usually nondifferentiable-this is so when there are joint costs of production such as capacity constraints-nonsmooth calculus is employed to resolve long-standing discrepancies between textbook theory and industrial reality by giving subdifferential extensions of basic results of microeconomics, including the Wong-Viner Envelope Theorem.

Optimization has long been a source of both inspiration and applications for geometers, and conversely, discrete and convex geometry have provided the foundations for many optimization techniques, leading to a rich interplay between these subjects. The purpose of the Workshop on Discrete Geometry, the Conference on Discrete Geometry and Optimization, and the Workshop on Optimization, held in September 2011 at the Fields Institute, Toronto, was to further stimulate the interaction between geometers and optimizers. This volume reflects the interplay between these areas. The inspiring Fejes Toth Lecture Series, delivered by Thomas Hales of the University of Pittsburgh, exemplified this approach. While these fields have recently witnessed a lot of activity and successes, many questions remain open. For example, Fields medalist Stephen Smale stated that the question of the existence of a strongly polynomial time algorithm for linear optimization is one of the most important unsolved problems at the beginning of the 21st century. The broad range of topics covered in this volume demonstrates the many recent and fruitful connections between different approaches, and features novel results and state-of-the-art surveys as well as open problems.

With the proliferation of Software-as-a-Service (SaaS) offerings, it is becoming increasingly important for individual SaaS providers to operate their services at a low cost. This book investigates SaaS from the perspective of the provider and shows how operational costs can be reduced by using "multi tenancy," a technique for consolidating a large number of customers onto a small number of servers. Specifically, the book addresses multi tenancy on the database level, focusing on in-memory column databases, which are the backbone of many important new enterprise applications. For efficiently implementing multi tenancy in a farm of databases, two fundamental challenges must be addressed, (i) workload modeling and (ii) data placement. The first involves estimating the (shared) resource consumption for multi tenancy on a single in-memory database server. The second consists in assigning tenants to servers in a way that minimizes the number of required servers (and thus costs) based on the assumed workload model. This step also entails replicating tenants for performance and high availability. This book presents novel solutions to both problems.

In 1958, Ralph E. Gomory transformed the field of integer programming when he published a paper that described a cutting-plane algorithm for pure integer programs and announced that the method could be refined to give a finite algorithm for integer programming. In 2008, to commemorate the anniversary of this seminal paper, a special workshop celebrating fifty years of integer programming was held in Aussois, France, as part of the 12th Combinatorial Optimization Workshop. It contains reprints of key historical articles and written versions of survey lectures on six of the hottest topics in the field by distinguished members of the integer programming community. Useful for anyone in mathematics, computer science and operations research, this book exposes mathematical optimization, specifically integer programming and combinatorial optimization, to a broad audience.

This book explores the extremely modular systems that meet two criteria: they allow the creation of structurally sound free-form structures, and they are comprised of as few types of modules as possible. Divided into two parts, it presents Pipe-Z (PZ) and Truss-Z (TZ) systems. PZ is more fundamental and forms spatial mathematical knots by assembling one type of unit (PZM). The shape of PZ is controlled by relative twists of a sequence of congruent PZMs. TZ is a skeletal system for creating free-form pedestrian ramps and ramp networks among any number of terminals in space. TZ structures are composed of four variations of a single basic unit subjected to affine transformations (mirror reflection, rotation and combination of both).

This book constitutes the refereed proceedings of the 9th International Symposium on Algorithmic Game Theory, SAGT 2016, held in Liverpool, UK, in September 2016.The 26 full papers presented together with 2 one-page abstracts were carefully reviewed and selected from 62 submissions. The accepted submissions cover various important aspectsof algorithmic game theory such as computational aspects of games, congestion games and networks, matching and voting, auctions and markets, and mechanism design.

Networks and Network Analysis for Defence and Security discusses relevant theoretical frameworks and applications of network analysis in support of the defence and security domains. This book details real world applications of network analysis to support defence and security. Shocks to regional, national and global systems stemming from natural hazards, acts of armed violence, terrorism and serious and organized crime have significant defence and security implications. Today, nations face an uncertain and complex security landscape in which threats impact/target the physical, social, economic and cyber domains. Threats to national security, such as that against critical infrastructures not only stem from man-made acts but also from natural hazards. Katrina (2005), Fukushima (2011) and Hurricane Sandy (2012) are examples highlighting the vulnerability of critical infrastructures to natural hazards and the crippling effect they have on the social and economic well-being of a community and a nation. With this dynamic and complex threat landscape, network analysis has emerged as a key enabler in supporting defence and security. With the advent of ‘big data’ and increasing processing power, network analysis can reveal insights with regards to structural and dynamic properties thereby facilitating greater understanding of complex networks, their entities, interdependencies, vulnerabilities to produce insights for creative solutions. This book will be well positioned to inform defence, security and intelligence professionals and researchers with regards to leading methodologies and approaches.

The focus of the present volume is stochastic optimization of dynamical systems in discrete time where - by concentrating on the role of information regarding optimization problems - it discusses the related discretization issues. There is a growing need to tackle uncertainty in applications of optimization. For example the massive introduction of renewable energies in power systems challenges traditional ways to manage them. This book lays out basic and advanced tools to handle and numerically solve such problems and thereby is building a bridge between Stochastic Programming and Stochastic Control. It is intended for graduates readers and scholars in optimization or stochastic control, as well as engineers with a background in applied mathematics.

A lot of economic problems can be formulated as constrained optimizations and equilibration of their solutions. Various mathematical theories have been supplying economists with indispensable machineries for these problems arising in economic theory. Conversely, mathematicians have been stimulated by various mathematical difficulties raised by economic theories. The series is designed to bring together those mathematicians who are seriously interested in getting new challenging stimuli from economic theories with those economists who are seeking effective mathematical tools for their research.

Although they are believed to be unsolvable in general, tractability results suggest that some practical NP-hard problems can be efficiently solved. Combinatorial search algorithms are designed to efficiently explore the usually large solution space of these instances by reducing the search space to feasible regions and using heuristics to efficiently explore these regions. Various mathematical formalisms may be used to express and tackle combinatorial problems, among them the constraint satisfaction problem (CSP) and the propositional satisfiability problem (SAT). These algorithms, or constraint solvers, apply search space reduction through inference techniques, use activity-based heuristics to guide exploration, diversify the searches through frequent restarts, and often learn from their mistakes. In this book the author focuses on knowledge sharing in combinatorial search, the capacity to generate and exploit meaningful information, such as redundant constraints, heuristic hints, and performance measures, during search, which can dramatically improve the performance of a constraint solver. Information can be shared between multiple constraint solvers simultaneously working on the same instance, or information can help achieve good performance while solving a large set of related instances. In the first case, information sharing has to be performed at the expense of the underlying search effort, since a solver has to stop its main effort to prepare and commu nicate the information to other solvers; on the other hand, not sharing information can incur a cost for the whole system, with solvers potentially exploring unfeasible spaces discovered by other solvers. In the second case, sharing performance measures can be done with little overhead, and the goal is to be able to tune a constraint solver in relation to the characteristics of a new instance - this corresponds to the selection of the most suitable algorithm for solving a given instance. The book is suitable for researchers, practitioners, and graduate students working in the areas of optimization, search, constraints, and computational complexity.

Presenting a study of geometric action functionals (i.e., non-negative functionals on the space of unparameterized oriented rectifiable curves), this monograph focuses on the subclass of those functionals whose local action is a degenerate type of Finsler metric that may vanish in certain directions, allowing for curves with positive Euclidean length but with zero action. For such functionals, criteria are developed under which there exists a minimum action curve leading from one given set to another. Then the properties of this curve are studied, and the non-existence of minimizers is established in some settings. Applied to a geometric reformulation of the quasipotential of Wentzell-Freidlin theory (a subfield of large deviation theory), these results can yield the existence and properties of maximum likelihood transition curves between two metastable states in a stochastic process with small noise. The book assumes only standard knowledge in graduate-level analysis; all higher-level mathematical concepts are introduced along the way.

The book presents applications of stochastic calculus to derivative security pricing and interest rate modelling. By focusing more on the financial intuition of the applications rather than the mathematical formalities, the book provides the essential knowledge and understanding of fundamental concepts of stochastic finance, and how to implement them to develop pricing models for derivatives as well as to model spot and forward interest rates. Furthermore an extensive overview of the associated literature is presented and its relevance and applicability are discussed. Most of the key concepts are covered including Ito's Lemma, martingales, Girsanov's theorem, Brownian motion, jump processes, stochastic volatility, American feature and binomial trees. The book is beneficial to higher-degree research students, academics and practitioners as it provides the elementary theoretical tools to apply the techniques of stochastic finance in research or industrial problems in the field.

This book presents the works and research findings of physicists, economists, mathematicians, statisticians, and financial engineers who have undertaken data-driven modelling of market dynamics and other empirical studies in the field of Econophysics. During recent decades, the financial market landscape has changed dramatically with the deregulation of markets and the growing complexity of products. The ever-increasing speed and decreasing costs of computational power and networks have led to the emergence of huge databases. The availability of these data should permit the development of models that are better founded empirically, and econophysicists have accordingly been advocating that one should rely primarily on the empirical observations in order to construct models and validate them. The recent turmoil in financial markets and the 2008 crash appear to offer a strong rationale for new models and approaches. The Econophysics community accordingly has an important future role to play in market modelling. The Econophys-Kolkata VIII conference proceedings are devoted to the presentation of many such modelling efforts and address recent developments. A number of leading researchers from across the globe report on their recent work, comment on the latest issues, and review the contemporary literature.

This book shows how the use of S-variables (SVs) in enhancing the range of problems that can be addressed with the already-versatile linear matrix inequality (LMI) approach to control can, in many cases, be put on a more unified, methodical footing. Beginning with the fundamentals of the SV approach, the text shows how the basic idea can be used for each problem (and when it should not be employed at all). The specific adaptations of the method necessitated by each problem are also detailed. The problems dealt with in the book have the common traits that: analytic closed-form solutions are not available; and LMIs can be applied to produce numerical solutions with a certain amount of conservatism. Typical examples are robustness analysis of linear systems affected by parametric uncertainties and the synthesis of a linear controller satisfying multiple, often  conflicting, design specifications. For problems in which LMI methods produce conservative results, the SV approach is shown to achieve greater accuracy. The authors emphasize the simplicity and easy comprehensibility of the SV approach and show how it can be implemented in programs without difficulty so that its power becomes readily apparent. The S-variable Approach to LMI-based Robust Control is a useful reference for academic control researchers, applied mathematicians and graduate students interested in LMI methods and convex optimization and will also be of considerable assistance to practising control engineers faced with problems of conservatism in their systems and controllers.

The contributions in this volume have been written by eminent scientists from the international mathematical community and present significant advances in several theories, methods and problems of Mathematical Analysis, Discrete Mathematics, Geometry and their Applications. The chapters focus on both old and recent developments in Functional Analysis, Harmonic Analysis, Complex Analysis, Operator Theory, Combinatorics, Functional Equations, Differential Equations as well as a variety of Applications. The book also contains some review works, which could prove particularly useful for a broader audience of readers in Mathematical Sciences, and especially to graduate students looking for the latest information.

This special volume is a collection of outstanding more applied articles presented in AMAT 2015 held in Ankara, May 28-31, 2015, at TOBB Economics and Technology University. The collection is suitable for Applied and Computational Mathematics and Engineering practitioners, also for related graduate students and researchers. Furthermore it will be a useful resource for all science and engineering libraries. This book includes 29 self-contained and well-edited chapters that can be among others useful for seminars in applied and computational mathematics, as well as in engineering.

Optimal analysis is defined as an analysis that creates and uses sparse, well-structured and well-conditioned matrices. The focus is on efficient methods for eigensolution of matrices involved in static, dynamic and stability analyses of symmetric and regular structures, or those general structures containing such components. Powerful tools are also developed for configuration processing, which is an important issue in the analysis and design of space structures and finite element models. Different mathematical concepts are combined to make the optimal analysis of structures feasible. Canonical forms from matrix algebra, product graphs from graph theory and symmetry groups from group theory are some of the concepts involved in the variety of efficient methods and algorithms presented. The algorithms elucidated in this book enable analysts to handle large-scale structural systems by lowering their computational cost, thus fulfilling the requirement for faster analysis and design of future complex systems. The value of the presented methods becomes all the more evident in cases where the analysis needs to be repeated hundreds or even thousands of times, as for the optimal design of structures by different metaheuristic algorithms. The book is of interest to anyone engaged in computer-aided analysis and design and software developers in this field. Though the methods are demonstrated mainly through skeletal structures, continuum models have also been added to show the generality of the methods. The concepts presented are not only applicable to different types of structures but can also be used for the analysis of other systems such as hydraulic and electrical networks.