2.
<ul><li>Game theory is a type of decision theory in which one’s choice of action is determined after taking into account all possible alternatives available to an opponent player the same game. </li></ul><ul><li>This type of problems is fundamentally based upon the minimax / maximin criterion. This implies the assumption of rationality from which it is argued that each player will act so as to maximize his minimum gain or minimize his maximum loss. </li></ul><ul><li>Game refers to the general situation of conflict and competition in which two or more competitors are involved in decision- making activities in anticipation of certain outcomes over a period of time. </li></ul><ul><li>The set of rules defines the game. </li></ul>
3.
<ul><li>Characteristics </li></ul><ul><li>There can be a various types of game. They can be classified on the basis of the following characteristics. </li></ul><ul><li>Chance of strategy- if in a game, activities is determined by skill, it is said to be game of strategy. If they are determined by chance, it is a game of chance. </li></ul><ul><li>Number of players – a game is called an n number game if the number of persons playing is n. the person’s means an individual or a group aiming at a particular objective. </li></ul><ul><li>Number of activities – there may be finite or infinite. </li></ul><ul><li>Number of alternative available to each person in a particular activity may also be finite or infinite. </li></ul><ul><li>Information to the players about the past activities of other player is completely available, partly available or not available at all. </li></ul><ul><li>Payoff- a quantitative measure of satisfaction a person gets at the end of each play is called a payoff. It is a real valued function of variables in the game </li></ul>
4.
<ul><li>Basic definitions </li></ul><ul><li>Competitive game – a competitive situation is called a competitive game. It has following properties- </li></ul><ul><ul><li>The number of competitors called players is finite. </li></ul></ul><ul><ul><li>The players act intelligently and rationally </li></ul></ul><ul><ul><li>Each player has a list of finite number of choice or possible courses of action called strategy. </li></ul></ul><ul><ul><li>All relevant information i.e, the different strategies of each player and the amount of gain or loss of an individuals move are known to each player in advance. </li></ul></ul><ul><ul><li>The players select their respective courses of action/ strategy simultaneously. </li></ul></ul><ul><ul><li>The player make individual decisions without direct communication </li></ul></ul><ul><ul><li>The maximizing player attempts to maximize his gains and the minimizing player tries to minimize his losses. </li></ul></ul><ul><ul><li>The payoff is fixed and determined in advance </li></ul></ul>
5.
<ul><li>Two persons zero-sum game – a game of two player, in which the gains of one is equal to the losses of the other player is called a two player zero sum game. </li></ul><ul><li>Strategy – a rule for decision making in advance of all the plays by which he decides the activities he should adopt. It is a course of action taken by one of the participants in a game. It is a set of rules that specifies which of the available course of action he should make at each play. </li></ul><ul><ul><li>Pure strategy – if a player know what exactly the other player is gong to do, a deterministic situation is obtained and objective function is to maximize the gains, therefore, the pure strategy is a decision rule always to select a particular course of action. </li></ul></ul><ul><ul><li>Mixed strategy – if a player is guessing as to which activity is to be selected by other on any particular occasion, a probabilistic situation is obtained and objective function is to maximize the expected gain. </li></ul></ul>
6.
<ul><li>Pay off matrix- the payoff is the result or the outcome of the strategy. </li></ul><ul><li>Suppose the player A has m activities and the player B has n activities. Then a pay-off matrix can be formed by adopting the following rules : </li></ul><ul><ul><li>Row designations for each matrix are activities available to player A </li></ul></ul><ul><ul><li>Column designations for each matrix are activities available to player B </li></ul></ul><ul><ul><li>Cell entry ‘Vij’ is the payment to player A in A’s payoff matrix when A chooses the activity i & B chooses activity j. </li></ul></ul><ul><ul><li>With a zero-sum, 2 person game, the cell entry in the player B’s payoff matrix will be –ve of the corresponding cell entry Vij in the player A’s payoff matrix so that sum of payoff matrixes for player A and player B is ultimately Zero. </li></ul></ul>
7.
<ul><li>Maximin principle- the player decides to play the strategy which corresponds to the maximum of the minimum gains from his different course of action. </li></ul><ul><li>Minimax principles- the player selects that strategy which corresponds to the minimum of the maximum losses from his different course of action and this is known as the minimax principles. </li></ul><ul><li>Optimal strategy –a course of action / play which puts the player in the most preferred position, irrespective of the strategy of his competitors is called an optimal strategy. If the payoff matrix has the saddle point the player are said to have optimal strategies. </li></ul>
8.
<ul><li>Saddle point – a saddle point of a payoff matrix is the position of such an element in the payoff matrix which is minimum in its row and maximum in its column. </li></ul><ul><li>Value of game – the payoff at the saddle point is called the value of game and it is obviously equal to the maximin and minimax value of the game. The game is called fair if the value of the game is zero and unfair if it is non-zero. </li></ul>
A particular slide catching your eye?
Clipping is a handy way to collect important slides you want to go back to later.
Be the first to comment