Stochastic Games and Related Concepts


Book Description

This book discusses stochastic game theory and related concepts. Topics focused upon in the book include matrix games, finite, infinite, and undiscounted stochastic games, n-player cooperative games, minimax theorem, and more. In addition to important definitions and theorems, the book provides readers with a range of problem-solving techniques and exercises. This book is of value to graduate students and readers of probability and statistics alike.




Stochastic Multiplayer Games


Book Description

Stochastic games provide a versatile model for reactive systems that are affected by random events. This dissertation advances the algorithmic theory of stochastic games to incorporate multiple players, whose objectives are not necessarily conflicting. The basis of this work is a comprehensive complexity-theoretic analysis of the standard game-theoretic solution concepts in the context of stochastic games over a finite state space. One main result is that the constrained existence of a Nash equilibrium becomes undecidable in this setting. This impossibility result is accompanied by several positive results, including efficient algorithms for natural special cases.




Stochastic Games And Related Topics


Book Description




Game Theory and Machine Learning for Cyber Security


Book Description

GAME THEORY AND MACHINE LEARNING FOR CYBER SECURITY Move beyond the foundations of machine learning and game theory in cyber security to the latest research in this cutting-edge field In Game Theory and Machine Learning for Cyber Security, a team of expert security researchers delivers a collection of central research contributions from both machine learning and game theory applicable to cybersecurity. The distinguished editors have included resources that address open research questions in game theory and machine learning applied to cyber security systems and examine the strengths and limitations of current game theoretic models for cyber security. Readers will explore the vulnerabilities of traditional machine learning algorithms and how they can be mitigated in an adversarial machine learning approach. The book offers a comprehensive suite of solutions to a broad range of technical issues in applying game theory and machine learning to solve cyber security challenges. Beginning with an introduction to foundational concepts in game theory, machine learning, cyber security, and cyber deception, the editors provide readers with resources that discuss the latest in hypergames, behavioral game theory, adversarial machine learning, generative adversarial networks, and multi-agent reinforcement learning. Readers will also enjoy: A thorough introduction to game theory for cyber deception, including scalable algorithms for identifying stealthy attackers in a game theoretic framework, honeypot allocation over attack graphs, and behavioral games for cyber deception An exploration of game theory for cyber security, including actionable game-theoretic adversarial intervention detection against advanced persistent threats Practical discussions of adversarial machine learning for cyber security, including adversarial machine learning in 5G security and machine learning-driven fault injection in cyber-physical systems In-depth examinations of generative models for cyber security Perfect for researchers, students, and experts in the fields of computer science and engineering, Game Theory and Machine Learning for Cyber Security is also an indispensable resource for industry professionals, military personnel, researchers, faculty, and students with an interest in cyber security.




N-Person Game Theory


Book Description

DIVSequel to Two-Person Game Theory introduces necessary mathematical notation (mainly set theory), presents basic concepts and models, and provides applications to social situations. /div




Essentials of Game Theory


Book Description

Game theory is the mathematical study of interaction among independent, self-interested agents. The audience for game theory has grown dramatically in recent years, and now spans disciplines as diverse as political science, biology, psychology, economics, linguistics, sociology, and computer science, among others. What has been missing is a relatively short introduction to the field covering the common basis that anyone with a professional interest in game theory is likely to require. Such a text would minimize notation, ruthlessly focus on essentials, and yet not sacrifice rigor. This Synthesis Lecture aims to fill this gap by providing a concise and accessible introduction to the field. It covers the main classes of games, their representations, and the main concepts used to analyze them.




The Theory of Learning in Games


Book Description

This work explains that equilibrium is the long-run outcome of a process in which non-fully rational players search for optimality over time. The models they e×plore provide a foundation for equilibrium theory and suggest ways for economists to evaluate and modify traditional equilibrium concepts.




Evolutionary Game Dynamics


Book Description

This volume is based on lectures delivered at the 2011 AMS Short Course on Evolutionary Game Dynamics, held January 4-5, 2011 in New Orleans, Louisiana. Evolutionary game theory studies basic types of social interactions in populations of players. It combines the strategic viewpoint of classical game theory (independent rational players trying to outguess each other) with population dynamics (successful strategies increase their frequencies). A substantial part of the appeal of evolutionary game theory comes from its highly diverse applications such as social dilemmas, the evolution of language, or mating behaviour in animals. Moreover, its methods are becoming increasingly popular in computer science, engineering, and control theory. They help to design and control multi-agent systems, often with a large number of agents (for instance, when routing drivers over highway networks or data packets over the Internet). While these fields have traditionally used a top down approach by directly controlling the behaviour of each agent in the system, attention has recently turned to an indirect approach allowing the agents to function independently while providing incentives that lead them to behave in the desired way. Instead of the traditional assumption of equilibrium behaviour, researchers opt increasingly for the evolutionary paradigm and consider the dynamics of behaviour in populations of agents employing simple, myopic decision rules.




Handbook of Dynamic Game Theory


Book Description

Résumé : "This will be a two-part handbook on Dynamic Game Theory and part of the Springer Reference program. Part I will be on the fundamentals and theory of dynamic games. It will serve as a quick reference and a source of detailed exposure to topics in dynamic games for a broad community of researchers, educators, practitioners, and students. Each topic will be covered in 2-3 chapters with one introducing basic theory and the other one or two covering recent advances and/or special topics. Part II will be on applications in fields such as economics, management science, engineering, biology, and the social sciences."




Principles of Model Checking


Book Description

A comprehensive introduction to the foundations of model checking, a fully automated technique for finding flaws in hardware and software; with extensive examples and both practical and theoretical exercises. Our growing dependence on increasingly complex computer and software systems necessitates the development of formalisms, techniques, and tools for assessing functional properties of these systems. One such technique that has emerged in the last twenty years is model checking, which systematically (and automatically) checks whether a model of a given system satisfies a desired property such as deadlock freedom, invariants, and request-response properties. This automated technique for verification and debugging has developed into a mature and widely used approach with many applications. Principles of Model Checking offers a comprehensive introduction to model checking that is not only a text suitable for classroom use but also a valuable reference for researchers and practitioners in the field. The book begins with the basic principles for modeling concurrent and communicating systems, introduces different classes of properties (including safety and liveness), presents the notion of fairness, and provides automata-based algorithms for these properties. It introduces the temporal logics LTL and CTL, compares them, and covers algorithms for verifying these logics, discussing real-time systems as well as systems subject to random phenomena. Separate chapters treat such efficiency-improving techniques as abstraction and symbolic manipulation. The book includes an extensive set of examples (most of which run through several chapters) and a complete set of basic results accompanied by detailed proofs. Each chapter concludes with a summary, bibliographic notes, and an extensive list of exercises of both practical and theoretical nature.