enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Zero-sum game - Wikipedia

    en.wikipedia.org/wiki/Zero-sum_game

    A zero-sum game is also called a strictly competitive game, while non-zero-sum games can be either competitive or non-competitive. Zero-sum games are most often solved with the minimax theorem which is closely related to linear programming duality, [5] or with Nash equilibrium. Prisoner's Dilemma is a classic non-zero-sum game. [6]

  3. Game theory - Wikipedia

    en.wikipedia.org/wiki/Game_theory

    Modern game theory began with the idea of mixed-strategy equilibria in two-person zero-sum games and its proof by John von Neumann. Von Neumann's original proof used the Brouwer fixed-point theorem on continuous mappings into compact convex sets , which became a standard method in game theory and mathematical economics .

  4. Matching pennies - Wikipedia

    en.wikipedia.org/wiki/Matching_pennies

    Matching Pennies is a zero-sum game because each participant's gain or loss of utility is exactly balanced by the losses or gains of the utility of the other participants. If the participants' total gains are added up and their total losses subtracted, the sum will be zero.

  5. Minimax theorem - Wikipedia

    en.wikipedia.org/wiki/Minimax_theorem

    The first theorem in this sense is von Neumann's minimax theorem about two-player zero-sum games published in 1928, [2] which is considered the starting point of game theory. Von Neumann is quoted as saying "As far as I can see, there could be no theory of games

  6. Zero-sum thinking - Wikipedia

    en.wikipedia.org/wiki/Zero-sum_thinking

    Zero-sum thinking perceives situations as zero-sum games, where one person's gain would be another's loss. [ 1 ] [ 2 ] [ 3 ] The term is derived from game theory . However, unlike the game theory concept, zero-sum thinking refers to a psychological construct —a person's subjective interpretation of a situation.

  7. Nash equilibrium - Wikipedia

    en.wikipedia.org/wiki/Nash_equilibrium

    The concept of a mixed-strategy equilibrium was introduced by John von Neumann and Oskar Morgenstern in their 1944 book The Theory of Games and Economic Behavior, but their analysis was restricted to the special case of zero-sum games. They showed that a mixed-strategy Nash equilibrium will exist for any zero-sum game with a finite set of ...

  8. Backward induction - Wikipedia

    en.wikipedia.org/wiki/Backward_induction

    This variant of backward induction has been used to solve formal games from the beginning of game theory. John von Neumann and Oskar Morgenstern suggested solving zero-sum, two-person formal games through this method in their Theory of Games and Economic Behaviour (1944), the book which established game theory as a field of study. [6] [7]

  9. Glossary of game theory - Wikipedia

    en.wikipedia.org/wiki/Glossary_of_game_theory

    Determined game (or Strictly determined game) In game theory, a strictly determined game is a two-player zero-sum game that has at least one Nash equilibrium with both players using pure strategies. [2] [3] Dictator A player is a strong dictator if he can guarantee any outcome regardless of the other players.