Win–win game

Short description: Game theory scenario

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

In game theory, a win–win game or win–win[1] scenario is a situation that produces a mutually beneficial outcome for two or more parties.[2] It is also called a positive-sum game as it is the opposite of a zero-sum game.[3] If a win–win scenario is not achieved, the scenario becomes a lose–lose situation by default, since it had caused failure for at least one of the parties.

While she did not coin the term, Mary Parker Follett's process of integration described in her book Creative Experience (Longmans, Green & Co., 1924) forms the basis of what we now refer to as the idea of "win-win" conflict resolution.[4] An example of a win-win scenario is trade, since both parties end up with a good or service they value more, making both participants better off.[5]

## See also

* Abundance mentality
* Game
* Cooperative game
* Group-dynamic game
* Lump of labour fallacy
* No-win situation
* Zero-sum thinking

## References

1. ↑ "Ok Win" (in en-US). https://ok-win.de/.
2. ↑ "win-win situation definition". 17 January 2016. https://www.unescwa.org/win-win-situation.
3. ↑ Tsai, Jiin-Song; Chi, Cheryl S. F. (2015-07-01). "Learning for Win-Win Collaboration" (in EN). Journal of Construction Engineering and Management 141 (7): 04015013. doi:10.1061/(ASCE)CO.1943-7862.0000993. ISSN 1943-7862. https://ascelibrary.org/doi/10.1061/(ASCE)CO.1943-7862.0000993.
4. ↑ Tonn, Joan C. (2003). Mary P. Follett: Creating Democracy, Transforming Management. Yale University Press. p. 360. doi:10.12987/yale/9780300096217.001.0001. ISBN 0-300-09621-6. https://doi.org/10.12987/yale/9780300096217.001.0001. Retrieved 4 August 2022.
5. ↑ "Is Trade a Zero-Sum Game? The Answer Lies in Chocolate" (in en). https://www.stlouisfed.org/open-vault/2019/january/trade-zero-sum-game-chocolate.

* v
* t
* e

Topics in game theory

Definitions|

* 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|

* 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
* Strategy-stealing argument
* Tit for tat
* Grim trigger
* Collusion
* Backward induction
* Forward induction
* Markov strategy

Classes
of games|

* Symmetric game
* Perfect information
* 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 game
* Strictly determined game
* Potential game

Games|

* Go
* Chess
* Infinite chess
* Checkers
* Tic-tac-toe
* Prisoner's dilemma
* Optional 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 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
* Prisoners and hats puzzle
* 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
* 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
* Jean Tirole
* Jean-François Mertens
* Jennifer Tour Chayes
* John Harsanyi
* John Maynard Smith
* Antoine Augustin Cournot
* 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

See also|

* All-pay auction
* Alpha–beta pruning
* Bertrand paradox
* Bounded rationality
* Combinatorial game theory
* Confrontation analysis
* Coopetition
* First-move advantage in chess
* 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

0.00

(0 votes)

Original source: https://en.wikipedia.org/wiki/Win–win game. Read more

|

Retrieved from "https://handwiki.org/wiki/index.php?title=Social:Win–win_game&oldid=4302611"
*[v]: View this template
*[t]: Discuss this template
*[e]: Edit this template