Zero-Sum Game - GeeksforGeeks (2024)

    • DSA
    • Practice Mathematical Algorithm
    • Mathematical Algorithms
    • Pythagorean Triplet
    • Fibonacci Number
    • Euclidean Algorithm
    • LCM of Array
    • GCD of Array
    • Binomial Coefficient
    • Catalan Numbers
    • Sieve of Eratosthenes
    • Euler Totient Function
    • Modular Exponentiation
    • Modular Multiplicative Inverse
    • Stein's Algorithm
    • Juggler Sequence
    • Chinese Remainder Theorem
    • Quiz on Fibonacci Numbers

    Open In App


    Like Article




    Zero-Sum Game:
    A zero-sum game is one in which no wealth is created or destroyed. So, in a two-player zero-sum game, whatever one player wins, the other loses. In this game, we can include at least two and a maximum to an infinite number of contestants. It assumes a version of perfect competition and perfect information.

    Let us consider a game in which n contestant takes part, and contestant i has Ni courses of action available to him. Then the number of outcomes to a play of the game will be N1, N2,……………, Nn. So, consider a possible outcome θ result in payment p(i, θ) to a contestant i. Then, the game is called a Zero-Sum Game, if every possible result θ, we have
    Zero-Sum Game - GeeksforGeeks (1)

    Lets us understand this by taking an example, three-man A, B, and C playing poker and put 100 bucks all, the winner takes all money. If A wins the game he gains 200 bucks but B and C lose 100 bucks each. So, the total payment to all contestants after the play is zero. Similarly, if B or C wins too.

    In financial markets, futures and options are considered non-zero games because contracts represent agreements between two parties and, if one investor loses, the asset is transferred to another investor. Poker, Gambling, Matching Pennies, Chess, Tennis are also some examples of Zero-Sum Game.




    Next Article

    Water Game

    Please Login to comment...

    Similar Reads

    Game Theory (Normal form game) | Set 2 (Game with Pure Strategy) Game Theory (Normal – form game) | Set 1 (Introduction) Please go through the above article before proceeding. Given a payoff matrix. The task is to find the optimum strategies of the players. Solution: Player A is having 3 strategies - 1, 2 and 3, and player B is also having 3 strategies - 1, 2 and 3. Step 1: Find row minimum values for each row a 2 min read Game Theory (Normal-form game) | Set 3 (Game with Mixed Strategy) Consider the following payoff matrix with respect to player A and solve it optimally. Solution: If a game has no saddle point then the game is said to have mixed strategy. Step 1: Find out the row minimum and column maximum. Step 2: Find out the minimax and maximin values. Since minimax and maximin value of this game are not equal, this game has no 4 min read Game Theory (Normal-form Game) | Set 7 (Graphical Method [M X 2] Game) The payoff matrix of an M * 2 game consists of M rows and two columns. This article will discuss how to solve an M * 2 game by graphical method. Also, this article will discuss if more than two lines intersect the same point in the graph then how can a 2 * 2 payoff matrix be formed. Consider the below problem: Solution: First check whether the prob 3 min read Game Theory (Normal-form Game) | Set 6 (Graphical Method [2 X N] Game) The payoff matrix of a 2 * N game consists of 2 rows and N columns . This article will discuss how to solve a 2 * N game by graphical method. Consider the below 2 * 5 game: Solution: First check the saddle point of the game. This game has no saddle point. Step 1: Reduce the size of the payoff matrix by applying dominance property, if it exists. Thi 3 min read Remove all zero-rows and all zero-columns from a Matrix Given a matrix arr[][] of size N * M, the task is to print the matrix after removing all rows and columns from the matrix which consists of 0s only. Examples: Input: arr[][] ={ { 1, 1, 0, 1 }, { 0, 0, 0, 0 }, { 1, 1, 0, 1}, { 0, 1, 0, 1 } } Output: 111 111 011 Explanation: Initially, the matrix is as follows: arr[][] = { { 1, 1, 0, 1 }, { 0, 0, 0, 15+ min read Count the numbers that can be reduced to zero or less in a game Given two integers X and Y and an array of N integers. Player A can decrease any element of the array by X and Player B can increase any element of the array by Y. The task is to count the number of elements that A can reduce to 0 or less. They both play optimally for an infinite time with A making the first move. Note: A number once reduced to zer 10 min read Game Theory (Normal - form game) | Set 1 (Introduction) Game theory is a mathematical model used for decision making. It has applications in all fields of social science, as well as in logic and computer science. Game theory has come to play an increasingly important role in logic and in computer science. To be fully defined, a game must specify the following elements: the players of the game, the infor 4 min read Game Theory (Normal-form Game) | Set 5 (Dominance Property-Mixed Strategy) This article discusses how to solve a game by the dominance property with mixed strategy. Consider the below game: Solution: Find out the row minimum and column maximum values. Here Minimax value is not equal to Maximin so this game has no saddle point. Now proceed with dominance property to reduce the rows and the columns. Reducing the row and the 2 min read Combinatorial Game Theory | Set 2 (Game of Nim) We strongly recommend to refer below article as a prerequisite of this. Combinatorial Game Theory | Set 1 (Introduction) In this post, Game of Nim is discussed. The Game of Nim is described by the following rules- “ Given a number of piles in which each pile contains some numbers of stones/coins. In each turn, a player can choose only one pile and 15+ min read Game Theory (Normal-form Game) | Set 4 (Dominance Property-Pure Strategy) In some of the games, it is possible to reduce the size of the payoff matrix by eliminating rows (or columns) that are dominated by other rows (or columns) respectively.Dominance property for rows: X ≤ Y i.e. if all the elements of a particular row X are less than or equal to the corresponding elements of another row Y then delete row X (row X is 4 min read

    Article Tags :

    • DSA
    • Game Theory
    • Mathematical
    • Technical Scripter

    Practice Tags :

    • Game Theory
    • Mathematical

    We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy

    Zero-Sum Game - GeeksforGeeks (3)

    Zero-Sum Game - GeeksforGeeks (2024)


    Zero-Sum Game - GeeksforGeeks? ›

    A zero-sum game is one in which no wealth is created or destroyed. So, in a two-player zero-sum game, whatever one player wins, the other loses. In this game, we can include at least two and a maximum to an infinite number of contestants.

    What is an example of a zero-sum game? ›

    Zero-sum games are found in many contexts. Poker and gambling are popular examples of zero-sum games since the sum of the amounts won by some players equals the combined losses of the others. Games like chess and tennis, where there is one winner and one loser, are also zero-sum games.

    What is the zero-sum algorithm? ›

    Well, we can use an algorithm called the zero-sum game also known as the minimax algorithm. A zero-sum game is a representation of math when two-players, or each participants in a game, gain or loses a point. It balances the losses or gains of the points from each player.

    What is the zero-sum game in math? ›

    A two-player game is called a zero-sum game if the sum of the payoffs to each player is constant for all possible outcomes of the game. More specifically, the terms (or coordinates) in each payoff vector must add up to the same value for each payoff vector. Such games are sometimes called constant-sum games instead.

    What is a zero-sum game mindset? ›

    In psychology, zero-sum thinking refers to the perception that a given situation is like a zero-sum game, where one person's gain is equal to another person's loss.

    What is a real life example of a non-zero sum game? ›

    What is a Non Zero Sum Game? A non zero sum game is a situation where there is a net benefit or net loss to the system based on the game's outcome. An example of what should be considered a non zero sum game is a contest between a trade ship and a pirate ship, although it may look like one at first glance.

    Is Rock Paper Scissors a zero-sum game? ›

    A rock beats scissors, scissors beat paper by cutting it, and paper beats rock by covering it. In this simulation, the computer has two different strategies that it can follow. Rock, paper, scissors is an example of a zero-sum game without perfect information. Whenever one player wins, the other loses.

    What's the opposite of a zero-sum game? ›

    In game theory, situation where one decision maker's gain (or loss) does not necessarily result in the other decision makers' loss (or gain). In other words, where the winnings and losses of all players do not add up to zero and everyone can gain: a win-win game.

    What is zero-sum game structure? ›

    Zero-sum games are typically characterised by competition, where one participant's success directly comes at the expense of another participant's failure. In a zero-sum game, the total value or wealth in the system remains the same before and after the interactions among participants.

    What is an example of a two person zero-sum game? ›

    Tic-tac-toe is a simpler example of a two-player zero-sum game. To a game theorist, a strategy for the first player describes the first move and where to move on future opportunities under all possible circ*mstance. This leads to an enormous number of strategies.

    How do you beat the zero-sum game? ›

    In a zero-sum game, the best strategy is often to try to maximize your own gain while minimizing your opponent's gain.

    What is the zero-sum paradigm? ›

    Zero-sum Paradigm Term Analysis. Next. Symbols. The zero-sum paradigm is the assumption that politics is a zero-sum competition between different racial groups—meaning that what is good for people of color must necessarily hurt white people, and vice-versa.

    What is another name for a zero-sum game? ›

    winner-take-all. hard-line. high-stake. win-or-lose. high stakes.

    What is an example of zero sum thinking? ›

    In a negotiation when one negotiator thinks that they can only gain at the expense of the other party (i.e., that mutual gain is not possible). In the context of social group competition, the belief that more resources for one group (e.g., immigrants) means less for others (e.g., non-immigrants).

    What is the zero-sum fallacy? ›

    It's the one that says wealth is fixed, so that if someone gains more of it, it must be at the expense of someone else having less. It's often nicknamed the pizza pie fallacy because, with a fixed size of pie, a bigger slice for one person means less pie left for others.

    Which theory believes in a zero-sum game? ›

    The concept of zero-sum games comes from game theory, a theoretical approach within economics that uses mathematics to understand how rational people make decisions. In a zero-sum game, the game begins and ends with the same total amount of a particular resource. There can be two or more players.

    Which of the following best describes a zero-sum game? ›

    Mathematicians, economists and analysts use the term zero-sum game throughout game theory and economic theory. It describes the financial gains of one party that cause an equal amount of loss for the other party.

    What is an example of a zero-sum negotiation? ›

    It is a zero sum game in which one person's gains always come at the expense of another. Bargaining over the price of a product or service is an example in which every dollar advantage you gain by getting the price lowered, the other party loses by receiving one dollar less.

    What is a zero-sum game in relationships? ›

    When this concept is applied to relationships, a zero-sum game mentality reflects the belief that one partner's gain directly results in the other partner's loss. In other words, the relationship is seen as a kind of battleground, where every interaction or decision has a winner and a loser.

    Top Articles
    Latest Posts
    Article information

    Author: Mr. See Jast

    Last Updated:

    Views: 6069

    Rating: 4.4 / 5 (55 voted)

    Reviews: 86% of readers found this page helpful

    Author information

    Name: Mr. See Jast

    Birthday: 1999-07-30

    Address: 8409 Megan Mountain, New Mathew, MT 44997-8193

    Phone: +5023589614038

    Job: Chief Executive

    Hobby: Leather crafting, Flag Football, Candle making, Flying, Poi, Gunsmithing, Swimming

    Introduction: My name is Mr. See Jast, I am a open, jolly, gorgeous, courageous, inexpensive, friendly, homely person who loves writing and wants to share my knowledge and understanding with you.