We consider the following modification of annihilation games called node blocking. Given a directed graph, each vertex can be occupied by at most one token. There are two types of tokens, each player can move only tokens of his type. The players alternate their moves and the current player i selects one token of type i and moves the token along a directed edge to an unoccupied vertex. If a play...

The National Basketball Association(NBA) has expanded their data gathering and have heavily invested in new technologies to gather advanced performance metrics on players. This expanded data set allows analysts to use unique performance metrics in models to estimate and classify player performance. Instead of grouping players together based on physical attributes and positions played, analysts ...

Cursor-driven games compose the vast majority of digital games on the market. For humans and for agents that control a virtual cursor, precise cursor control is frequently the primary determining factor of skill. Past efforts to control computer difficulty by adding rule-based distortions to the virtual cursor are inflexible and often based on coarse difficulty settings. We propose a framework ...

We start by giving a few precise definitions. Definition 1. A n-player finite game 〈[n], (Sp)p∈[n], (up)p∈[n]〉 is formally defined as follows. • We have a set of n players [n] = {1, 2, . . . , n}. • Each player p ∈ [n] has a finite set of strategies or actions Sp. • The set S = ∏ p∈[n] Sp is the set of strategy profiles. • Each player can choose a distribution of strategies x ̃p ∈ ∆p = {xp ∈ Rp ...

In this paper, we study the complexity of deciding which player has a winning strategy in certain types of McNaughton games. These graph games can be used as models for computational problems and processes of infinite duration. We consider the cases (1) where the first player wins when vertices in a specified set are visited infinitely often and vertices in another specified set are visited fin...

We investigate how strategic behavior is affected by the set of notions (frames) used when thinking about game. In our games action consists visual objects: each player must privately choose one, trying to match counterpart’s choice. propose a model where different player-types are aware attributes (hence, frames). One novelties an epistemic structure that allows players think new frames, after...

The relaxation of nuclear dipolar energy to the lattice has been measured in three different organic solids (benzene, cyclohexane and hexamethylbenzene) as a function of temperature. In the cases of C6H8 and C 6 (CH 3 ) 6 very slow motions associated with rather high activation energy were detected near the melting point. They are thought to be thermally activated rotations of the molecules abo...

In this paper we introduce novel algorithmic strategies for effciently playing two-player games in which the players have different or identical player roles. In the case of identical roles, the players compete for the same objective (that of winning the game). The case with different player roles assumes that one of the players asks questions in order to identify a secret pattern and the other...

In this thesis we propose a new video interaction model called adaptive fast-forwarding to help people quickly browse videos with predefined semantic rules. This model is designed around the metaphor of scenic car driving, in which the driver slows down near areas of interest and speeds through unexciting areas. Results from a preliminary user study of our video player suggest the following: • ...