Zero-sum

Thursday, 01 December 2011

upload

go to the top
About WN
Contact
Feedback
Privacy Policy
© 2011 World News Inc., all Rights Reserved

Zero-sum

Play next
List all Videos
Autoplay
Autorepeat
Shuffle
Replay

clear restore
list images
close sort

Nine Inch Nails-Zero Sum Year Zero

6:19

Zero Sum remixed

5:51

Non-Zero Sum Solution

7:30

Nine Inch Nails - Zero Sum (Still)

6:40

Economic Pie: Zero Sum Game vs Grow the Pie: John Stossel; Bake your own pie, don't steal mine

9:20

Zero-Sum (Game Theory Film)

4:20

Year 2023 / The Zero Sum

5:56

TV AD: Zero-Sum Game

0:31

Nine Inch Nails - Zero Sum (Remixed by Splitter)

7:09

Milton Friedman - The Zero-Sum Political Game

6:45

Zero-Sum World: power and prosperity in the age of anxiety

73:13

21scott - Zero Sum Rule

5:27

Zero-Sum

6:15

NINE INCH NAILS-ZERO SUM

6:14

remove add to playlist show more results video results for: zero-sum

sympath - zero sum

7:31

Nine Inch Nails - In This Twilight (into Zero Sum) - Live in Cedar Rapids - 11.20.08

5:39

Shame On Us (Zero-Sum Remix) - Nine Inch Nails

5:05

Milton Friedman on Slavery and Colonization

8:42

Zero-Sum (Grande Finale Remix)

8:24

Nine Inch Nails - Zero-Sum (Year Zero) New 2007

6:14

Nine Inch Nails - Zero-Sum

6:09

[ZERO-SUM] I love my little sister

6:14

Anwar: PPSMI bukan zero sum game

4:54

Open Video Suggestions

In game theory and economic theory, a zero-sum game is a mathematical representation of a situation in which a participant's gain or loss is exactly balanced by the losses or gains of the other participant(s). If the total gains of the participants are added up, and the total losses are subtracted, they will sum to zero. Cutting a cake is zero-sum game, because taking a larger piece reduces the amount of cake available for others. In contrast, non-zero-sum describes a situation in which the interacting parties' aggregate gains and losses is either less than or more than zero. A zero-sum game is also called a strictly competitive game. Zero-sum games are most often solved with the minimax theorem which is closely related to linear programming duality, or with Nash equilibrium.

Definition

The zero-sum property (if one gains, another loses) means that any result of a zero-sum situation is Pareto optimal (generally, any game where all strategies are Pareto optimal is called a conflict game).

Situations where participants can all gain or suffer together are referred to as non-zero-sum. Thus, a country with an excess of bananas trading with another country for their excess of apples, where both benefit from the transaction, is in a non-zero-sum situation. Other non-zero-sum games are games in which the sum of gains and losses by the players are sometimes more or less than what they began with.

Solution

For 2-player finite zero-sum games, the different game theoretic solution concepts of Nash equilibrium, minimax, and maximin all give the same solution. In the solution, players play a mixed strategy.

Example


	A	B	C
1
2

A game's payoff matrix is a convenient representation. Consider for example the two-player zero-sum game pictured at right.

The order of play proceeds as follows: The first player (red) chooses in secret one of the two actions 1 or 2; the second player (blue), unaware of the first player's choice, chooses in secret one of the three actions A, B or C. Then, the choices are revealed and each player's points total is affected according to the payoff for those choices.

Example: Red chooses action 2 and Blue chooses action B. When the payoff is allocated, Red gains 20 points and Blue loses 20 points.

Now, in this example game both players know the payoff matrix and attempt to maximize the number of their points. What should they do?

Red could reason as follows: "With action 2, I could lose up to 20 points and can win only 20, while with action 1 I can lose only 10 but can win up to 30, so action 1 looks a lot better." With similar reasoning, Blue would choose action C. If both players take these actions, Red will win 20 points. But what happens if Blue anticipates Red's reasoning and choice of action 1, and goes for action B, so as to win 10 points? Or if Red in turn anticipates this devious trick and goes for action 2, so as to win 20 points after all?

Émile Borel and John von Neumann had the fundamental and surprising insight that probability provides a way out of this conundrum. Instead of deciding on a definite action to take, the two players assign probabilities to their respective actions, and then use a random device which, according to these probabilities, chooses an action for them. Each player computes the probabilities so as to minimise the maximum expected point-loss independent of the opponent's strategy. This leads to a linear programming problem with the optimal strategies for each player. This minimax method can compute provably optimal strategies for all two-player zero-sum games.

For the example given above, it turns out that Red should choose action 1 with probability 4/7 and action 2 with probability 3/7, while Blue should assign the probabilities 0, 4/7, and 3/7 to the three actions A, B, and C. Red will then win 20/7 points on average per game.

Solving

The Nash equilibrium for a two-player, zero-sum game can be found by solving a linear programming problem. Suppose a zero-sum game has a payoff matrix

M

where element

M_{i,j}

is the payoff obtained when the minimizing player chooses pure strategy

i

and the maximizing player chooses pure strategy

j

(i.e. the player trying to minimize the payoff chooses the row and the player trying to maximize the payoff chooses the column). Assume every element of

M

is positive. The game will have at least one Nash equilibrium. The Nash equilibrium can be found (see ref. [2], page 740) by solving the following linear program to find a vector

u

:Minimize: ::: $\sum_{i} u_i$ :Subject to the constraints: :: $u$ ≥ 0 :: $M u$ ≥ 1.

The first constraint says each element of the $u$ vector must be nonnegative, and the second constraint says each element of the $M u$ vector must be at least 1. For the resulting $u$ vector, the inverse of the sum of its elements is the value of the game. Multiplying $u$ by that value gives a probability vector, giving the probability that the maximizing player will choose each of the possible pure strategies.

If the game matrix does not have all positive elements, simply add a constant to every element that is large enough to make them all positive. That will increase the value of the game by that constant, and will have no effect on the equilibrium mixed strategies for the equilibrium.

The equilibrium mixed strategy for the minimizing player can be found by solving the dual of the given linear program. Or, it can be found by using the above procedure to solve a modified payoff matrix which is the transpose and negation of $M$ (adding a constant so it's positive), then solving the resulting game.

If all the solutions to the linear program are found, they will constitute all the Nash equilibria for the game. Conversely, any linear program can be converted into a two-player, zero-sum game by using a change of variables that puts it in the form of the above equations. So such games are equivalent to linear programs, in general.

Non-zero-sum

Economics

Many economic situations are not zero-sum, since valuable goods and services can be created, destroyed, or badly allocated, and any of these will create a net gain or loss. Assuming the counterparties are acting rationally with symmetric information, any commercial exchange is a non-zero-sum activity, because each party must consider the goods it is receiving as being at least fractionally more valuable than the goods it is delivering. Economic exchanges must benefit both parties enough above the zero-sum such that each party can overcome its transaction costs.

See also:

Absolute advantage

Comparative advantage

Free trade

Gains from trade

Psychology

The most common or simple example from the subfield of Social Psychology is the concept of "Social Traps". In some cases we can enhance our collective well-being by pursuing our personal interests — or parties can pursue mutually destructive behavior as they choose their own ends.

Complexity

It has been theorized by Robert Wright in his book Nonzero: The Logic of Human Destiny, that society becomes increasingly non-zero-sum as it becomes more complex, specialized, and interdependent. As former US President Bill Clinton states:

}}

Extensions

In 1944 John von Neumann and Oskar Morgenstern proved that any zero-sum game involving n players is in fact a generalized form of a zero-sum game for two players, and that any non-zero-sum game for n players can be reduced to a zero-sum game for n + 1 players; the (n + 1) player representing the global profit or loss.

Misunderstandings

Zero–sum games and particularly their solutions are commonly misunderstood by critics of game theory, usually with respect to the independence and rationality of the players, as well as to the interpretation of utility functions. Furthermore, the word "game" does not imply the model is valid only for recreational games.

References

External links

Play zero-sum games online by Elmer G. Wiens.

Game Theory & its Applications - comprehensive text on psychology and game theory. (Contents and Preface to Second Edition.)

Category:Non-cooperative games Category:International relations theory

ar:مجموع صفري ca:Joc de suma nul·la cs:Hra s nulovým součtem de:Nullsummenspiel es:Juego de suma cero fr:Jeu à somme nulle ko:제로섬 게임 is:Núllsummuleikur it:Gioco a somma zero he:משחק סכום אפס nl:Nulsomspel ja:ゼロ和 no:Nullsumspill nds:Nullsummenspeel pl:Gra o sumie stałej pt:Soma-zero ru:Антагонистическая игра sk:Hra s nulovým súčtom sr:Нулта сума fi:Nollasummapeli sv:Nollsummespel th:เกมศูนย์ uk:Ігри антагоністичні ur:صفر حاصل جمع zh:零和博弈

This text is licensed under the Creative Commons CC-BY-SA License. This text was originally published on Wikipedia and was developed by the Wikipedia community.

The World News (WN) Network, has created this privacy statement in order to demonstrate our firm commitment to user privacy. The following discloses our information gathering and dissemination practices for wn.com, as well as e-mail newsletters.

1. Personal Information Collection and Use

We do not collect personally identifiable information about you, except when you provide it to us. For example, if you submit an inquiry to us or sign up for our newsletter, you may be asked to provide certain information such as your contact details (name, e-mail address, mailing address, etc.).

When you submit your personally identifiable information through wn.com, you are giving your consent to the collection, use and disclosure of your personal information as set forth in this Privacy Policy. If you would prefer that we not collect any personally identifiable information from you, please do not provide us with any such information. We will not sell or rent your personally identifiable information to third parties without your consent, except as otherwise disclosed in this Privacy Policy.

Except as otherwise disclosed in this Privacy Policy, we will use the information you provide us only for the purpose of responding to your inquiry or in connection with the service for which you provided such information. We may forward your contact information and inquiry to our affiliates and other divisions of our company that we feel can best address your inquiry or provide you with the requested service. We may also use the information you provide in aggregate form for internal business purposes, such as generating statistics and developing marketing plans. We may share or transfer such non-personally identifiable information with or to our affiliates, licensees, agents and partners.

We may retain other companies and individuals to perform functions on our behalf. Such third parties may be provided with access to personally identifiable information needed to perform their functions, but may not use such information for any other purpose.

In addition, we may disclose any information, including personally identifiable information, we deem necessary, in our sole discretion, to comply with any applicable law, regulation, legal proceeding or governmental request.

2. E-mail addresses

We do not want you to receive unwanted e-mail from us. We try to make it easy to opt-out of any service you have asked to receive. If you sign-up to our e-mail newsletters we do not sell, exchange or give your e-mail address to a third party.

E-mail addresses are collected via the wn.com web site. Users have to physically opt-in to receive the wn.com newsletter and a verification e-mail is sent. wn.com is clearly and conspicuously named at the point of

collection.

If you no longer wish to receive our newsletter and promotional communications, you may opt-out of receiving them by following the instructions included in each newsletter or communication or by e-mailing us at michaelw(at)wn.com

The security of your personal information is important to us. We follow generally accepted industry standards to protect the personal information submitted to us, both during registration and once we receive it. No method of transmission over the Internet, or method of electronic storage, is 100 percent secure, however. Therefore, though we strive to use commercially acceptable means to protect your personal information, we cannot guarantee its absolute security.

If we decide to change our e-mail practices, we will post those changes to this privacy statement, the homepage, and other places we think appropriate so that you are aware of what information we collect, how we use it, and under what circumstances, if any, we disclose it.

If we make material changes to our e-mail practices, we will notify you here, by e-mail, and by means of a notice on our home page.

3. Third Party Advertisers

The advertising banners and other forms of advertising appearing on this Web site are sometimes delivered to you, on our behalf, by a third party. In the course of serving advertisements to this site, the third party may place or recognize a unique cookie on your browser. For more information on cookies, you can visit www.cookiecentral.com.

4. Business Transfers

As we continue to develop our business, we might sell certain aspects of our entities or assets. In such transactions, user information, including personally identifiable information, generally is one of the transferred business assets, and by submitting your personal information on Wn.com you agree that your data may be transferred to such parties in these circumstances.

Make changes yourself !

Make changes yourself !

Definition

Solution

Example

Solving

Non-zero-sum

Economics

Psychology

Complexity

Extensions

Misunderstandings

References

Further reading

External links

1. Personal Information Collection and Use

2. E-mail addresses

3. Third Party Advertisers

4. Business Transfers