• International Journal of Control, Automation, and Systems
• /
• 제2권4호
• /
• pp.463-474
• /
• 2004

Game theory is a method of mathematical analysis developed to study the decision making process. In 1928, Von Neumann mathematically proved that every two-person, zero-sum game with many pure finite strategies for each player is deterministic. In the early 50's, Nash presented another concept as the basis for a generalization of Von Neumann's theorem. Another central achievement of game theory is the introduction of evolutionary game theory, by which agents can play optimal strategies in the absence of rationality. Through the process of Darwinian selection, a population of agents can evolve to an Evolutionary Stable Strategy (ESS) as introduced by Maynard Smith in 1982. Keeping pace with these game theoretical studies, the first computer simulation of coevolution was tried out by Hillis. Moreover, Kauffman proposed the NK model to analyze coevolutionary dynamics between different species. He showed how coevolutionary phenomenon reaches static states and that these states are either Nash equilibrium or ESS in game theory. Since studies concerning coevolutionary phenomenon were initiated, there have been numerous other researchers who have developed coevolutionary algorithms. In this paper we propose a new coevolutionary algorithm named Game theory based Coevolutionary Algorithm (GCEA) and we confirm that this algorithm can be a solution of evolutionary problems by searching the ESS. To evaluate this newly designed approach, we solve several test Multiobjective Optimization Problems (MOPs). From the results of these evaluations, we confirm that evolutionary game can be embodied by the coevolutionary algorithm and analyze the optimization performance of our algorithm by comparing the performance of our algorithm with that of other evolutionary optimization algorithms.

• 한국게임학회 논문지
• /
• 제9권2호
• /
• pp.41-50
• /
• 2009

통합미디어 환경의 조성과 함께 등장한 '컨버전스(convergence)' 패러다임은 디지털스토리텔링 분야에도 영향을 미쳐 '트랜스미디어 스토리텔링'이라는 새로운 형식이 점차 그 영역을 넓혀가고 있다. 본 연구는 게임 장르에서 트랜스미디어 스토리텔링을 차용한 대체현실게임(ARG)에 주목한다. 본 논문은 기존 게임 형식과 비교를 통해 ARG의 개념을 밝히고, 시뮬라시옹 이론에 근거해 가상과 현실의 경계를 모호하게 만드는 ARG스토리텔링의 특징을 밝히고 있다. 이는 컨버전스 시대가 요구하는 새로운 스토리텔링 양식을 이해하고 차후 디지털스토리텔링의 발전에 있어 의미 있는 연구가 될 것이다.

• 한국통신학회논문지
• /
• 제35권2B호
• /
• pp.269-278
• /
• 2010

클러스터링 프로토콜의 클러스터 간 주파수 간섭에서 클러스터 멤버는 자신의 전송률을 유지 또는 증가시키기 위해 많은 양의 에너지를 소비하여 노드 수명이 급격히 감소하는 문제가 있다. 이에 서로 다른 주파수를 사용하는 FDM 기반의 자원할당 정책이 요구된다. 본 논문에서는 클러스터 간 주파수 간섭 문제를 해결하기 위해 게임의 참여자간 자원협상문제를 다루는 게임이론을 사용하여 클러스터 간 합리적인 파워 전략을 제시하였다. 특히 각 클러스터가 이기적으로 주파수 자원을 점유하려는 경우를 가정한 비협조게임과 협상을 통해 주파수를 나누어 사용하는 협조게임의 관점에서 각각 분석하였다. 또한 시뮬레이션을 사용하여 협조게임과 비협조게임에서의 노드의 수명시간을 비교하였다.

• 산업경영시스템학회지
• /
• 제42권4호
• /
• pp.39-48
• /
• 2019

This paper considers the Prisoner's Dilemma Game in which there exists a dilemma that the best response is that both players are to confess, but doing not confess can give a higher gain to the both players in a social perspective. To resolve such a dilemma in the game, an incentive model to encourage to confess and a penalty model for being imposed when not confessing are introduced, respectively. Then, the conditions are characterized under which incentive or penalty involved in the game's payoffs can make the game rational without a dilemma on both the personal and social perspectives, by taking the payoff values as variables with the incentive and penalty factors. Furthermore, it turns out that the resulting values of incentive and penalty are inversely proportional to each other, and thus, obtaining one of these amounts can provide the other. Simple examples are shown to interpret the theoretical verifications of our models, and randomly generated data based simulation results investigate the tendency of incentive and penalty and the resulting game values for a variety of instances. These results can provide a framework on resolving the dilemma by artificially putting incentive or penalty, although it is careful to apply more generalized real world games.

• 한국게임학회 논문지
• /
• 제13권6호
• /
• pp.43-52
• /
• 2013

경로 탐색은 인공지능의 매우 중요한 요소 중의 하나이며, 여러 분야에서 두루 쓰이는 과정이다. 경로 탐색은 매우 많은 연산이 필요하기 때문에 성능에 매우 중대한 영향을 미친다. 이를 해결하기 위해서 연산량을 줄이는 방식의 연구가 많이 진행되었고, 대표적으로 A* 알고리즘이 있으나 불필요한 연산이 있어 효율성이 떨어진다. 본 논문에서는 A* 알고리즘 중 연산 비용이 높은 노드 탐색 수 등 연산량을 줄이기 위해서 가중치 기반의 선수행 A* 알고리즘을 새롭게 제안한다. 제안한 알고리즘의 효율성을 측정하기 위해 시뮬레이션을 구현하였으며, 실험 결과 가중치를 이용하는 방법이 일반적인 방법보다 약 1~2배 높은 효율을 보였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권10호
• /
• pp.3789-3809
• /
• 2015

In this paper, we deal with the problem of M2M gateways' network selection for different types of M2M traffic in heterogeneous wireless networks. Based on the difference in traffic's quality of service (QoS) requirements, the M2M traffic produced by various applications is mainly classified as two categories: flexible traffic and rigid traffic. Then, game theory is adopted to solve the problem of network-channel selection with the coexistence of flexible and rigid traffic, named as flexible network access (FNA). We prove the formulated discrete game is a potential game. The existence and feasibility of the Nash equilibrium (NE) of the proposed game are also analyzed. Then, an iterative algorithm based on optimal reaction criterion and a distributed algorithm with limited feedback based on learning automata are presented to obtain the NE of the proposed game. In simulations, the proposed iterative algorithm can achieve a near optimal sum utility of whole network with low complexity compared to the exhaustive search. In addition, the simulation results show that our proposed algorithms outperform existing methods in terms of sum utility and load balance.

• 한국게임학회 논문지
• /
• 제5권1호
• /
• pp.41-44
• /
• 2005

본 논문에서는 인터넷환경에서 증가하는 인터넷게임의 바이러스/웜의 공격에 의한 침해사고 발생시 정의되어야 할 정보와 이를 활용한 대량 트래픽을 발생시키는 탐지하는 방안을 제안하였다. 이에 따라 인터넷 게임 사고대응시스템에서의 자동화된 역추적 방안에 대한 설계와 기능에 대한 개념을 제시한다.

• ETRI Journal
• /
• 제40권1호
• /
• pp.61-71
• /
• 2018

In this study, we developed hybrid control algorithms in smart base stations (SBSs) along with devised communication, caching, and computing techniques. In the proposed scheme, SBSs are equipped with computing power and data storage to collectively offload the computation from mobile user equipment and to cache the data from clouds. To combine in a refined manner the communication, caching, and computing algorithms, game theory is adopted to characterize competitive and cooperative interactions. The main contribution of our proposed scheme is to illuminate the ultimate synergy behind a fully integrated approach, while providing excellent adaptability and flexibility to satisfy the different performance requirements. Simulation results demonstrate that the proposed approach can outperform existing schemes by approximately 5% to 15% in terms of bandwidth utilization, access delay, and system throughput.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 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)
• /
• 제9권10호
• /
• pp.4177-4190
• /
• 2015

Current research on Internet of Things (IoT) has primarily addressed the means to enhancing smart resource allocation, automatic network operation, and secure service provisioning. In particular, providing satisfactory security service in IoT systems is indispensable to its mission critical applications. However, limited resources prevent full security coverage at all times. Therefore, these limited resources must be deployed intelligently by considering differences in priorities of targets that require security coverage. In this study, we have developed a new application of Cognitive Radio (CR) technology for IoT systems and provide an appropriate security solution that will enable IoT to be more affordable and applicable than it is currently. To resolve the security-related resource allocation problem, game theory is a suitable and effective tool. Based on the Blotto game model, we propose a new strategic power allocation scheme to ensure secure CR communications. A simulation shows that our proposed scheme can effectively respond to current system conditions and perform more effectively than other existing schemes in dynamically changeable IoT environments.