We present an O(mn2n logZ) deterministic algorithm for solving the mean payo game problem, m and n being respectively the number of arcs and vertices in the game graph and Z being the maximum weight (we assume that the weights are integer numbers). The theoretical basis for the algorithm is the potential theory for mean payo games. This theory allows to restate the problem in terms of solving s...

game-based practicing of materials can be seen as a method of capturing an essence of real- life expe-rience which is commonly missing in the conventional face-to-face classrooms. to serve the l2 learn-ers' immediate communicative needs in wider classroom and societal contexts, this study sought to place l2 english learners within an interactional social framework through reinforcing their...

Game bots are a critical threat to Massively Multiplayer Online Role-Playing Games (MMORPGs) because they can seriously damage the reputation and in-game economy equilibrium of MMORPGs. Existing game bot detection techniques are not only generally sensitive to changes in game contents but also limited in detecting emerging bot patterns that were hitherto unknown. To overcome the limitation of l...

Games User Research (GUR) can provide meaningful insights into the study of games. As a part of GUR, we focus on the area of cognitive psychology and discuss electroencephalography (EEG) as an evaluation technique for games. We want to introduce game researchers to EEG when studying the cognitive side of player experience and discuss how it can benefit game studies. In this paper, we review EEG...

We examine the use of teleological metareasoning for self-adaptation in game-playing software agents. The goal of our work is to develop an interactive environment in which the game designer generates requirements for a new version of a game, and the legacy software agents from previous versions of the game adapt themselves to the new game requirements in cooperation with the human designer, wh...

................................................................................................................................................. v INTRODUCTION ........................................................................................................................................ 1 BACKGROUND .........................................................................................

We introduce a technique for using conventional predicate abstraction methods to reduce the state-space of models produced using game semantics. We focus on an expressive procedural language that has both local store and local control, a language which enjoys a simple game-semantic model yet is expressive enough to allow non-trivial examples. Our compositional approach allows the verification o...

Here, we propose a mathematical model to analyze bimatrix game under entropy environment. In this new approach, the entropy function for each player are considered as objectives to the bimatrix game. This formulated model is named as Entropy Bimatrix Game Model which is a multi-objective non linear problem. To solve this kind of model, we have introduced a new solution technique, which determin...

In this paper, we investigate the rational synthesis problem for concurrent game structure for a variety of objectives ranging from reachability to Muller condition. We propose a new algorithm that establishes the decidability of the non cooperative rational synthesis problem that relies solely on game theoretic technique as opposed to previous approaches that are logic based. Thanks to this ap...

Auto dynamic difficulty (ADD) is the technique of automatically changing the level of difficulty of a video game in real time to match player expertise. Recreating an ADD system on a game-by-game basis is both expensive and time consuming, ultimately limiting its usefulness. Thus, we leverage the benefits of software design patterns to construct an ADD framework. In this paper, we discuss a num...