This book for beginning graduate students presents a course on stochastic games and the mathematical methods used in their analysis.

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.

This new edition is unparalleled in breadth of coverage, thoroughness of technical explanations and number of worked examples.

This volume aims to present the basic results in the theory of two-person zero-sum repeated games including stochastic games and repeated games with incomplete information. It is intended for graduate students with no previous knowledge of the field.

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.

Game theory is a fascinating subject. We all know many entertaining games, such as chess, poker, tic-tac-toe, bridge, baseball, computer games — the list is quite varied and almost endless. In addition, there is a vast area of economic games, discussed in Myerson (1991) and Kreps (1990), and the related political games [Ordeshook (1986), Shubik (1982), and Taylor (1995)]. The competition between firms, the conflict between management and labor, the fight to get bills through congress, the power of the judiciary, war and peace negotiations between countries, and so on, all provide examples of games in action. There are also psychological games played on a personal level, where the weapons are words, and the payoffs are good or bad feelings [Berne (1964)]. There are biological games, the competition between species, where natural selection can be modeled as a game played between genes [Smith (1982)]. There is a connection between game theory and the mathematical areas of logic and computer science. One may view theoretical statistics as a two-person game in which nature takes the role of one of the players, as in Blackwell and Girshick (1954) and Ferguson (1968).Games are characterized by a number of players or decision makers who interact, possibly threaten each other and form coalitions, take actions under uncertain conditions, and finally receive some benefit or reward or possibly some punishment or monetary loss. In this text, we present various mathematical models of games and study the phenomena that arise. In some cases, we will be able to suggest what courses of action should be taken by the players. In others, we hope simply to be able to understand what is happening in order to make better predictions about the future.

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.