Scribd
Upload
483 views

Assignment Problem

The document discusses different types of assignment problems and the Hungarian method to solve them. It also discusses game theory concepts like zero-sum games, strategies (pure vs mixed), and methods to solve games including saddle points, minimax-maximin principle, odds method and graphical method. Dominance rules are explained to reduce the size of the game matrix by deleting dominated rows or columns.

Uploaded by

Akshay Gupta
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
483 views

Assignment Problem

The document discusses different types of assignment problems and the Hungarian method to solve them. It also discusses game theory concepts like zero-sum games, strategies (pure vs mixed), and methods to solve games including saddle points, minimax-maximin principle, odds method and graphical method. Dominance rules are explained to reduce the size of the game matrix by deleting dominated rows or columns.

Uploaded by

Akshay Gupta
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 13

Assignment Problem

Types of Assignment problem: -


1. Balanced Assignment Problem.
2. Unbalanced Assignment Problem.
3. Restriction in Assignment Problem.
Hungarian Method: -
Step 1. Row and column should be equal, if not
insert a dummy row or a column.
Step 2. Row Reduction:- Maintain at least one zero in
each row with the help of min element.
Step 3. Column Reduction :- Maintain at least one
zero in each column with the help of min element.
• Step 4: Draw minimum no of lines to maximum no. of
zero’s of the matrix.
Procedure: -
a) (i) Row Scanning: - Start from the first row, ask the
following question. Is there is exactly one zero in that row
? If yes, Mark a square around that zero entry and draw a
vertical line passing through that zero; otherwise skip that
row.
(ii) After scanning the last row, check whether all the zeros are
covered with the lines. otherwise do column scanning.

(b) Column Scanning: - Start from the first column, ask the
following question, Is there exactly one zero in the column ? If
yes, If yes, Mark a square around that zero entry and draw a
horizontal line passing through that zero; otherwise skip that
column.
(ii) After scanning the last column, check whether all the zeros
are covered with the lines.
• Step5. Check whether the no. of square or lines is
equal to the order o f the matrix. If yes then this
is an optimal solution.
• If not then follow these steps: -
A) Identify the min value from uncovered cells.
B) Subtract the min value from all uncovered cells.
C) Add the min value at the intersection of the lines.
Now again we get new assignment. Go to step 4
and check whether the no. of square or min lines is
equal to the order o f the matrix. If yes then this is
an optimal solution.
Step 6: Calculate the Assignment, compare the
marked square with the initial assignment matrix
and add all the values.
Maximization in Assignment
• There are certain types of Assignment
problems where the objective function is to
be maximized instead of being minimized.
These problems can be solved by converting
the maximization problem into a minimization
problem
• Converting the profit matrix to an equivalent
loss matrix by subtracting all the profit values
from the highest value.
Game Theory
• Theory of game is a type of decision theory in which one
choice of action is determined after taking into account all
possible alternatives available to an opponent playing the
same game.
• Objective of Theory of Games: - Its objective is to work out
recommendations for the reasonable behaviour of the
conflict sides. The task of theory of games is to find optimal
strategies for the players.
• There are two types of strategies: -
• Pure Strategy: -If the player select the game strategy each
time, then it is referred to as pure strategy. In this strategy
each player knows exactly what the other player is going to
do.
• Mixed Strategy: - When the players use a combination of
strategies and each player always kept guessing as to which
course of action is to be selected by the other player at a
particular occasion with some fixed probability, then this
referred to as mixed strategy.
• Two Person Zero Sum game: - Zero Sum games with
two players are called two-person zero sum game. In
this case the loss (gain) of one player is exactly equal to
the gain (loss) of the other.
• There are different types of Method: -
Saddle Point: -Select min element in row and enclose It in
a rectangle. Select max element in column and enclose it
in a circle. Then the intersection element is known as
Saddle point. And the same is Value of game.

Minimax-Maximin Principle:-
Minimax: -Select minimum value in each row, among all
minimum value select max value.
Maximin: - Select maximum value in each column, among
all maximum value select minimum value.
Hence the common value in minimax and maximin is
known as Value of the game.
• Odds Method:- Provides an easy method for finding
optimal strategies for each player in a payoff matrix
of size 2*2, without saddle point.
• Step of this method are as follows: -
• Step 1: - Find the difference between the two values
in the first row and put it against the second row of
the matrix, neglecting the –ve sign (if any)
• Step 2: - Find the difference between the two
values in the second row and put it against the
first row of the matrix, neglecting the –ve sign
(if any).
• Step 3: - Repeat step 1 and 2 for two column
also.
The value obtained by swapping the difference
represent the optimal relative frequency of play
for both players strategies. These may be
converted to probabilities by dividing each of
them by their sum.
Graphical Method: - The graphical method is
useful for the game where the payoff matrix is
of the size 2*n or m*2. The game with mixed
strategies that has only two dominated pure
strategies for one of the player in two-person
Zero-sum game.

Step 1: - As this 2*3 matrix does not have saddle


point. Therefore graphic method is to be used
reduce it to 2*2 game.
• Step 2: - Graph for player A. Draw two parallel lines
apart from each other and mark a scale on each.
These two represent the two strategies of player A.
The graph is:
In case of Row Deletion in Graph: - Select lower region and highest point.
In case of Column Deletion in Graph :- Select upper region and lower point.
Dominance Rule
ROW:- If all the elements row, say kth row are less then equal
to the corresponding elements of any other row say rth row,
then kth row is dominated by the rth row. So dominated
should be deleted.
COLUMN:- If all the elements column say kth column are
greater than equal to the corresponding elements of any
other column say rth column, then kth column is dominated
by the rth column. So dominated should be deleted.
• If the Ist and IInd rules are failing or not exist then we apply
the average of two column or two rows.
• (A) If average value of 2 rows is more than the 3rd one
then 3rd row should be deleted.
• (B) If in column wise the average of 2 columns is less than
the 3rdcolumn then 3rd column should be deleted.

You might also like