• Journal of Digital Convergence
• /
• v.15 no.4
• /
• pp.461-468
• /
• 2017

The current available recommendation systems for mobile games have a couple of problems. First, there is no knowing whether they make a pattern recommendation for games that actual users prefer or for games that they are simply interested in. It is also impossible to know the subjective preference of users in a direct manner. An AHP(Analytic Hierarchy Process)-based recommendation system for mobile games was thus developed to reflect the subjective preference of users directly, but it had its own problem since the degree of preference could vary among users in spite of the same scale for their preferable items. In an effort to solve those problems, this study implemented a recommendation system for mobile games by applying triangular fuzzy numbers of the Fuzzy-AHP technique and the independence of evaluation items in the Bayesian Network. The findings show that the proposed recommendation system recorded the highest accuracy of recommendation results and the highest level of user satisfaction.

• Journal of Information Processing Systems
• /
• v.1 no.1 s.1
• /
• pp.107-111
• /
• 2005

When a pedagogical agent system aims to provide students with interactive help, it needs to know what knowledge the student has and what goals the student is currently trying to achieve. That is, it must do both assessment and plan recognition. These modeling tasks involve a high level of uncertainty when students are allowed to follow various lines of reasoning and are not required to show all their reasoning explicitly. In this paper, the student model for interactive edutainment applications is proposed. This model is based on Bayesian Networks to expose constructs and parameters of rules and propositions pertaining to game and problem solving activities. This student model could be utilized as the emotion generation model for student and agent as well.

• Journal of Korea Society of Industrial Information Systems
• /
• v.23 no.6
• /
• pp.9-19
• /
• 2018

As the recent developments in the game industry and people's interest in game streaming become more popular, non-professional gamers are also interested in games and buying them. However, it is difficult to judge which game is the most enjoyable among the games released in dozens every day. Although the game sales platform is equipped with the game recommendation function, it is not accurate because it is used as a means of increasing their sales and recommending users with a focus on their discount products or new products. For this reason, in this paper, we propose a game recommendation system based on the users ratings, which raises the recommendation satisfaction level of users and appropriately reflect their experience. In the system, we implement the rate prediction function using collaborative filtering and the game recommendation function using Naive Bayesian classifier to provide users with quick and accurate recommendations. As the result, the rate prediction algorithm achieved a throughput of 2.4 seconds and an average of 72.1 percent accuracy. For the game recommendation algorithm, we obtained 75.187 percent accuracy and were able to provide users with fast and accurate recommendations.

• Journal of Communications and Networks
• /
• v.17 no.1
• /
• pp.75-83
• /
• 2015

In mobile ad-hoc networks (MANETs), nodes are mobile in nature. Collaboration between mobile nodes is more significant in MANETs, which have as their greatest challenges vulnerabilities to various security attacks and an inability to operate securely while preserving its resources and performing secure routing among nodes. Therefore, it is essential to develop an effective secure routing protocol to protect the nodes from anonymous behaviors. Currently, game theory is a tool that analyzes, formulates and solves selfishness issues. It is seldom applied to detect malicious behavior in networks. It deals, instead, with the strategic and rational behavior of each node. In our study,we used the dynamic Bayesian signaling game to analyze the strategy profile for regular and malicious nodes. This game also revealed the best actions of individual strategies for each node. Perfect Bayesian equilibrium (PBE) provides a prominent solution for signaling games to solve incomplete information by combining strategies and payoff of players that constitute equilibrium. Using PBE strategies of nodes are private information of regular and malicious nodes. Regular nodes should be cooperative during routing and update their payoff, while malicious nodes take sophisticated risks by evaluating their risk of being identified to decide when to decline. This approach minimizes the utility of malicious nodes and it motivates better cooperation between nodes by using the reputation system. Regular nodes monitor continuously to evaluate their neighbors using belief updating systems of the Bayes rule.

• The Korean Journal of Applied Statistics
• /
• v.30 no.6
• /
• pp.1015-1025
• /
• 2017

Bayesian personalized ranking (BPR) is a state-of-the-art recommendation system techniques for implicit feedback data. Unfortunately, there might be a loss of information because the BPR model considers only the binary transformation of implicit feedback that is non-binary data in most cases. We propose a modified BPR method using a level of confidence based on the size or strength of implicit feedback to overcome this limitation. The proposed method is useful because it still has a structure of interpretable models for underlying personalized ranking i.e., personal pairwise preferences as in the BPR and that it is capable to reflect a numerical size or the strength of implicit feedback. We propose a computation algorithm based on stochastic gradient descent for the numerical implementation of our proposal. Furthermore, we also show the usefulness of our proposed method compared to ordinary BPR via an analysis of steam video games data.

• Journal of Korean Society of Transportation
• /
• v.22 no.7 s.78
• /
• pp.71-78
• /
• 2004

This paper presents a game-theoretic model of information transmission for variable message sign(VMS) operations. There are one VMS operator and many drivers as players. Operator wants to minimize the total travel time while the drivers want to minimize their own travel time. The operator who knows the actual traffic situation offers information strategically. The drivers evaluate the information from operator, and then choose the route. We model this situation as a cheap-talk game which is a simplest form of Bayesian game. We show that there is a possibility that the operator can improve the traffic efficiency by manipulating the electric signs at times. Indeed, it is an equilibrium of the game. This suggests that the operator must consider the strategic use of VMS system seriously.

• Journal of Communications and Networks
• /
• v.10 no.3
• /
• pp.268-286
• /
• 2008

In this work, we review the routing models that use game theoretical methodologies. A very common assumption in the analysis and development of networking algorithms is the full cooperation of the participating nodes. Most of the analytical tools are based on this assumption. However, the reality may differ considerably. The existence of multiple domains belonging to different authorities or even the selfishness of the nodes themselves could result in a performance that significantly deviates from the expected one. Even though it is known to be extensively used in the fields of economics and biology, game theory has attracted the interest of researchers in the field of communication networking as well. Nowadays, game theory is used for the analysis and modeling of protocols in several layers, routing included. This review aims at providing an elucidation of the terminology and principles behind game theory and the most popular and recent routing models. The examined networks are both the traditional networks where latency is of paramount importance and the emerging ad hoc and sensor networks, where energy is the main concern.