Coledam DHC, Paludo AC, Oliveira AR, Dos-Santos JW. Dynamic exercise versus tag game warm up: the acute effect on agility and vertical jump in children. J. Hum. Sport Exerc. Vol. 7, No. 1, pp. 243-253, 2012. Although dynamic and stretching exercises have been widely investigated, there is little information about warm up performed by tag games. Thus, the purpose of the present study was to veri...

In this paper we solve a finite-horizon partially observed risk-sensitive stochastic optimal control problem for discrete-time nonlinear systems and obtain small noise and small risk limits. The small noise limit is interpreted as a deterministic partially observed dynamic game, and new insights into the optimal solution of such game problems are obtained. Both the risk-sensitive stochastic con...

In this theses we present the design and implementation of three different network services for massively multiplayer online games. The first service is an approach for an integrated voice communication. The design is based on a hybrid architecture using a server-based signaling and peer-to-peer data transmission. This technique allows to relate speech processing to game events throuhgt the ser...

We prove that, in all finite generic extensive-form games of perfect information, a continuous-time best response dynamic always converges to a Nash equilibrium component. We show the robustness of convergence by an approximate best response dynamic: whatever the initial state and an allowed approximate best response dynamic, the state is close to the set of Nash equilibria most of the time. In...

Ontology alignments enable agents to communicate while preserving heterogeneity in their knowledge. Alignments may not be provided as input and should able evolve when communication fails or new information contradicting the alignment is acquired. The Alignment Repair Game (ARG) has been proposed for simultaneously repair through adaptation operators failures occur. ARG evaluated experimentally...

We consider a class of two-player dynamic stochastic nonzero-sum games where the state transition and observation equations are linear, and the primitive random variables are Gaussian. Each controller acquires possibly different dynamic information about the state process and the other controller’s past actions and observations. This leads to a dynamic game of asymmetric information among the c...

It is well-known that the problem of recognizing an ESS in a symmetric bimatrix game is coNPcomplete. In this paper, we show that recognizing an ESS even in doubly symmetric bimatrix games is also coNP-complete. Our result further implies that recognizing asymptotically stable equilibria of the replicator dynamic in this class of games is also a coNP-complete problem. It is also known that a st...

Effectiveness of the algorithm Minimax on the two-player turn-based card game Triple Triad. Research includes the depth of the game-tree search used by the algorithm and payoff values of each game-tree node as it directly relates to the complete or incomplete information of the game. Chris Constantinides 213-19-8361 14 December 200

We examine the relationship between Dependence Logic and game logics. A variant of Dynamic Game Logic, called Transition Logic, is developed, and we show that its relationship with Dependence Logic is comparable to the one between First-Order Logic and Dynamic Game Logic discussed by van Benthem. This suggests a new perspective on the interpretation of Dependence Logic formulas, in terms of ass...