This comprehensive work examines important recent developments and modern applications in the fields of optimization, control, game theory and equilibrium programming. In particular, the concepts of equilibrium and optimality are of immense practical importance affecting decision-making problems regarding policy and strategies, and in understanding and predicting systems in different application domains, ranging from economics and engineering to military applications. The book consists of 29 survey chapters written by distinguished researchers in the above areas.

This book presents a comprehensive new, multi-objective and integrative view on traditional game and control theories. Consisting of 15 chapters, it is divided into three parts covering noncooperative games; mixtures of simultaneous and sequential multi-objective games; and multi-agent control of Pareto-Nash-Stackelberg-type games respectively. Can multicriteria optimization, game theory and optimal control be integrated into a unique theory? Are there mathematical models and solution concepts that could constitute the basis of a new paradigm? Is there a common approach and method to solve emerging problems? The book addresses these and other related questions and problems to create the foundation for the Pareto-Nash-Stackelberg Game and Control Theory. It considers a series of simultaneous/Nash and sequential/Stackelberg games, single-criterion and multicriteria/Pareto games, combining Nash and Stackelberg game concepts and Pareto optimization, as well as a range of notions related to system control. In addition, it considers the problems of finding and representing the entire set of solutions. Intended for researches, professors, specialists, and students in the areas of game theory, operational research, applied mathematics, economics, computer science and engineering, it also serves as a textbook for various courses in these fields.

We live in a highly connected world with multiple self-interested agents interacting and myriad opportunities for conflict and cooperation. The goal of game theory is to understand these opportunities. This book presents a rigorous introduction to the mathematics of game theory without losing sight of the joy of the subject. This is done by focusing on theoretical highlights (e.g., at least six Nobel Prize winning results are developed from scratch) and by presenting exciting connections of game theory to other fields such as computer science (algorithmic game theory), economics (auctions and matching markets), social choice (voting theory), biology (signaling and evolutionary stability), and learning theory. Both classical topics, such as zero-sum games, and modern topics, such as sponsored search auctions, are covered. Along the way, beautiful mathematical tools used in game theory are introduced, including convexity, fixed-point theorems, and probabilistic arguments. The book is appropriate for a first course in game theory at either the undergraduate or graduate level, whether in mathematics, economics, computer science, or statistics. The importance of game-theoretic thinking transcends the academic setting—for every action we take, we must consider not only its direct effects, but also how it influences the incentives of others.

The definitive introduction to game theory This comprehensive textbook introduces readers to the principal ideas and applications of game theory, in a style that combines rigor with accessibility. Steven Tadelis begins with a concise description of rational decision making, and goes on to discuss strategic and extensive form games with complete information, Bayesian games, and extensive form games with imperfect information. He covers a host of topics, including multistage and repeated games, bargaining theory, auctions, rent-seeking games, mechanism design, signaling games, reputation building, and information transmission games. Unlike other books on game theory, this one begins with the idea of rationality and explores its implications for multiperson decision problems through concepts like dominated strategies and rationalizability. Only then does it present the subject of Nash equilibrium and its derivatives. Game Theory is the ideal textbook for advanced undergraduate and beginning graduate students. Throughout, concepts and methods are explained using real-world examples backed by precise analytic material. The book features many important applications to economics and political science, as well as numerous exercises that focus on how to formalize informal situations and then analyze them. Introduces the core ideas and applications of game theory Covers static and dynamic games, with complete and incomplete information Features a variety of examples, applications, and exercises Topics include repeated games, bargaining, auctions, signaling, reputation, and information transmission Ideal for advanced undergraduate and beginning graduate students Complete solutions available to teachers and selected solutions available to students

The book focuses on Pareto optimality in cooperative games. Most of the existing works focus on the Pareto optimality of deterministic continuous-time systems or for the regular convex LQ case. To expand on the available literature, we explore the existence conditions of Pareto solutions in stochastic differential game for more general cases. In addition, the LQ Pareto game for stochastic singular systems, Pareto-based guaranteed cost control for uncertain mean-field stochastic systems, and the existence conditions of Pareto solutions in cooperative difference game are also studied in detail. Addressing Pareto optimality for more general cases and wider systems is one of the major features of the book, making it particularly suitable for readers who are interested in multi-objective optimal control. Accordingly, it offers a valuable asset for researchers, engineers, and graduate students in the fields of control theory and control engineering, economics, management science, mathematics, etc.

This book constitutes the refereed proceedings of the 15th International Symposium on Algorithms and Computation, ISAAC 2004, held in Hong Kong, China in December 2004. The 76 revised full papers presented were carefully reviewed and selected from 226 submissions. Among the topics addressed are computational geometry, graph computations, computational combinatorics, combinatorial optimization, computational complexity, scheduling, distributed algorithms, parallel algorithms, data structures, network optimization, randomized algorithms, and computational mathematics more generally.

This chapter considers the Nash equilibrium strategy profiles that are Pareto optimal with respect to the rest of the Nash equilibrium strategy profiles. The sufficient conditions for the existence of such pure strategy profiles are established. These conditions employ the Germeier convolutions of the payoff functions. For the noncooperative games with compact strategy sets and continuous payoff functions, the existence of the Pareto-optimal Nash equilibria (PoNE) in mixed strategies is proven.

This book integrates the fundamentals, methodology, and major application fields of noncooperative and cooperative games including conflict resolution. The topics addressed in the book are discrete and continuous games including games represented by finite trees; matrix and bimatrix games as well as oligopolies; cooperative solution concepts; games under uncertainty; dynamic games and conflict resolution. The methodology is illustrated by carefully chosen examples, applications and case studies which are selected from economics, social sciences, engineering, the military and homeland security. This book is highly recommended to readers who are interested in the in-depth and up-to-date integration of the theory and ever-expanding application areas of game theory.