This paper analyzes the multicriteria bimatrix goal game under the light of entropy environment. In this approach, the entropy functions of the players are considered as objectives to the bimatrix game. The solution concepts behind this game are based on getting the probability to achieve some specified goals by determining G-goal security strategies (GGSS). We define the real coded Genetic Alg...

Player experience is at the heart of good game design, but designers typically have limited experience data to work with. Detailed and fine-grained accounts of gaming experience would be of great value to designers and researchers alike, but recording such data is a significant challenge. We describe an approach based on post-game player commentaries, retrospective verbal reports cued by video ...

In game theory, deciding whether a designed player wins a game corresponds to check whether he has a winning strategy. There are situations in which it is important to know whether some extra winning strategy also exists. In this paper we investigate this question over two-player finite games, under the reachability objective. We provide an automata-based technique that, given such a game, it a...

This paper examines the performance of a number of AI agents on the games included in the General Video Game Playing Competition. Through analyzing these results, the paper seeks to provide insight into the strengths and weaknesses of the current generation of video game playing algorithms. The paper also provides an analysis of the given games in terms of inherent features which define the dif...

Meta-game approaches are studied through the design of the Go playing program INDIGO. Computer Go is a challenge for AI and the machine still remains weak compared to humans in the game of Go. This difference is used to try new technics as such as the Metagame technique discussed in this paper. A conceptual structure and a notion of Conway's game theory are described in order to show four appro...

In this paper, two games that play a role in creating a cancer tumor and suppression are studied using evolutionary game theory and its different modes are analyzed. The first game is the competition between a cancer cell and a healthy cell to receive food through the blood. In the second game, the interaction between the two oncogenes Ras and Myc is examined for cellular deformation

Repackaging of mobile games is serious problem in the Android environment. In this paper, we propose a repackaging detection technique using shortened instruction sequence. By using shortened instruction sequence, the proposed technique can be applicable to a mobile device and can block repackaged apps coming from various sources. In the experiment, our technique showed high accuracy of repacka...

Sprouts is a two players game that was first introduced by M.S. Patterson and J.H. Conway in 1967. There are two players A and B that starting from a set of x0 vertices draw a plane graph by alternatively connecting any pair of two vertices with degree less than three with an edge, and by inserting a new vertex in the new edge. The move is possible if and only if the new connection maintains th...

Several early game-playing computer programs used forward pruning (i.e., the practice of deliberately ignoring nodes that are believed unlikely to affect a game tree’s minimax value), but this technique did not seem to result in good decision-making. The poor performance of forward pruning presents a major puzzle for AI research on game playing, because some version of forward pruning seems to ...

Decomposition, i.e., independently analyzing possible subgames, has proven to be an essential principle for effective decision-making in perfect information games. However, in imperfect information games, decomposition has proven to be problematic. To date, all proposed techniques for decomposition in imperfect information games have abandoned theoretical guarantees. This work presents the firs...