• 한국품질경영학회:학술대회논문집
• /
• 한국품질경영학회 2006년도 추계 학술대회
• /
• pp.17-22
• /
• 2006

Online game industry is one of the most value added industry and continues to grow rapidly nowadays. This paper classifies the diffusion patterns of online games according to online game genre, estimates coefficients of innovation and imitation using Bass model, extracts the Bass-based adoption life cycle model which reflects the properties of each game, and then analyzes the diffusion pattern of each game. Through the research on the diffusion pattern of online games, if we can identify the characteristics of changing market and consumers in accordance with the product life cycle, we will provide the implications to the marketing strategy, which have to change at every stage of adoption life cycle, not to mention to investment plan.

• 산업공학
• /
• 제25권4호
• /
• pp.431-440
• /
• 2012

Since pooling is a popular scheme in many areas to attain operational excellence, many researchers investigated the performance of pooling systems. However, rare research could be found on pooling with game situation which has much applicability to real world phenomenon. We analyze the performance of noncooperative pooling system with two servers having different sharing capacity. We investigate the sensitivity of the advantage of capacity pooling on the variation of system parameters, including sharing capacity numbers, pooling probability, pooling strategy and traffic intensity. As a result, we suggest an efficient control policy which facilitate the performance of pooling in a game situation.

• 한국수학사학회지
• /
• 제31권3호
• /
• pp.151-166
• /
• 2018

The rule of the game of Chomp is simple and the existence of a winning strategy can easily be proved. However, the existence tells us nothing about what strategies are winning in reality. Like in Chess or Baduk, many researchers studied the winning moves using computer programs, but no general patterns for the winning actions have not been found. In the paper, we aim to construct practical winning strategies based on backward induction. To do this we develop how to analyze Chomp and prove and find the winning strategies of the simple games of Chomp.

• 한국수학교육학회지시리즈E:수학교육논문집
• /
• 제21권4호
• /
• pp.597-612
• /
• 2007

For finding the optimal strategy in Blackout game which was introduced in the homepage of popular movie "Beautiful mind", we have developed and generalized a mathematical proof and an algorithm with a couple of softwares. It did require only the concept of basis and knowledge of basic linear algebra. Mathematical modeling and analysis were given for the square matrix case in(Lee,2004) and we now generalize it to a generalized $m{\times}n$ Blackout game. New proof and algorithm will be given with a visualization.

• 한국경영과학회지
• /
• 제40권2호
• /
• pp.43-61
• /
• 2015

The valuation of patents is very important, since technology competitiveness is crucial for firms to maintain global competitiveness. But, the patent valuation is difficult and challenging because of the uncertainty affecting their returns. Hence, we propose a patent valuation method by incorporating game theory into the real option model, which can not only potentially recognizes the effect of uncertainty on patent value, but also consider investment decision in a competitive market, as a game between firms. With the model, we can consider dynamic strategy involving an option of patent leveraging strategies enabling the firm to switch among compete, cooperate, or wait modes under different demand or competitive advantage condition.

• 산업경영시스템학회지
• /
• 제34권3호
• /
• pp.41-48
• /
• 2011

Recently, the increasing power of distributors has given them the opportunity of introducing private brand (PB) products. Based on the game theory, this study analyzes the decision making of a distributor regarding the optimal pricing and quality strategies for the PB product. By analyzing the game model, it is shown that the pricing mechanism heavily depends not only on the market power of the distributor but on the quality of the PB product. It is also shown that, counter intuitively, as the market power of the distributor increases, the optimal quality of the PB product should be decreased.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1996년도 하계학술대회 논문집 B
• /
• pp.946-948
• /
• 1996

In this paper, we consider a 2-dimensional pursuit-evasion game between a maneuvering target and a coasting missile using qualitative game theory. The optimal evasion algorithm of the target and the optimal guidance algorithm of the missile are determined and the barrier trajectories of this game are obtained through computer simulation. The optimal strategy of the missile and target is to turn toward the final line of sight direction using maximum input and maintain its direction. The capture set of the missile can be obtained by backward integration from the BUP.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권1호
• /
• pp.222-236
• /
• 2019

Wireless content caching in small cell networks has recently been considered as a promising way to alleviate the congestion of the backhaul in emerging heterogenous cellular network. However, how to select files which are cached in SBSs and how to make SBSs work together is an important issue for cooperative cache research for the propose of reducing file download time. In this paper, a Cooperative-Greedy strategy (CGS) among cache-enabled small base stations (SBSs) in small cell network is proposed, in order to minimize the download time of files. This problem is formulated as a Chinese restaurant game.Using this game model, we can configure file caching schemes based on file popularity and the spectrum resources allocated to several adjacent SBSs. Both the existence and uniquencess of a Nash equilibrium are proved. In the theoretical analysis section, SBSs cooperate with each other in order to cache popular files as many as possible near UEs. Simulation results show that the CGS scheme outperforms other schemes in terms of the file-download time.

• 디지털콘텐츠학회 논문지
• /
• 제10권4호
• /
• pp.615-623
• /
• 2009

게임에는 여러 가지의 유닛이 존재한다. 각각의 유닛들 사이에는 가위, 바위, 보와 같은 관계가 존재 한다. 이것을 유닛간의 상성이라고 부른다. 유닛 간의 상성은 다양한 선택의 기회를 보장해줌으로써, 심리전의 즐거움을 보장한다. 유닛간의 상성은 매우 복잡한 관계를 이루기 때문에 대부분의 게임인공지능들이 유닛간의 상성을 무시하고 있다. 본 논문에서는 유닛간의 상성을 수치화하는 방법과, 이를 이용하여 영향력 분포도를 변경하는 방법을 제안한다. 이처럼 변경된 영향력을 바탕으로 인공지능은 보다 전략적인 행동을 하게 된다. 전략적 이동을 통해 변경되는 영향력 분포도의 효용성을 증명하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권12호
• /
• pp.5819-5840
• /
• 2018

Considering the topology of hierarchical tree structure, each cluster in WSNs is faced with various attacks launched by malicious nodes, which include network eavesdropping, channel interference and data tampering. The existing intrusion detection algorithm does not take into consideration the resource constraints of cluster heads and sensor nodes. Due to application requirements, sensor nodes in WSNs are deployed with approximately uncorrelated security weights. In our study, a novel and versatile intrusion detection system (IDS) for the optimal defense strategy is primarily introduced. Given the flexibility that wireless communication provides, it is unreasonable to expect malicious nodes will demonstrate a fixed behavior over time. Instead, malicious nodes can dynamically update the attack strategy in response to the IDS in each game stage. Thus, a multi-stage intrusion detection game (MIDG) based on Bayesian rules is proposed. In order to formulate the solution of MIDG, an in-depth analysis on the Bayesian equilibrium is performed iteratively. Depending on the MIDG theoretical analysis, the optimal behaviors of rational attackers and defenders are derived and calculated accurately. The numerical experimental results validate the effectiveness and robustness of the proposed scheme.