• 한국멀티미디어학회논문지
• /
• 제10권9호
• /
• pp.1185-1196
• /
• 2007

게임산업의 경쟁력을 강화하고 부가가치를 높이기 위하여 수요자가 요구하는 높은 만족도를 갖는 게임을 개발할 수 있도록 만족도를 정량적으로 평가하여 만족도 기준을 제시할 수 있는 연구 및 근거가 필요하다. 특히 만족도 요소들의 점수화와 모집단 분포의 추정은 중요한 과제로서 이를 통하여 어떤 게임이 다른 게임에 비하여 만족도가 높은지 낮은지를 알 수 있으며 만족도를 제고시키기 위하여 보완해야 할 요소들과 기술력을 예측할 수 있다. 본 연구에서는 게임 만족도 요소들의 접수분포를 정규화 하는 방법을 제 안하고 시뮬레이션을 통한 모수적 밀도함수 추정방법을 이용하여 모집단 분포를 추정하였다.

• Journal of Information Processing Systems
• /
• 제17권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
• /
• 제36권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.

• 한국멀티미디어학회논문지
• /
• 제14권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
• /
• 제31권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.

• 한국컴퓨터산업학회논문지
• /
• 제2권6호
• /
• pp.759-774
• /
• 2001

본 연구에서는 인터넷 게임을 통한 학습의 이론적 면모를 살펴보고 인터넷 게임과 관련하여 여러 장르(어드벤처 게임, 시뮬레이션 게임을 중심으로)의 게임의 교육적 특성과 네트워크 요소에 기인한 상호 작용적 특성을 협동학습을 중심으로 살펴보았다. 또한 각종 인터넷 게임을 통한 교육모델을 제시해 보았는데, 이는 게임의 교육적 특징별로 각각의 단계에 맞춰 네트워크 게임을 통한 학습을 실현 할 수 있는 구체적 모델이라 할 수 있다.

• 디지털산업정보학회논문지
• /
• 제4권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.

• 한국게임학회 논문지
• /
• 제5권4호
• /
• pp.23-32
• /
• 2005

게임 속의 인공 지능을 높일 수 있는 지형 분석의 방안에 대하여 소개한다. 지형 분석의 방법을 온라인 게임 서버의 AI 방식에 사용함에 의해서 정해진 패턴이 아닌 좀 더 현실적인 AI의 수행이 가능하다. 본 논문에서는 지형 분석을 통하여 NPC들의 행동패턴을 다양화 할 수 있는 방안을 제시하고 이를 구현하기 위한 온라인 게임서버에서의 NPC 서버의 구조를 설계하고 이를 토대로 적응형 AI구현을 위한 NPC 서버의 실험 테스트을 통하여 실제로 적용 할 수 있는 방안을 제시 한다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권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)
• /
• 제12권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.