The extension of the Leitmann-Schmitendorf advertising game to n players and positive time discounting is investigated. We show that the strong time consistency of the open-loop N...
In 1989, an effort to solve the game of checkers began. It was naïve because of the daunting size of the search space, 5×1020 positions, and because of computer capabilities of ...
We introduce a new family of one-player games, involving the movement of coins from one configuration to another. Moves are restricted so that a coin can be placed only in a posit...
Erik D. Demaine, Martin L. Demaine, Helena A. Verr...
Game theorists typically assume that changing a game's payoff levels--by adding the same constant to, or subtracting it from, all payoffs--should not affect behavior. While t...
The phenomenon of diminishing returns for additional search effort has been observed by several researchers. We study experimentally additional factors which influence the behavio...