We show some mathematical links between partially observable (PO) games in which information is regularly revealed, and simultaneous actions games. Using this, we study the extension of Monte-Carlo Tree Search algorithms to PO games and to games with simultaneous actions. We apply the results to Urban Rivals, a free PO internet card game with more than 10 millions of registered users.

Stopping games (without simultaneous stopping) are sequential games in which at every stage one of the players is chosen, who decides whether to continue the interaction or stop it, whereby a terminal payoff vector is obtained. Periodic stopping games are stopping games in which both of the processes that define it, the payoff process as well as the process by which players are chosen, are peri...

Herein we show a simple way to make the St. Petersburg Game fair for both Peter and Paul. By just considering the minimum of two simultaneous games we establish a way that could easily have been understood three centuries ago. Similarly, we show how to play the St. Petersburg Game by observing the maximum of two concurrent games. After showing how to make this fair for both Peter and Paul by pl...

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

This paper develops a two-stage model to consider a franchise/franchisee environment in which supply chains are simultaneously entering the untapped market to produce either identical or highly substitutable products and give franchise to franchisees. Customer demand is elastic, price dependent and customer utility function is based on Huff gravity rule model. The supply chains, in the first st...

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