• Journal of Korea Multimedia Society
• /
• v.10 no.9
• /
• pp.1185-1196
• /
• 2007

To enhance competitiveness of game industry and added value, it needs scientific research and bases that suggest satisfaction standard which quantitatively evaluates satisfaction to develop games which have high satisfaction for demanders. Specially, scoring of satisfaction factors and estimation of population distribution are important task. This allows which a game have high or low satisfaction compared to other games. Also we predict improvable factors and technical aspects to promote satisfaction. For it, in this paper we discuss ways to normalization of score distribution for satisfaction factors and estimate its density function using parametric density estimation by simulation.

• Journal of Information Processing Systems
• /
• v.17 no.3
• /
• pp.615-629
• /
• 2021

With the development of mobile edge computing, how to utilize the computing power of edge computing to effectively and efficiently offload data and to compute offloading is of great research value. This paper studies the computation offloading problem of multi-user and multi-server in mobile edge computing. Firstly, in order to minimize system energy consumption, the problem is modeled by considering the joint optimization of the offloading strategy and the wireless and computing resource allocation in a multi-user and multi-server scenario. Additionally, this paper explores the computation offloading scheme to optimize the overall cost. As the centralized optimization method is an NP problem, the game method is used to achieve effective computation offloading in a distributed manner. The decision problem of distributed computation offloading between the mobile equipment is modeled as a multi-user computation offloading game. There is a Nash equilibrium in this game, and it can be achieved by a limited number of iterations. Then, we propose a distributed computation offloading algorithm, which first calculates offloading weights, and then distributedly iterates by the time slot to update the computation offloading decision. Finally, the algorithm is verified by simulation experiments. Simulation results show that our proposed algorithm can achieve the balance by a limited number of iterations. At the same time, the algorithm outperforms several other advanced computation offloading algorithms in terms of the number of users and overall overheads for beneficial decision-making.

• ETRI Journal
• /
• v.36 no.1
• /
• pp.80-88
• /
• 2014

Recently, the idea of the smart grid has been gaining significant attention and has become a hot research topic. The purpose of this paper is to present a novel smart grid management scheme that uses game theory principles. In our proposed scheme, power appliances in the smart grid adaptively form groups according to the non-cooperative hedonic game model. By exploiting multi-appliance diversity, appliances in each group are dynamically scheduled in a cooperative manner. For efficient smart grid management, the proposed coopetition game approach is dynamic and flexible to adaptively respond to current system conditions. The main feature is to maximize the overall system performance while satisfying the requirements of individual appliances. Simulation results indicate that our proposed scheme achieves higher energy efficiency and better system performance than other existing schemes.

• Journal of Korea Multimedia Society
• /
• v.14 no.12
• /
• pp.1549-1558
• /
• 2011

In this paper, we address the problem of bandwidth sharing among multiple primary users and multiple secondary users in a cognitive radio network. In cognitive radio networks, effective spectrum assignment for primary and secondary users is a challenge due to the available broad range of radio frequency spectrum as well as the requisition of harmonious coexistence of both users. To handle this problem, firstly, Bertrand game model is used to analyze a spectrum pricing in which multiple primary users emulate with each other to acquire maximal profit. After that, we employ Cournot game to model the spectrum sharing of secondary users to obtain optimal profit for each user also. Simulation results show that our scheme obtains optimal solution at Nash equilibrium.

• ETRI Journal
• /
• v.31 no.1
• /
• pp.89-91
• /
• 2009

This letter considers the problem of resource sharing among a relay and multiple user nodes in cooperative transmission networks. We formulate this problem as a sellers' market competition and use a noncooperative game to jointly consider the benefits of the relay and the users. We also develop a distributed algorithm to search the Nash equilibrium, the solution of the game. The convergence of the proposed algorithm is analyzed. Simulation results demonstrate that the proposed game can stimulate cooperative diversity among the selfish user nodes and coordinate resource allocation among the user nodes effectively.

• Journal of the Korea Computer Industry Society
• /
• v.2 no.6
• /
• pp.759-774
• /
• 2001

This research has the theoretical faces of education with the internet games are based on the Networking and interactive features be caused by network focused on cooperative education, and presentation about educational game model. It includes educational features about various internet games(adventure game, simulation game). Educational game model is a definite model can realize the learning with internet game according to each stages of educational games are based on the networking.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.4 no.1
• /
• pp.55-63
• /
• 2008

I Previous scrolling-shooter games cannot represent various emotions of characters as a personality and situations, so it can only represent simple and momentary emotions. This paper purpose to develop and applying an artificial emotion which gives emotional responses and actions to character as a personality and situations of a character. So we proposed an artificial emotion that receives emotional stimulus, analyzes what emotion will be generated, controls various emotions by a personality and time, and exports a current emotion. To visualize and to test an artificial emotion, We made a scrolling shooter game which has two characters who have a different personality each other. And we applied an artificial emotion to that game, modified it to be able to change status as emotions. To estimate a satisfaction of a artificial emotion for a scrolling-shooter game, we made up a question to two groups-one has people who likes a scrolling shooter game, the other has people who doesn't.

• Journal of Korea Game Society
• /
• v.5 no.4
• /
• pp.23-32
• /
• 2005

This paper introduces environment analysis way to improve the game AI. The way of environment analysis can provide game user the more reality than generally used AI patterns. This paper suggests the way to make die NPC patterns variously. To realize this theory we designed the organization of NPC server newly, and also accomplished the experiment of NPC server simulation test to get the performance applied in real situation.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.5
• /
• pp.2319-2337
• /
• 2019

In this paper, we study the distributed cooperative caching for Internet content providers in a small cell of heterogeneous network (HetNet). A general framework based on bankruptcy game model is put forth for finding the optimal caching policy. In this framework, the small cell and different content providers are modeled as bankrupt company and players, respectively. By introducing strategic decisions into the bankruptcy game, we propose a caching value assessment algorithm based on analytic hierarchy process in the framework of bankruptcy game theory to optimize the caching strategy and increase cache hit ratio. Our analysis shows that resource utilization can be improved through cooperative sharing while considering content providers' satisfaction. When the cache value is measured by multiple factors, not just popularity, the cache hit rate for user access is also increased. Simulation results show that our approach can improve the cache hit rate while ensuring the fairness of the distribution.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.11
• /
• pp.5203-5217
• /
• 2018

In order to increase the capacity and improve the spectrum efficiency of wireless communication systems, this paper proposes a rate-based two-sided many-to-one matching game algorithm for energy-harvesting small cells with non-orthogonal multiple access (NOMA) in heterogeneous cellular networks (HCN). First, we use a heuristic clustering based channel allocation algorithm to assign channels to small cells and manage the interference. Then, aiming at addressing the user access problem, this issue is modeled as a many-to-one matching game with the rate as its utility. Finally, considering externality in the matching game, we propose an algorithm that involves swap-matchings to find the optimal matching and to prove its stability. Simulation results show that this algorithm outperforms the comparing algorithm in efficiency and rate, in addition to improving the spectrum efficiency.