When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. List of games in game theory - Wikipedia

    en.wikipedia.org/wiki/List_of_games_in_game_theory

    Constant sum: A game is a constant sum game if the sum of the payoffs to every player are the same for every single set of strategies. In these games, one player gains if and only if another player loses. A constant sum game can be converted into a zero sum game by subtracting a fixed value from all payoffs, leaving their relative order unchanged.

  3. Game theory - Wikipedia

    en.wikipedia.org/wiki/Game_theory

    Game theory is the study of mathematical models of strategic interactions. [1] It has applications in many fields of social science, and is used extensively in economics, logic, systems science and computer science. [2]

  4. Information set (game theory) - Wikipedia

    en.wikipedia.org/wiki/Information_set_(game_theory)

    The first game is simply sequential―when player 2 makes a choice, both parties are already aware of whether player 1 has chosen O(pera) or F(ootball). The second game is also sequential, but the dotted line shows player 2's information set. This is the common way to show that when player 2 moves, he or she is not aware of what player 1 did.

  5. Strategy (game theory) - Wikipedia

    en.wikipedia.org/wiki/Strategy_(game_theory)

    In applied game theory, the definition of the strategy sets is an important part of the art of making a game simultaneously solvable and meaningful. The game theorist can use knowledge of the overall problem, that is the friction between two or more players, to limit the strategy spaces, and ease the solution.

  6. 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.

  7. Perfect recall (game theory) - Wikipedia

    en.wikipedia.org/wiki/Perfect_recall_(game_theory)

    It is a core component of how game theorists analyze extensive-form games. The formal definition of perfect recall involves the concept of information sets in extensive-form games. It ensures that if a player reaches a certain information set, the player's past actions and information are consistent with all the nodes within that information set.

  8. Solution concept - Wikipedia

    en.wikipedia.org/wiki/Solution_concept

    In game theory, a solution concept is a formal rule for predicting how a game will be played. These predictions are called "solutions", and describe which strategies will be adopted by players and, therefore, the result of the game. The most commonly used solution concepts are equilibrium concepts, most famously Nash equilibrium.

  9. Normal-form game - Wikipedia

    en.wikipedia.org/wiki/Normal-form_game

    In game theory, normal form is a description of a game. Unlike extensive form , normal-form representations are not graphical per se , but rather represent the game by way of a matrix . While this approach can be of greater use in identifying strictly dominated strategies and Nash equilibria , some information is lost as compared to extensive ...