Model checking is a very successful technique for verifying temporal properties of nite state concurrent systems. It is standard to view this method as essentially algorithmic, and consequently a very fruitful relationship between temporal lo-gics and automata has been developed. In the case

We investigate the origin and the validity of common beliefs regarding “the hot hand ” and “streak shooting ” in the game of basketball. Basketball players and fans alike tend to believe that a player’s chance of hitting a shot are greater following a hit than following a miss on the previous shot

This paper first introduces an approach relying on market games to examine how successive oligopolies do operate between downstream and upstream markets. This approach is then compared with the traditional analysis of oligopolistic interaction in successive markets. The market outcomes resulting

challenger and changing weights if the challenger wins. Surprisingly, this worked rather well. We investigate how the peculiar dynamics of this domain enabled a previously discarded weak method to succeed, by preventing suboptimal equilibria in a "meta-game" of self-learning. Keywords: coevolution

We survey a number of algorithms for the simple stochastic game problem, which is to determine the winning probability of a type of stochastic process, where the transitions are partially controlled by two players. We show that four natural approaches to solving the problem are incorrect

We transform a noncooperative game into a Bayesian decision problem for each player where the uncertainty faced by a player is the strategy choices of the other players, the priors of other players on the choice of other players, the priors over priors, and so on. We provide a complete

. A general construction of models of call-by-value from models of call-by-name computation is described. The construction makes essential use of the properties of sum types in common denotational models of call-by-name. When applied to categories of games, it yields fully abstract models

of required games needed for training to the same order of magnitude as TDL. The selection of suitable features is also of critical importance for the learning success. It could be shown that using the raw board position as an input feature is not very effective -and it is orders of magnitudes slower than

Abstract. One of the most challenging tasks when creating an adaptation mechanism is to transform domain knowledge into an evaluation function that adequately measures the quality of the generated solutions. The high complexity of modern video games makes the task to generate a suitable evaluation

DERIVED FROM COMPUTER-BASED GAMES. Michael Lewis and Jeffrey Jacobson # GAME ENGINES IN SCIENTIFIC RESEARCH environments using artistry and texture maps. The cost of developing ever more realistic simulations has grown so huge that even game developers can no longer rely on recouping