In some experiments rational players who understand the structure of the game could improve their payoff. We bound the size of the observed losses in several such experiments. To do this, we suppose that observed play resembles an equilibrium because players learn about their opponents’ play. Consequently, in an extensive form game, some actions that are not optimal given the true distribution of opponents’ play could be optimal given available information. We find that average losses are small: $0.03 to $0.64 per player with stakes between $2 and $30. In one of the three experiments we examine this also implies a narrow range of outcome.

Game Theory: A formal way to analyze interaction among a group of rational agents who behave strategically.

Strategic interactions in which we can use game theory: Voting, auctions, bankruptcy, R&D races, cartel behavior, and more. In these ‘game’ situations we need to ask:

* Who are the players?
* What are the alternative strategies available to the players?
* When does each player take her turn?
* How much do the players stand to gain?

The noncooperative theory of games provides a very general description of environments in which rational agents interact. Unlike the theory of perfect competition,in which no agent has a tangible
effect on the reward of another agent, or the theory of monopoly, in which only one agent has market power, noncooperative game theory allows one to describe interactions in which several agents’ choices jointly determine the agents’ rewards. This course will examine noncooperative games in normal and extensive form, and the equilibrium concepts that have been proposed for such games, as well as some applications.

In this course on game theory, we will be studying a range of mathematical models of conflict and cooperation between two or more agents. Here, we outline the content of this course, often giving examples.
We will first look at combinatorial games, in which two players take turns making moves until a winning position for one of the players is reached. The solution concept for this type of game is a winning strategy – a collection of moves for one of the players, one for each possible situation,
that guarantees his victory.

Chess and Go are examples of popular combinatorial games that are famously difficult to analyze. We will restrict our attention to simpler examples, such as the game of Hex, which was invented by Danish mathematician, Piet Hein, and independently by the famous game theorist John Nash, while he was a graduate student at Princeton. Hex is played on a rhombus shaped board tiled with small hexagons. Two players, R and G, alternate coloring in hexagons in their assigned color, red or green. The goal for R is to produce a red chain crossing between his two sides of the board. The goal for G is to produce a green chain connecting the other two sides.

This course is a tour of current interfaces between logic and game theory.

This book is a state-of-the-art look at combinatorial games, that is, games not involving chance or hidden information. It contains articles by some of the foremost researchers and pioneers of combinatorial game theory, such as Elwyn Berlekamp and John Conway, by other researchers in mathematics and computer science, and by top game players. The articles run the gamut from new theoretical approaches (infinite games, generalizations of game values, two-player cellular automata, alpha-beta pruning under partial orders) to the very latest in some of the hottest games (Amazons, Chomp, Dot-and-Boxes, Go, Chess, Hex). Many of these advances reflect the interplay of the computer science and the mathematics. The book ends with an updated bibliography by A. Fraenkel and an updated version of the famous annotated list of combinatorial game theory problems by R. K. Guy, now in collaboration with R. J. Nowakowski.

Non-cooperative game theory is an abstract framework for analyzing strategic situations that involve multi-person interdependent decision making. Conflict, cooperation, coordination, bargaining, auctions, and (tacit) communication are all topics that can be usefully analyzed within this framework.

This graduate course will teach the fundamentals of game theory. It will be a rigorous introduction that does not shy away from technical detail but that emphasizes modeling issues and solution concepts. Game theory emerged as a branch of applied mathematics and is still quite mathematical. Although we shall rarely use more than algebra, the course will be analytically demanding. The hard part of game theory is not the math but the logic, and mastering this takes time and effort. There are no formal prerequisites for this course, but mathematical thinking will be indispensable.

The formal theory of bargaining originated with John Nash’s work in the early 1950s. In this book we discuss two recent developments in this theory.

The first uses the tool of extensive games to construct theories of bargain- ing in which time is modeled explicitly.
The second applies the theory of bargaining to the study of decentralized markets. We do not attempt to survey the field.

Rather, we select a small number of models, each of which illustrates a key point. We take the approach that a thorough analysis of a few models is more rewarding than short discussions of many models. Some of our selections are arbitrary and could be replaced by other models that illustrate similar points.

Over the last few years, there has been explosive growth in the research done at the interface of computer science, game theory, and economic theory, largely motivated by the emergence of the Internet. Algorithmic Game Theory develops the central ideas and results of this new and exciting area.