## Are you sure?

This action might not be possible to undo. Are you sure you want to continue?

**When is this used
**

• When either player A or player B has only 2 strategies and the other player has more than 2 strategies • No saddle point is found • 2 X n game means: player A has only 2 strategies and Player B has n strategies • m X 2 game means: player A has m strategies and Player B has only 2 strategies

**Algorithm for 2 X n game
**

• Step 1 : Reduce the payoff matrix by applying dominance property, if it exists • Step 2: Let, x be the probability for Player A taking alternative 1, then (1x) becomes the probability for alternative 2. Derive the expected gain function of player A • Step 3 :For each gain function find values when x = 0 & x=1 • Step 4 : plot gain. Keep x value on X axis and gain on Y axis • Step 5: Since player A is a maximin player, find the highest intersection point in the lower boundary of the

• Step 6 : If the no. of lines passing through the maximum point is only two, from a 2 x 2 payoff matrix from the original problem by retaining only the columns corresponding to those two lines and go to step 8, otherwise go to step 7 • Step 7: If more than two lines are passing through the maximum point, identify any two lines with opposite slopes passing through that point. Then form 2x2 payoff matrix from the original problem by retaining only the columns corresponding to those two lines which are having opposite slopes • Step 8 :Solve the 2x2 game with

Algorithm for 2 X n game (contd..)

**Solve the below 2 x 5 game graphically
**

Player B

Player A

1 2

3 -1

5

1

2

3

4

0 5

6 -2

-1 2

7 1

Solving

1 1 2 Player B 2 4 5 3 Row minimum -1 (Maximin) -2 6 Player A

3 -1

3 7

0 5

6 -2

-1 2

5

7 1

Column maximum 2

(Minimax) Maximin = Minimax. No saddle point

**Checking for dominancy in column (as only 2 rows are present) Player B
**

1 4 2 5 3 Player A 1 2 Column dominancy: Column 4 cell values are < column 2 values. So column 4 is dominant. Delete column 2 Column dominancy: Column 43 cell values are < column 5 values. So column 3 is dominant. Delete column 5 After deleting column 2 & 5 1 Player B 3

3 -1

0 5

6 -2

-1 2

7 1

Player A

1 2

3 -1

4

6 -2

-1 2

**Now derive the gain function Player B
**

4 Player A 1 2 1 3

3 -1

6 -2

-1 2

B’s alternative 1 3 4

A’s expected payoff function 3x + (-1 * (1-x) ) = 3x-1+x = 4x-1 6x + (-2 * (1-x) ) = 6x -2 +2x = 8x-2 (-1 * x ) + (2* (1-x) ) = -1x +2 – 2x = -3x +2

**Now compute gain for x = 0 & x=1
**

B’s A’s alternativ expected e payoff function 1 4x-1 3 8x-2 4 -3x +2 A’s expected gain X=0 -1 -2 2 X=1 3 6 -1

Now plot the graph

Player A maximin player, shade the lowest boundary of the graph. Intersection points are a,b,c & d. Highest point is c. Optimal solution exists at c. Check the no. of lines passing thru c. 2 lines. So consider the corresponding columns (B1 & B4) to make 2X2 matrix

**Now we have got 2X2 matrix and can solve through oddments
**

Player B 1 4 Player A Oddments 1 2 4

3 -1

-1 2

3

Oddments 3 4

Calculating probability P1= 3/7, P2 = 4/7, q1 = 3/7 & q2 = 4/7 Calculating value V = (3*3) + (-1*4) / (3+4) = (9-4) / 7 = 5 /7

- OPERATION RESEARCH 2 mark questions with answers.doc.docx
- Organisational Capability Profile
- CLIFFORD PERAK 2013 M1(Q&A)
- Graphical Method in Game Theory
- Dominance in Game Theory
- MALACCA 2013 M1(Q&A)
- Seafield 2013 M1(Q&A)
- TUNKU AMPUAN DURAH 2013 M1(A)
- Game THeory
- 2012 13 Operations Research Nba Course File
- 依大 UPSI 1617 科系积分
- Assignment on Operations Research
- 玻大 UniMAP 1617科系积分
- Linear Programming - The Graphical Method
- Operations Research
- Materials Management Systems- MRP II & JIT
- Taguchi's Loss Function
- Gender and the Media
- Article 1234
- business research measurement scales
- 8 Stages Process of New Product Development
- SAP Basis Consultant (Fresher)
- Fsn Analysis
- 4 ER to Tables
- Packaging Operations Flow Chart
- Brm Report Writing
- Random Walk Theory Final Ppt
- Recruitment Process of ICICI Bank
- Mughal Emperor
- Manual

- Personalized Gesture Recognition with Hidden Markove Model and Dynamic Time Warping
- A Review on Image Inpainting with K-Nearest Neighbor (KNN) Method
- Optimization of Water Distribution Network for Dharampeth Area
- tmpC8D2.tmp
- 68537_1985-1989
- tmp2A0A.tmp
- A System for Efficient Retrieval of the Images from Large Datasets using Ripplet Transform and Edge Histogram Detector
- Implementation of Feed Forward Neural Network for Image Compression on FPGA
- tmpDE32.tmp
- Analyzing Sentiment at Sentence-Level on Tweets using Hybrid Systems
- Review on Advanced Prediction of Difficult Keyword Queries Over Databases
- An Algorithm to Improve Accuracy of Recommendation System
- Weighted Density based Error Optimization for Classical Dataset
- tmpDBB7.tmp
- Image Processing Techniques For Quality Checking In Food Industry
- Digital Image Watermarking Based on LSB for RGB Image
- 63607_2010-2014

Sign up to vote on this title

UsefulNot usefulClose Dialog## Are you sure?

This action might not be possible to undo. Are you sure you want to continue?

Close Dialog## This title now requires a credit

Use one of your book credits to continue reading from where you left off, or restart the preview.

Loading