When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Rubinstein bargaining model - Wikipedia

    en.wikipedia.org/wiki/Rubinstein_bargaining_model

    A Rubinstein bargaining model refers to a class of bargaining games that feature alternating offers through an infinite time horizon. The original proof is due to Ariel Rubinstein in a 1982 paper. [1] For a long time, the solution to this type of game was a mystery; thus, Rubinstein's solution is one of the most influential findings in game theory.

  3. Minimum effort game - Wikipedia

    en.wikipedia.org/wiki/Minimum_Effort_Game

    In Game theory, the minimum effort game or weakest link game is a game in which each person decides how much effort to put in and is rewarded based on the least amount of effort anyone puts in. [1] It is assumed that the reward per unit of effort is greater than the cost per unit effort, otherwise there would be no reason to put in effort.

  4. Game complexity - Wikipedia

    en.wikipedia.org/wiki/Game_complexity

    The game tree size is the total number of possible games that can be played. This is the number of leaf nodes in the game tree rooted at the game's initial position.. The game tree is typically vastly larger than the state-space because the same positions can occur in many games by making moves in a different order (for example, in a tic-tac-toe game with two X and one O on the board, this ...

  5. John Harsanyi - Wikipedia

    en.wikipedia.org/wiki/John_Harsanyi

    While teaching at Berkeley, Harsanyi did extensive research in game theory. Harold Kuhn, who had been John von Neumann's student in Princeton and already had games theory publications encouraged him in this. The work for which he won the 1994 Nobel Prize in economics was a series of articles published in 1967 and 1968 which established what has ...

  6. List of game theorists - Wikipedia

    en.wikipedia.org/wiki/List_of_game_theorists

    John Harsanyi – equilibrium theory (Nobel Memorial Prize in Economic Sciences in 1994) Monika Henzinger – algorithmic game theory and information retrieval; John Hicks – general equilibrium theory (including Kaldor–Hicks efficiency) Naira Hovakimyan – differential games and adaptive control; Peter L. Hurd – evolution of aggressive ...

  7. Winning Ways for Your Mathematical Plays - Wikipedia

    en.wikipedia.org/wiki/Winning_Ways_for_Your...

    The first volume introduces combinatorial game theory and its foundation in the surreal numbers; partizan and impartial games; Sprague–Grundy theory and misère games. The second volume applies the theorems of the first volume to many games, including nim, sprouts, dots and boxes, Sylver coinage, philosopher's phutball, fox and geese.

  8. Asteroid mining - Wikipedia

    en.wikipedia.org/wiki/Asteroid_mining

    The authors' model posits that space mining would become more attractive under several conditions: when environmental regulations increase the cost of terrestrial mining, when research and development improves the efficiency of space mining technology, and when higher-grade mineral deposits become available in space compared to Earth. The paper ...

  9. Sprague–Grundy theorem - Wikipedia

    en.wikipedia.org/wiki/Sprague–Grundy_theorem

    An impartial game is one in which at any given point in the game, each player is allowed exactly the same set of moves. Normal-play nim is an example of an impartial game. In nim, there are one or more heaps of objects, and two players (we'll call them Alice and Bob), take turns choosing a heap and removing 1 or more objects from it.