Win-win game

"Win win" redirects here. For other uses, see Win win (disambiguation).

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

↑ "Win-Win Negotiation". Retrieved 26 June 2012.
↑ "What Is Win-Win Negotiation?". Retrieved 26 June 2012. by Steve Roberts
↑ "Win-Win Strategies: Case Studies" (PDF). Archived from the original (PDF) on April 17, 2012. Retrieved 26 June 2012.

Topics in game theory

Definitions	Normal-form game Extensive-form game Escalation of commitment Graphical game Cooperative game Succinct game Information set Hierarchy of beliefs Preference

Equilibrium concepts	Nash equilibrium Subgame perfection Mertens-stable equilibrium Bayesian Nash equilibrium Perfect Bayesian equilibrium Trembling hand Proper equilibrium Epsilon-equilibrium Correlated equilibrium Sequential equilibrium Quasi-perfect equilibrium Evolutionarily stable strategy Risk dominance Core Shapley value Pareto efficiency Gibbs equilibrium Quantal response equilibrium Self-confirming equilibrium Strong Nash equilibrium Markov perfect equilibrium

Strategies	Dominant strategies Pure strategy Mixed strategy Tit for tat Grim trigger Collusion Backward induction Forward induction Markov strategy

Classes of games	Symmetric game Perfect information Simultaneous game Sequential game Repeated game Signaling game Screening game Cheap talk Zero-sum game Mechanism design Bargaining problem Stochastic game n-player game Large Poisson game Nontransitive game Global games Strictly determined game Potential game

Games	Prisoner's dilemma Traveler's dilemma Coordination game Chicken Centipede 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 games 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 Prisoners and hats puzzle Trust game Princess and monster game Monty Hall problem Rendezvous problem

Theorems	Minimax theorem Nash's theorem Purification theorem Folk theorem Revelation principle Arrow's impossibility theorem

Key figures	Albert W. Tucker Amos Tversky Ariel Rubinstein Daniel Kahneman David K. Levine David M. Kreps Donald B. Gillies Drew Fudenberg Eric Maskin Harold W. Kuhn Herbert Simon Hervé Moulin Jean Tirole Jean-François Mertens John Harsanyi John Maynard Smith John Nash John von Neumann Kenneth Arrow Kenneth Binmore Leonid Hurwicz Lloyd Shapley Melvin Dresher Merrill M. Flood Oskar Morgenstern Paul Milgrom Peyton Young Reinhard Selten Robert Aumann Robert B. Wilson Roger Myerson Samuel Bowles Thomas Schelling William Vickrey

See also	All-pay auction Alpha–beta pruning Bertrand paradox Bounded rationality Combinatorial game theory Confrontation analysis Coopetition List of game theorists List of games in game theory No-win situation Topological game Tragedy of the commons Tyranny of small decisions

This article is issued from Wikipedia - version of the 10/29/2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.

Win-win game

Types

Group dynamics

See also

References