Win-win game

A win–win game is a game which is designed in a way that all participants can profit from it in one way or the other. In conflict resolution, a win–win strategy is a conflict resolution process that aims to accommodate all disputants.^[1]^[2]^[3]

Types

In colloquial speech, a win–win situation often refers to a situation where one benefits, not necessarily through someone else's loss.
In the context of group-dynamic games, win–win games are also called "cooperative games", "new games" or "games without losers".
Mathematical game theory also refers to win–win games as non-zero-sum games (although they may include situations where both players win or lose, as well).
The TKI Thomas/Kilmann Conflict Profile provides a model that reveals preferences under stress and pressure. Collaboration style focuses on win–win outcomes.

Group dynamics

Group-dynamics win–win games have been increasingly popular since the end of the Vietnam war and have been successfully applied to all levels of society.

Group-dynamics win–win games emphasize the importance of cooperation, fun, sharing, caring and overall group success in contrast to domination, egoistic behavior and personal gain. All players are treated as equally important and valuable. Win–win games often also carry an ethical message of caring for the environment and a holistic approach to life and society. Win–win games are a powerful tool to give people self-confidence and a "we" experience, especially when they have suffered from emotional isolation.

An example would be a game where all players try to carry a huge "earth ball" (a ball several meters in diameter) over their heads while negotiating an obstacle course. This is a typical example of a win–win game for several reasons:

there are no losers (everyone enjoys the accomplished task).
all players are involved (no-one is left out or sits out).
the game is psychologically working on many levels (communication, supporting each other, having fun in a group etc.)

Note that there are also mathematical win–win games; the mathematical term being non-zero-sum games. Such games are often simply represented by a matrix of payouts.

References

↑ Lua error in package.lua at line 80: module 'strict' not found.
↑ Lua error in package.lua at line 80: module 'strict' not found. by Steve Roberts
↑ Lua error in package.lua at line 80: module 'strict' not found.

[WWS-D-01-1] Lua error in package.lua at line 80: module 'strict' not found.

[WWS-D-02-2] Lua error in package.lua at line 80: module 'strict' not found. by Steve Roberts

[WWS-D-03-3] Lua error in package.lua at line 80: module 'strict' not found.

[1]

[2]

[3]

v t e Topics in game theory
Definitions	Congestion game Cooperative game Determinacy Escalation of commitment Extensive-form game First-player and second-player win Game complexity Graphical game Hierarchy of beliefs Information set Normal-form game Preference Sequential game Simultaneous game Simultaneous action selection Solved game Succinct game
Equilibrium concepts	Bayesian Nash equilibrium Berge equilibrium Core Correlated equilibrium Epsilon-equilibrium Evolutionarily stable strategy Gibbs equilibrium Mertens-stable equilibrium Markov perfect equilibrium Nash equilibrium Pareto efficiency Perfect Bayesian equilibrium Proper equilibrium Quantal response equilibrium Quasi-perfect equilibrium Risk dominance Satisfaction equilibrium Self-confirming equilibrium Sequential equilibrium Shapley value Strong Nash equilibrium Subgame perfection Trembling hand
Strategies	Backward induction Bid shading Collusion Forward induction Grim trigger Markov strategy Dominant strategies Pure strategy Mixed strategy Strategy-stealing argument Tit for tat
Classes of games	Bargaining problem Cheap talk Global game Intransitive game Mean-field game Mechanism design n-player game Perfect information Large Poisson game Potential game Repeated game Screening game Signaling game Stackelberg competition Strictly determined game Stochastic game Symmetric game Zero-sum game
Games	Go Chess Infinite chess Checkers Tic-tac-toe Prisoner's dilemma Gift-exchange game Optional prisoner's dilemma Traveler's dilemma Coordination game Chicken Centipede game Lewis signaling game Volunteer's dilemma Dollar auction Battle of the sexes Stag hunt Matching pennies Ultimatum game Rock paper scissors Pirate game Dictator game Public goods game Blotto game War of attrition El Farol Bar problem Fair division Fair cake-cutting Cournot game Deadlock Diner's dilemma Guess 2/3 of the average Kuhn poker Nash bargaining game Induction puzzles Trust game Princess and monster game Rendezvous problem
Theorems	Arrow's impossibility theorem Aumann's agreement theorem Folk theorem Minimax theorem Nash's theorem Purification theorem Revelation principle Zermelo's theorem
Key figures	Albert W. Tucker Amos Tversky Antoine Augustin Cournot Ariel Rubinstein Claude Shannon Daniel Kahneman David K. Levine David M. Kreps Donald B. Gillies Drew Fudenberg Eric Maskin Harold W. Kuhn Herbert Simon Hervé Moulin John Conway Jean Tirole Jean-François Mertens Jennifer Tour Chayes John Harsanyi John Maynard Smith John Nash John von Neumann Kenneth Arrow Kenneth Binmore Leonid Hurwicz Lloyd Shapley Melvin Dresher Merrill M. Flood Olga Bondareva Oskar Morgenstern Paul Milgrom Peyton Young Reinhard Selten Robert Axelrod Robert Aumann Robert B. Wilson Roger Myerson Samuel Bowles Suzanne Scotchmer Thomas Schelling William Vickrey
Miscellaneous	All-pay auction Alpha–beta pruning Bertrand paradox Bounded rationality Combinatorial game theory Confrontation analysis Coopetition Evolutionary game theory First-move advantage in chess Game Description Language Game mechanics Glossary of game theory List of game theorists List of games in game theory No-win situation Solving chess Topological game Tragedy of the commons Tyranny of small decisions

Win-win game

Contents

Types

Group dynamics

See also

References

Navigation menu

Personal tools

Namespaces

Variants

Views

More

Search

Navigation

Tools