Common Knowledge in Simultaneous-Move Games
نویسنده
چکیده
منابع مشابه
Heuristic Search Applied to Abstract Combat Games
Creating strong AI forces in military war simulations or RTS video games poses many challenges including partially observable states, a possibly large number of agents and actions, and simultaneous concurrent move execution. In this paper we consider a tactical sub-problem that needs to be addressed on the way to strong computer generated forces: abstract combat games in which a small number of...
متن کاملUsing Double-Oracle Method and Serialized Alpha-Beta Search for Pruning in Simultaneous Move Games
We focus on solving two-player zero-sum extensive-form games with perfect information and simultaneous moves. In these games, both players fully observe the current state of the game where they simultaneously make a move determining the next state of the game. We solve these games by a novel algorithm that relies on two components: (1) it iteratively solves the games that correspond to a single...
متن کاملLearning TOMs: Towards Non-Myopic Equilibria
In contrast to classical game theoretic analysis of simultaneous and sequential play in bimatrix games, Steven Brams has proposed an alternative framework called the Theory of Moves (TOM) where players can choose their initial actions and then, in alternating turns, decide to shift or not from its current action. A backward induction process is used to determine a non-myopic action and equilibr...
متن کاملAn Experimental Study of Incentive Reversal in Sequential and Simultaneous Games
I t is commonly held that increasing monetary rewards enhance work effort. This study, however, argues that this will not ineludibly occur in team activities. Incentive Reversal may occur in sequential team productions featuring positive external impacts on agents. This seemingly paradoxical event is explained through two experiments in this article. The first experiment involves a sample ...
متن کاملMonte Carlo Tree Search in Imperfect-Information Games Doctoral Thesis
Monte Carlo Tree Search (MCTS) is currently the most popular game playing algorithm for perfect-information extensive-form games. Its adaptation led, for example, to human expert level Go playing programs or substantial improvement of solvers for domain-independent automated planning. Inspired by this success, researchers started to adapt this technique also for imperfect-information games. Imp...
متن کامل