Game Theory: Classification, Applications, & Theories

Jasmine Grover logo

Jasmine Grover

Education Journalist | Study Abroad Lead

Game theory is a branch of applied mathematics that provides a tool for assessing situations in which parties, or players, make decisions that are interdependent. This interdependence causes each player to consider the other player’s possible decisions or strategies in drawing strategy. Game theory elucidates how strategically a game is played. It thus determines the way or order in which the players make moves. A solution to a game expresses the optimal decisions of the players, who may have the same, opposite, or mixed interests, and the outcomes that may be oriented from these decisions. It considers the data for the players at each decision point. The game possesses two types of strategic interdependence- the first is sequential, and the second is simultaneous. In sequential interdependence, players act in a sequence, aware of other players' actions. In contrast, in simultaneous interdependence, players act at the same time not being aware of the actions of another player. Thus, game theory tells us about all such strategies.

Key Takeaways: Probability distribution, Games, mixed strategy, min max theorem, zero-sum two-person games, utility theory


What is Game Theory?

[Click Here for Sample Questions]

Game theory is described as the science of strategies that comes under the probability distribution. It defines logical as well as mathematical actions that the players take in order to gain the best possible outcomes for themselves in the games.

The games studied in game theory may vary from chess to tennis and from child-rearing to take-overs. But, among this one this is common that such an array of games is inter-dependant and that is, the outcome for each player depends upon the strategies of all.

In simple terms, the game theory deals in mathematical models of cooperation and conflicts between rational decision-makers. Hence, game theory is stated as the study of decision making in which the players must come up with strategies thus affecting the interests of fellow players.


Classification of Games

[Click Here for Sample Questions]

Games can be classified as per certain significant features, the most obvious of which is ‘the number of players.’ Hence, a game can be designated as:

  1. One person game
  2. Two-person constant sum game
  • Games of perfect information
  • Games of imperfect information

Games in each category have their own different features. Moreover, a player need not be an individual, it can be a nation, a corporation, or a team consisting of many people with shared interests.

    a.One Person Game

One-person games are also called games against nature. With no opponents, the player only needs to note available options and then choose the optimal outcome. When chance is accounted for, the game might seem to be more complex, but in principle, the decision is still simple.

Suppose, a person decides to carry an umbrella weighing the costs and benefits of carrying it or not. While this person could make a wrong choice, there does not exist an opponent.

That is, nature presumes to be completely uninterested in the players' decisions, and the person can build his decision on simple probabilities. One-person games hold little interest for game theorists.

    b.Two-Person Constant Sum Game

The easiest game of any real theoretical interest is a two-person constant-sum game of perfect information. Games such as chess, checkers, etc come under this.

  1. Games of perfect information

German mathematician Ernst Zermelo in 1912 proved that such games are strictly determined by making use of all available data, the players can conclude strategies that are optimal, which makes the outcome predestine.

In chess, exactly one of the three outcomes must occur if the players make exceptional choices,

  • White wins (holds a strategy that wins against any strategy of Black)
  • Black wins
  • White and Black draw.

In principle, a sufficiently strong supercomputer could determine which of the three outcomes will happen. But, considering that there are some different 40-move games of chess possible, there seems no possibility that such a computer will be developed now or in the near future. Hence, while chess is of only minor interest in game theory, it is likely to remain a game of enduring intellectual interest.

     2.Games of imperfect information:

A saddle point in a two-person constant game is the outcome that rational players would choose. The name is originated from it being the minimum of a row that is also the maximum of a column in the payoff matrix- in short- be in tune with the shape of a saddle.

Further, a saddle point always exists in games of perfect data but may or may not exist in games of imperfect information. By choosing a plan associated with this outcome, each player attains an amount at least the same as his payoff at that outcome, no matter what other opponent does.

This payoff is called the value of the game as an imperfect information game. It is predestined by the players’ choices of plans related to the saddle point, making such games strictly destined.

Also read: Probability


Zero-Sum Game Theory

[Click Here for Sample Questions]

There is a special type of game studied in game theory, called zero-sum games. They are constant-sum games. In such games, the available resources can neither be added nor diminished. Moreover, the total plus point in zero-sum games for all combinations of plans, always adds to zero.

In simple terms, we can say that in zero-sum games, one wins and one loses. The total of benefits of all the players for any outcome is equal to zero is said as a zero-sum game. Thus, opposing the interest of two players.

Multiple games, game theory are non-zero-sum games, as the net result of outcome is less than or greater than zero. Hence, when one player’s gain does not match to other’s loss, it is known as a non-zero-sum game.


Mixed Strategies And The Minimax Theorem

[Click Here for Sample Questions]

A collection of moves together with a corresponding set of weights which are succeeded probabilistically in the playing of the game. The minimax theorem of game theory expresses that every finite, zero-sum, two-person game has an optimal mixed strategy.

In 1928, the minimax theorem which was proved by von Neumann states that every finite, two-person constant-sum game has a blend in pure or mixed strategies. Particularly, it says that for every such game between player X and Y, there is a value ? and plans for X and Y such that, 

If X adopts its maximin strategy, the outcome will be at least as favourable to X as ?; if Y adopts its minimax plan, the outcome will no more be favourable X than ?. Hence, X and Y both have the incentive and the ability to enforce an outcome that gives an expected payoff ?.

Also read: Triangle Theorems


Utility Theory

[Click Here for Sample Questions]

Game theory does not attempt to describe what a goal of a player should be; instead, it shows how a player can best achieve his goal, no matter what that goal is.

Von Neumann and Morgenstern understood, to accommodate all players, no matter what goal they have, they built a theory known as utility theory. They began by noting certain axioms that they thought all rational decision-makers would obey. They then proved that it was possible to state a utility function for such decision-makers that would reflect their preferences.

In brief, a utility function allocates a number to each player’s alternatives to convey their relative attractiveness. Ascending (maximise) someone’s utility directly determines a player’s most preferred choice. In recent years, however, some questions have been raised about whether people actually behave in accordance with these axioms, or alternative axioms have been proposed.

Also read: Set theory


Applications Of Game Theory

[Click Here for Sample Questions]

The game theory is widely accepted to study human as well as animal behaviour. The applications for the same are as follows:

  • It is taken into account in economics to understand the economic behaviours, as behaviours of consumers, markets and firms.
  • Game theory is used in social science too.
  • It is applied in the study of sociology, political, and physiological behaviours.
  • It is applied in the study of biology as well.
  • Adding more to behavioural prediction, game theory is utilised in the development of theories of normative or ethical behaviour.

Things To Remember

[Click Here for Sample Questions]

  • A simultaneous game is one in which all players move effectively together, whereas the moves are non-simultaneous in a sequential game.
  • Sample strategies may include always cooperate, always defect, random, tit-for-tat.
  • Game theory is the science of strategy. It attempts to determine mathematically and logically the action that players should take to secure the best results for themselves in a wide array of games.
  • More typical are games with the potential for either mutual gain(positive) or mutual loss(negative), as well as some conflict.
  • The gist of the game is the interdependence of player strategies.
  • The players are drawn into a bad outcome by each following his nest private interest and this is known as Prisoner’s dilemma.

Sample Questions

Ques. List down the classification of games. (5 marks)

Ans: The games can be classified according to several criteria:

  • How many players are in the game? Usually, there should be more than one player. Most books on game theory do not treat one-player games but can allow them provided they contain elements of randomness.
  • Can play be simultaneous or sequential? In a simultaneous game, play a player has only one move, and all moves are done simultaneously. In a sequential game, no two players move at a time and players have more than one move. There are games that are neither simultaneous nor sequential.
  • Does the game have random moves? Games may or may not contain random events but there is a maximum chance for a game having random moves that influence its outcome. They are called random moves. For e.g., Chess.
  • Are players aware of perfect information? A sequential game has perfect information if every player, when about to move, knows all previous moves.
  • Do players have complete information? This means whether the players know about the complete structure of the game- the sequence in which the players move, all possible moves in each position and the payoff for all outcomes.
  • Is the game zero-sum? Zero-sum games possess the property that the sum of the payoffs to the players equals zero. A player can have a positive playoff only when the opponent has a negative playoff. For e.g., Poker and Chess.

Ques. In an auction, an item is auctioned. People increase the bids in increments of $20, and the player giving the highest bid gets the item for that amount of money. Define Auction and Give reasons: (5 marks)
(1)Why the auctioneer would be considered a player of the game or reason why he or she should not?
(2)Does the game contain random moves?
(3) Is it zero-sum?
(4)Would a real-world auction have complete information?

Ans: Auction is described as a sales event in which prospective buyers submit competing bids on assets or services in either open or closed format. Buyers, as well as sellers, attend auctions as they may receive a good bargain either by purchasing or selling the asset(s).

Reasons:

  1. The auctioneer is not a player in the game since he/she is merely a rule setter or a referee whose aim is to run the auction and not participate or control it.
  2. It does not. This game is ‘sequential’ since the participants did not give in their bids simultaneously as in sealed-bid auctions.
  3. This is not a zero-sum game. The reason for this is that in a zero-sum game one wins and the other loses.
  4. There is no chance that a real-world auction will contain all the information. The buyers are aware of how much they appreciate real-world auctions. Other bidders and sellers have no access to any kind of information related to personal valuation.

Ques. State applications of Game theory. (5 marks)

Ans: Game theory helps is understand situations in which decision-makers interact. A game is in which a players contend with each other according to a set of rules. It encompasses a wide range of applications some of which are as listed:

  1. Penalty kicks in a football game;
  2. Bidders competing in an auction;
  3. Animals fighting over prey;
  4. Political parties competing for votes;
  5. Arms race between the countries;
  6. Firms competing for business.

Ques. Explain in brief about Game theory. (4 marks)

Ans: Game theory is an approach to modelling behaviour in situations where the outcome of your decisions depends on the decisions of others.

  1. Game theory is the study of strategic, interactive decision making among rational individuals or organizations.
  2. In game a player need not to be an individual, it may be a nation, a team, a firm consisting of many people with shared interests.
  3. Game theory is applied for determining different strategies in the business world. If offers valuable tools for solving strategy problems.

Ques. Explain the categories of game theory. (5 marks)

Ans: Game Theory is broadly classified into three categories of study,

  1. Classical game theory:
  • It targets optimal play in situations where one or more people must make a decision and the impact of that decisions those involved is known.
  • Poker, Strategic military decision-making, Negotiations.
  1. Combinatorial game theory:
  • It focuses on a two-player game in which each player takes turns changing in pre-defined ways.
  • Chess, Checkers, Go.
  1. Dynamic game theory:
  • It aims for the analysis of the games in which players must make decisions over time and in which those decisions will affect the outcome at the next moment in time.
  • Optimal play in a dog fight, chasing while playing I ground.

Also read: Permutations and Combinations

Ques. List down the key elements in game theory. (5 marks)

Ans: There are five elements in game theory:

  1. Player: who is interacting.
  2. Strategies: what are the choices of each player? What move can one opt for?
  3. Payoffs: how do strategies translate into outcomes?
  4. Information: what do players know about the situation and one another?
  5. Rationality: how do players think?

Ques. Discuss types of strategies. (3 marks)

Ans: Usually, players use these strategies as given below:

1. Pure strategy:

  • A particular course of action that is selected by a player is called pure strategy.
  • Each player knows in advance of all strategies out of which he always selects only one particular strategy regardless of the others.

2. Mixed strategy: 

  • Course of action that is selected on a particular occasion with some fixed probabilities are called mixed strategies.
  •  Optimal strategy:
  • The specific strategy or complete plan by which a player optimizes his gains or losses without knowing the competitor’s strategies is known as optimal strategy.

Ques. List down 5 assumptions of the game. (5 marks)

Ans: Each player has available to him a finite number of possible strategies. The list may not be similar for each player.

  1.  Player X attempts to maximize gains while B minimizes losses.
  2. The decisions made by the players are individual prior to the play with no communication between them.
  3. The decisions are made and announced simultaneously so that neither player has an advantage over the other player’s decision.
  4. Both the player knows not only possible payoffs to themselves but also others.

Read More:

Comments


No Comments To Show