Copyright (c) 2013 John L. Jerz

Strategy, 2nd Edition (Watson, 2008)

Home
A Proposed Heuristic for a Computer Chess Program (John L. Jerz)
Problem Solving and the Gathering of Diagnostic Information (John L. Jerz)
A Concept of Strategy (John L. Jerz)
Books/Articles I am Reading
Quotes from References of Interest
Satire/ Play
Viva La Vida
Quotes on Thinking
Quotes on Planning
Quotes on Strategy
Quotes Concerning Problem Solving
Computer Chess
Chess Analysis
Early Computers/ New Computers
Problem Solving/ Creativity
Game Theory
Favorite Links
About Me
Additional Notes
The Case for Using Probabilistic Knowledge in a Computer Chess Program (John L. Jerz)
Resilience in Man and Machine

An Introduction to Game Theory

tn_strategyW.jpg

Product Description
In this innovative textbook, Joel Watson adopts a refreshing new format for teaching game theory to advanced undergraduates. The book is rigorous and mathematically precise but also extremely careful in its focus on using the simplest possible models and least complicated mathematics necessary. Another innovation of the book is the way in incorporates elements of contemporary contract theory into the exposition, in a format that is highly engaging for students and easily adapted to the standard coverage familiar to teachers.

About the Author
Joel Watson is associate professor of economics at the University of California, San Diego. He received his B.A. from University of California, San Diego, and his Ph.D. from Stanford University. One of the top game theorists of his generation, Watson's work has been published in a variety of leading journals, including American Economic Review, Econometrica, Journal of Economic Theory, Quarterly Journal of Economics, and Games and Economic Behavior.

xv Game theory has become an enormously important field of study. It is now a vital methodology for researchers and teachers in many disciplines, including economics, political science, biology, and law. This book provides a thorough introduction to the subject and its applications, at the intermediate level of instruction.
 
p.24 The most important concept in the theory of games is the notion of a strategy. The formal definition is simple:
 
A strategy is a complete contingent plan for a player in the game.
 
... By complete contingent plan I mean a full specification of a player's behavior, which describes the actions that the player would take at each of his possible decision points... a player's strategy describes what he will do at each of his information sets.
 
p.39,40 It is important for players to think about each other's strategic choices. We use the term belief for a player's assessment about the strategies of the others in the game... Related to a belief is the notion of a mixed strategy. A mixed strategy for a player is the act of selecting a strategy according to a probability distribution... If a player uses a mixed strategy and/or assigns positive probability to multiple strategies of the other player, then this player does not expect a particular payoff for sure. We can extend the definition of a payoff function to mixed strategies and beliefs by using the concept of expected value.
 
p.58 I am trying to convince you that the most substantive component of behavior is the formation of beliefs. Indeed, herein lies the real art of game theory. Success in games often hinges on whether you understand your opponent better than he understands you. We often speak of someone "outfoxing" others, after all. In fact, beliefs are subject to scientific study as well. The bulk of our work in the remainder of this text deals with determining what beliefs are rational in games... we can continue our study of strategic behavior by placing the beliefs of players at the center of attention.
 
p.69 The procedure just illustrated is called iterative removal of strictly dominated strategies (or iterated dominance, for short). We can apply the procedure to any normal-form game as follows. First, delete all of the dominated strategies for each player, because no rational player would adopt one of them. When these strategies have been deleted, a new "smaller" game is formed. Then, delete strategies that are dominated in this smaller game, forming an even smaller game on which the deletion process is repeated. Continue this process until no strategies can be deleted.
 
p.72 In other words, strategic uncertainty sometimes hinders attainment of an efficient outcome... Strategic uncertainty is a part of life, but there are devices in the world that help us coordinate our behavior and avoid inefficiency.
 
p.168 Players ought to demonstrate rationality whenever they are called on to make decisions. This is called sequential rationality.
 
Sequential rationality: An optimal strategy for a player should maximize his or her expected payoff, conditional on every information set at which this player has the move. That is, player i's strategy should specify an optimal action from each of player i's information sets, even those that player i does not believe (ex ante [JLJ - ex ante: before the event]) will be reached in the game.
 
If sequential rationality is common knowledge between the players (at every information set), then each player will "look ahead" to consider what players will do in the future in response to her move at a particular information set.

Enter supporting content here