Game theory

Rough compiled materials

This course objective is to get a solid grasp on the model description, solution and

experimental application of basic games theory.

Short History and impact of Game Theory

“The earliest example of a formal game-theoretic analysis is the study of a duopoly by Antoine

Cournot in 1838. The mathematician Emile Borel suggested a formal theory of games in 1921,

which was furthered by the mathematician John von Neumann in 1928 in a “theory of parlor

games.” Game theory was established as a field in its own right after the 1944 publication of the

monumental volume Theory of Games and Economic Behavior by von Neumann and the

economist Oskar Morgenstern. This book provided much of the basic terminology and problem

setup that is still in use today.

In 1950, John Nash demonstrated that finite games always have an equilibrium point, at which

all players choose actions which are best for them given their opponents’ choices. This central

concept of noncooperative game theory has been a focal point of analysis since then. In the

1950s and 1960s, game theory was broadened theoretically and applied to problems of war and

politics. Since the 1970s, it has driven a revolution in economic theory. Additionally, it has found

applications in sociology and psychology, and established links with evolution and biology.

Game theory received special attention in 1994 with the awarding of the Nobel prize in

economics to Nash, John Harsanyi, and Reinhard Selten.

auctions. Prominent game theorists have been involved in the design of auctions for allocating

rights to the use of bands of the electromagnetic spectrum to the mobile telecommunications

industry. Most of these auctions were designed with the goal of allocating these resources more

efficiently than traditional governmental practices, and additionally raised billions of dollars in

the United States and Europe”.

Introduction

Game = strategic situation: A game is a formal description of a strategic situation.

Game theory: Economists call game theory. Psychologists call the theory of social situations;

Game theory is the formal study of decision-making where several players must make choices

that potentially affect the interests of the other players.

Before analyzing any situation, we need to describe it formally. That is, we must have the

specification of the model that describes the situation or game that we are interested in.

Definition:

 Game theory is a distinct and interdisciplinary approach to the study of human behavior.

The disciplines most involved in game theory are mathematics, economics and the other

social and behavioral sciences.

 How the individuals interact in strategic situations

 The x-rays of mind

 Game theory assumes rationality: This means that individuals are assumed to act in their

own self-interest. Another definition: the individuals have preferences to explain the
 world and the individuals act according to their preferences. Different individuals have

different preferences to explain the world.

 GAME theory is concerned with how rational individuals make decisions when they are

mutually interdependent.

 The analysis of interdependent decision making

Essential elements of a game

 Any situation that we wish to represent formally would have some basic elements that be

part of its description, following are the essential elements of a game;

1. Player: one who makes decision (individuals, firms, institutions etc). A player is

an agent who makes decisions in a game. The players are Rational, if

preferences are complete and transitive has a utility function. A player is said to

be rational if he seeks to play in a manner which maximizes his own payoff. It is

often assumed that the rationality of all players is common knowledge.

2. Strategy: the decision of the player, the action and response or move of the

player. Rational players choose action(s) that maximize their expected utilities. In

a game in strategic form, a strategy is one of the given possible actions of a

player. In an extensive game, a strategy is a complete plan of choices, one for

each decision point of the player.

3. Rules of the game: who moves when? What can they do?

4. Outcomes: what do the various combinations of actions produce?

number, also called utility, that reflects the desirability of an outcome to a player,

for whatever reason. When the outcome is random, payoffs are usually weighted

with their probabilities. The expected payoff incorporates the player’s attitude

towards risk.

6. Information: what do players know when they make decisions? A game has

perfect information when at any point in time only one player makes a move, and

knows all the actions that have been made until then.

7. Chance: probability distribution over chance events, if any

Common knowledge

A fact is common knowledge if all players know it, and know that they all know it, and so on.

The structure of the game is often assumed to be common knowledge among the players.

Static Game Theory

 . In static games the players make their moves in isolation without knowing what other

players have done.

 An example of a static game (one-off sealed bid auction)

In this type of auction each player submits only one bid, without knowing what any of the other

players has bid. The highest bid is then accepted as the purchase price. In contrast to static

games, dynamic games have a sequence to the order of play and players observe some, if not all,

of one another's moves as the game progresses.

of an object. The final and highest bid is accepted as the purchase price.

Cooperative Vs Non cooperative game: In a non-cooperative game, each player pursues his/her

own interests. In cooperative games, players are allowed to form coalitions and combine their

decision-making problems.

Normal form or strategic form of game: A game in strategic form, also called normal form, is

a compact representation of a game in which players simultaneously choose their strategies. The

resulting payoffs are presented in a table with a cell for each strategy combination.

o The Player

o The Strategies available to each player

o The payoffs
 Extensive game: An extensive game (or extensive form game) describes with a tree how

a game is played. It depicts the order in which players make moves, and the information

each player has at each decision point.

o Nodes

o Branches

o Vectors

o Information sets
EXERCISE 2.1

Depict the following situation as both a normal form game and an extensive form game:

Two rival firms are thinking of launching a similar product at the same time. If both firms

launch the product, then they will each make a profit of £40,000. If only one firm launches

its product, then it can act as a monopolist and will make a profit of £100,000. If either firm

decides not to launch the product that firm makes a loss of £50,000, due to costs already

incurred in developing the product.

A solution to a game is a prediction of what each player in that game will do. This may be a very

precise prediction, where the solution gives one optimal strategy for each player. When this

occurs the solution is said to be unique.

Dominance: Since all players are assumed to be rational, they make choices which result in the

outcome they prefer most, given what their opponents do. In the extreme case, a player may have

two strategies A and B so that, given any combination of strategies of the other players, the

outcome resulting from A is better than the outcome resulting from B. Then strategy A is said to

dominate strategy B. A rational player will never choose to play a dominated strategy. In some

games, examination of which strategies are dominated results in the conclusion that rational

players could only ever choose one of their strategies.

Dominating strategy: A strategy dominates another strategy of a player if it always gives a better

payoff to that player, regardless of what the other players are doing. It weakly dominates the

other strategy if it is always at least as good.

What strategies would a rational player never play?

o Strict dominance

o Weak dominance
Given a game in strategic form, if all players have strictly dominant strategies, then IESDS leads
to the unique dominant strategy equilibrium; so such a game is dominance solvable.
o Iterated strict dominance
o Iterated Weak dominance
  Equilibrium

. In non-cooperative games equilibrium occurs when none of the players, acting

individually, has an incentive to deviate from the predicted solution

Nash Equilibrium: Nash equilibrium, also called strategic equilibrium, is a list of strategies, one

for each player, which has the property that no player can unilaterally change his strategy and get

a better payoff.

Pure-strategy: A pure-strategy is where a player plays one specific optimal strategy. (Prisoner

dilemma)

Mix strategy: A mixed strategy is when a player randomizes over some or all of his or her

available pure strategies. This means that the player places a probability distribution over their

alternative strategies. (Battle of the sex’s game)

Situation:

Win-win situation

Win-lose situation

Lose-lose situation

The factors affecting the decision of the player

Cheating -Trust-cooperation,

Coordination,

Fairness,
Announcement

Decision theory: a game of a single player against nature. The focus is on preferences and the

formation of beliefs.

General equilibrium theory:

 large number of individual consumers and producers.

 Economic policies such as monetary or tax policy.

In recent years, political economy has emerged as a combination of general equilibrium theory

and game theory in which the private sector of the economy is modeled by general equilibrium

theory, while voting behavior and the incentive of governments is analyzed using game theory.

Mechanism design theory: game theory takes the rules of the game as given, while mechanism

design theory asks about the consequences of different types of rules.

Zero sum Game

A game is said to be zero-sum if for any outcome, the sum of the payoffs to all players is zero. In

a two-player zero-sum game, one player’s gain is the other player’s loss, so their interests are

diametrically opposed.

1: Odd or Even. Players I and II simultaneously call out one of the numbers one or two. Player

I’s name is Odd; he wins if the sum of the numbers is odd. Player II’s name is Even; she wins if

the sum of the numbers is even. The amount paid to the winner by the loser is always the sum of

the numbers in dollars. To put this game in strategic form we must specify X, Y (strategy sets)

and A (pay-off). Here we may choose X = {1, 2}, Y = {1, 2}, and A as given in the following

table.
example
3 cross 3 matrix and equalizing straitegy

Odd-or-Even in which both players simultaneously call out one of the numbers zero, one, or two.
The matrix is:
Backward induction

Backward induction is a technique to solve a game of perfect information. It first considers the
moves that are the last in the game, and determines the best move for the player in each case.
Then, taking these as given future actions, it proceeds backwards in time, again determining the
best move for the respective player, until the beginning of the game is reached.

Combinatorial games
Nash Equilibrium

Hawk and Dove game Vs Chicken game

Ultimatum game Vs Dictator game