Game Theory

Question 1

a body of knowledge that deals with making decisions when two or more intelligent and rational opponents are involved under conditions of conflict or competition.

Answer 1

Game Theory

Question 2

the game theory started by

Answer 2

John Von Neumann & Mongenstern

Question 3

a competitive situation where there are structured rules and regulations and end in a victory of one

Answer 3

Game

Question 4

The GAME referred to in this chapter is the

Answer 4

Competition between two business organizations

Question 5

Finite number of competitors are called

Answer 5

Players

Question 6

It is played when each player chooses one of his courses or actions.

Answer 6

Play

Question 7

two players (persons) namely A and B play the game.

Answer 7

Two-finger morra

Question 8

Based on the name itself, it is a game with 2 numbers of players.

Answer 8

Two-person game

Question 9

also known as ‘single strategy’ is one of the most preferred position for each player to achieve and it is the best strategy for each player to play one strategy throughout the game.

Answer 9

Pure Strategy Game

Question 10

is when a player decides in advance to choose one of his courses of action
in accordance with some fixed probability distribution. This strategy associates probability to each course of action or also called ‘pure strategy’.

Answer 10

Mixed Strategy Game

Question 11

Find the _____. If the game has a _____, the game is solved. Indicate the optimal strategies and the values of the game.

Answer 11

Step 1: Saddle Point

Question 12

Find the _____. If the game has a _____, the game is solved. Indicate the optimal strategies and the values of the game.

Answer 12

Step 1: Saddle Point

Question 13

If no _____, try to _____ the size of the matrix given (m x n) to:

1) 2 x 2 matrix, which has a formula for optimal strategies and the value of the game. Use the formula to get the answer.
2) 3 x2 or 2 x 3 matrix and use the sub game method to get the answer. (The sub games are once again 2 x 2 games).
3) To m x 2 or 2 x n matrix and use a graphical method to get a solution. Graphical solution will give us a way to 2 x 2 matrix.

Answer 13

Step 2: No Saddle Point, Reduce the size of the Given Matrix

Question 14

If no _____, try to _____ the size of the matrix given (m x n) to:

1) 2 x 2 matrix, which has a formula for optimal strategies and the value of the game. Use the formula to get the answer.
2) 3 x2 or 2 x 3 matrix and use the sub game method to get the answer. (The sub games are once again 2 x 2 games).
3) To m x 2 or 2 x n matrix and use a graphical method to get a solution. Graphical solution will give us a way to 2 x 2 matrix.

Answer 14

Step 2: No Saddle Point, Reduce the size of the Given Matrix

Question 15

Step 3. Use an _____ _____to get the solution.
Step 4. Use _____-_____ approach to get the solution. Use the simplex method to get solution. (Duality principle in _____-_____ is used).
Step 5. Use the _____ or _____ method to get the solution.

Answer 15

Step 3: Algebraic Method
Step 4: Linear Programming
Step 5: Iteration or Approximate

Question 16

Is called a game with saddle point. This entails that the players of the game always use pure strategy. The element at the intersection of their
pure strategy is known as _____ _____ Another name given to the _____ _____ is _____ _____ of the game and the corresponding strategies form the equilibrium pair of strategies.

Answer 16

Maximin (a^ij)=minimax (a^aj)
Saddle Point, Saddle Point
Equilibrium Point

Question 17

Steps in finding the saddle point

Answer 17

1. Select the minimums of each row and encircle them.
2. Select the maximums of each column and square them.
3. A point where both circle and square appear in the matrix at the same point is the saddle point.

Question 18

The general rules of dominance

Answer 18

1. If all the elements of a column (say 1st column) are greater than or equal to the corresponding elements of any other column (say 2nd column), then 1st column is dominated by 2nd column.
2. If all the elements of 1st row are less than or equal to the corresponding elements of any other
   row, say 2nd row, then 1st row is dominated by 2nd row.
3. A pure strategy of a player may also be dominated if it is inferior to some convex combinations of
   two or more pure strategies, as a particular case, inferior to the averages of two or more pure strategies.

Question 19

SOLUTIONS TO 2 X 2 GAMES
WITHOUT SADDLE POINT
(MIXED STRATEGIES)

Answer 19

In such cases, the best strategies are the mixed strategies. So in dealing with mixed strategies, we have to determine the probobilities with which each action should be selected.

• If one of the player adheres to his optimal mixed strategy and the other player deviates from his optimal strategy, then the deviating player can only decrease his yield and cannot increase in any case (at most may be equal).
• If one of the players adheres to is optimal strategy, then the value of the game does not alter if the opponent uses his supporting strategies only either singly or in any combination.
• If we add (or subtract) a fixed number say 1, to (from) each elements of the payoff matrix, then the optimal strategies
  remain unchanged while the value of the game increases (or decreases) by 1.

Question 20

When the given pay off matrix of a game cannot be reduced to 2 × 2, or 2 × 3 or m × 2 or 2 × n, then, we can solve the game by using the _____ _____. This is a straightforward and lengthy and time-consuming method. Here we have to write a system of inequalities and consider them as equations and solve the simultaneous equations as usual

Answer 20

Algebraic Method

Question 21

One of the methods of determining the approximate solution is the method of _____. The principle of the approximate method is:

• The two players are supposed to play the game iteratively and at each play the players choose a strategy which is best to himself or say worst to the opponent, in view of what the opponent has done up to the iteration.

Answer 21

Iterative Method (For Approximate Solution)

Question 22

If there is no saddle point, find the payoff (P) of A using his first strategy with a probability (x) and his second probability (1-x), when B plays his multiple strategies.
- Make a graph
- Substitute the x = 0 and x = 1
to the payoffs
- Find the optimal strategy

Answer 22

Graphical Method

Question 23

It is a type of business game. Where a company uses a similar strategy to motovate the potential market to prefer the product of their company to fulfill their objective or win over the opponent.

Answer 23

Competitive Strategies

Question 24

It started in 20th century but ____ ___ _______ and ________ have mathematically dealt with the theory and published the paper “_____ __ _____ and ________ ______” in 1944. The approach that they used is the ________ ________ which involves the fundamental idea of minimization of the maximum losses.

Answer 24

John Von Neumann & Morgenstern
Theory of Games & Economic Behaviour
Minimax Principle

Question 25

Every play or combination of course of action is associated with an outcome which is called

Answer 25

Payoff

Question 26

It is the maximum guaranteed gain to the player. It is denoted by “v”.

Answer 26

Value of the Game

Question 27

It is the smallest element in the row and greatest element in the column.

Answer 27

Saddle Point