Game Theory For Data Science

Intelligent systems often depend on data provided by information agents, for example, sensor data or crowdsourced human computation. Providing accurate and relevant data requires costly effort that agents may not always be willing to provide. Thus, it becomes important not only to verify the correctness of data, but also to provide incentives so that agents that provide high-quality data are rewarded while those that do not are discouraged by low rewards. We cover different settings and the assumptions they admit, including sensing, human computation, peer grading, reviews, and predictions. We survey different incentive mechanisms, including proper scoring rules, prediction markets and peer prediction, Bayesian Truth Serum, Peer Truth Serum, Correlated Agreement, and the settings where each of them would be suitable. As an alternative, we also consider reputation mechanisms. We complement the game-theoretic analysis with practical examples of applications in prediction platforms, community sensing, and peer grading.

Game theory is the mathematical analysis of strategic interaction. In the fifty years since the appearance of von Neumann and Morgenstern's classic Theory of Games and Economic Behavior (Princeton, 1944), game theory has been widely applied to problems in economics. Until recently, however, its usefulness in political science has been underappreciated, in part because of the technical difficulty of the methods developed by economists. James Morrow's book is the first to provide a standard text adapting contemporary game theory to political analysis. It uses a minimum of mathematics to teach the essentials of game theory and contains problems and their solutions suitable for advanced undergraduate and graduate students in all branches of political science. Morrow begins with classical utility and game theory and ends with current research on repeated games and games of incomplete information. The book focuses on noncooperative game theory and its application to international relations, political economy, and American and comparative politics. Special attention is given to models of four topics: bargaining, legislative voting rules, voting in mass elections, and deterrence. An appendix reviews relevant mathematical techniques. Brief bibliographic essays at the end of each chapter suggest further readings, graded according to difficulty. This rigorous but accessible introduction to game theory will be of use not only to political scientists but also to psychologists, sociologists, and others in the social sciences.

Games provide mathematical models for interaction. Numerous tasks in computer science can be formulated in game-theoretic terms. This fresh and intuitive way of thinking through complex issues reveals underlying algorithmic questions and clarifies the relationships between different domains. This collection of lectures, by specialists in the field, provides an excellent introduction to various aspects of game theory relevant for applications in computer science that concern program design, synthesis, verification, testing and design of multi-agent or distributed systems. Originally devised for a Spring School organised by the GAMES Networking Programme in 2009, these lectures have since been revised and expanded, and range from tutorials concerning fundamental notions and methods to more advanced presentations of current research topics. This volume is a valuable guide to current research on game-based methods in computer science for undergraduate and graduate students. It will also interest researchers working in mathematical logic, computer science and game theory.

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.

Noncooperative Game Theory is aimed at students interested in using game theory as a design methodology for solving problems in engineering and computer science. João Hespanha shows that such design challenges can be analyzed through game theoretical perspectives that help to pinpoint each problem's essence: Who are the players? What are their goals? Will the solution to "the game" solve the original design problem? Using the fundamentals of game theory, Hespanha explores these issues and more. The use of game theory in technology design is a recent development arising from the intrinsic limitations of classical optimization-based designs. In optimization, one attempts to find values for parameters that minimize suitably defined criteria—such as monetary cost, energy consumption, or heat generated. However, in most engineering applications, there is always some uncertainty as to how the selected parameters will affect the final objective. Through a sequential and easy-to-understand discussion, Hespanha examines how to make sure that the selection leads to acceptable performance, even in the presence of uncertainty—the unforgiving variable that can wreck engineering designs. Hespanha looks at such standard topics as zero-sum, non-zero-sum, and dynamics games and includes a MATLAB guide to coding. Noncooperative Game Theory offers students a fresh way of approaching engineering and computer science applications. An introduction to game theory applications for students of engineering and computer science Materials presented sequentially and in an easy-to-understand fashion Topics explore zero-sum, non-zero-sum, and dynamics games MATLAB commands are included

This book on game theory introduces and develops the key concepts with a minimum of mathematics. Students are presented with empirical evidence, anecdotes and strategic situations to help them apply theory and gain a genuine insight into human behaviour. The book provides a diverse collection of examples and scenarios from history, literature, sports, crime, theology, war, biology, and everyday life. These examples come with rich context that adds real-world meat to the skeleton of theory. Each chapter begins with a specific strategic situation and is followed with a systematic treatment that gradually builds understanding of the concept.

When should you adopt an aggressive business strategy? How do we make decisions when we don't have all the information? What makes international environmental cooperation possible? Game theory is the study of how we make a decision when the outcome of our moves depends on the decisions of someone else. Economists Ivan and Tuvana Pastine explain why, in these situations, we sometimes cooperate, sometimes clash, and sometimes act in a way that seems completely random. Stylishly brought to life by award-winning cartoonist Tom Humberstone, Game Theory will help readers understand behaviour in everything from our social lives to business, global politics to evolutionary biology. It provides a thrilling new perspective on the world we live in.

Computer science and economics have engaged in a lively interaction over the past fifteen years, resulting in the new field of algorithmic game theory. Many problems that are central to modern computer science, ranging from resource allocation in large networks to online advertising, involve interactions between multiple self-interested parties. Economics and game theory offer a host of useful models and definitions to reason about such problems. The flow of ideas also travels in the other direction, and concepts from computer science are increasingly important in economics. This book grew out of the author's Stanford University course on algorithmic game theory, and aims to give students and other newcomers a quick and accessible introduction to many of the most important concepts in the field. The book also includes case studies on online advertising, wireless spectrum auctions, kidney exchange, and network management.

The outstanding feature of this book is that it provides a unified account of three types of decision problem. It covers the basic ideas of decision theory, classical game theory, and evolutionary game theory in one volume. No background knowledge of economics or biology is required as examples have been carefully selected for their accessibility. Detailed solutions to the numerous exercises are provided at the back of the book, making it ideal for self-study. This introduction to game theory is intended as a first course for undergraduate students of mathematics, but it will also interest advanced students or researchers in biology and economics.

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.