• 한국HCI학회:학술대회논문집
• /
• 2008.02b
• /
• pp.576-581
• /
• 2008

For the improved game industry, this society was permitted as an incorporated association for spearhead of game society from Ministry of Culture & Tourism on February 14, 2001 with a sense of duty and a strong will toward a powerful game country. This society has objectives of academic research and distributions on creations of game contents, technologies of game producing and developments of game cultures. We will develop the game culture and industry through an industry-academic cooperations by each expert field, and spread out academic activities for cultivation of policy, technology, education, etc of the game industry in the future.

• Digital Contents
• /
• no.7 s.110
• /
• pp.37-37
• /
• 2002

1998년 출시된 스타크래프트는 경제, 문화 등 사회전반에 걸쳐 각종 파급효과를 거뒀으며, RPG라는 장르로 많은 인기를 모았던 디아블로는 전 세계 약 500만장의 판매고를 올리며 현재까지도 액션 RPG의 기준으로 자리잡고 있다. 워크래프트3는 2002년 최고의 기대작으로 오크, 휴먼, 언데드, 나이트 앨프 등 4개의 개성있는 종족이 미지의 아제로스 대륙에서 펼치는 끝없는 전쟁을 다룬 전략 시뮬레이션 게임이다.

• Journal of Korea Game Society
• /
• v.10 no.3
• /
• pp.15-24
• /
• 2010

Web-based MMORTS has features that distinguish it from traditional client-based games. First, Web-based MMORTS is represented by the combination of graphics and texts. Second, there is parallax agent which has a player and a base town character. This paper written for the purpose of analyzing the storytelling of web-based MMORTS, and from Innogames selected as the subjects of the study. In view of the results so far achieved, the fact, when the player logs in web-based MMORTS, the player takes the experience after some time which had taken by the AI character instead of the player logged out and User Generated Storytelling created from this process, become known. This paper has a meaning for Web-based virtual world which can juxtaposition with routine tasks and can be linked with other platforms.

• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10c
• /
• pp.48-50
• /
• 1998

반복적 죄수의 딜레마(Iterated Prisoner's Dilemma, IPD)게임은 사회적, 경제적, 그리고 생물학적 시스템에서 협동의 진화를 연구하기 위한 대상으로 사용되어져 왔다. 이제까지 이기적이며 합리적인 개체들 사이에서의 협동의 진화에 대한 완전한 이해를 위하여 게임자의 수와 협동의 관계, 기계학습의 일환으로서의 전략학습, 그리고 이득함수가 협동에 미치는 영향 등에 관한 많은 연구가 이루어져 왔다. 이 논문에서는 실험을 통해 이득함수에 따른 협동연합의 크기와 지역화가 NIPD(N-player IPD)게임에서 협동의 진화에 미치는 영향에 대해 밝히고자 한다. 시뮬레이션 결과 이득함수와 협동연합의 크기에 대한 실험에서는 협동개체에 대한 이득함수의 기울기가 배반개체에 대한 이득함수의 기울기보다 급하거나 최소 연합의 크기가 작을수록 협동연합의 정도가 높게 나타남을 알 수 있었다. 그리고 지역화 실험에서는 상호작용하는 이웃의 크기가 작을수록 협동연합의 크기가 크게 진화됨을 알 수 있었다.

• Journal of Korea Game Society
• /
• v.9 no.5
• /
• pp.117-125
• /
• 2009

In real-time strategy simulation (RTS) game each team is composed of agents and executes strategies to win other team. Strategy needs agents' cooperation in each team. This needs multi-agent system (MAS). Centralized decision making, one of decision making in MAS, selects actions not to agents but to team by a coordinated agent. Decentralized decision making costs high because each agent communicates with each other. In this paper we propose a system which controls agents by grouping and allocates roles through negotiation by a coordinated agent. Then, when one of allocated actions is not executed or failed, a coordinated agent allocates its role to another agent. We make experiments in starcraft, famous RTS game. When a proposed method is applied, the performance of attack and defense is increased. The improved agents' team wins eight times per ten games.

• Proceedings of the Korea Society for Simulation Conference
• /
• 1998.03a
• /
• pp.32-32
• /
• 1998

과거의 전쟁은 재래식 무기에 의존한 화력전이었지만, 미래의 전쟁은 C4I와 전략무기의 중요성이 강조되는 정보전으로 변화될 것으로 예상된다. 현재 활용중인 대부분의 워게임 모형들은 대형전산기 위주로 개발되었으므로, 정보전 개념을 모의하기 위해서는 모형의 논리구조 개선과 영상전시기능 보완이 요구되고 있다. 하지만 기존 워게임 모형 개선은 최신개발 모형과의 상호 호환성 및 재사용성 측면에서 많은 제약이 따르게 된다. 따라서 세계 각국은 국방모의체계(DM&S)의 발전을 위한 자체적인 종합계획을 수립하여 미래전장에서 적용될 첨단무기체계 효과 분석을 위한 모형을 개발하고 있다. 한국국방연구원은 미래전쟁 양상을 신속하게 분석할 수 있으며, PC에서 운용이 가능한 간이분석모형의 개발을 추진하고 있다. 본고에서는 미래전 분석을 위한 간이모형 개발에 적용된 방법론과 운용논리, 모형검증 기법 등을 소개하고 향후 개발모형의 활용방안을 제시하고자 한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.2B
• /
• pp.269-278
• /
• 2010

In the clustering protocol, lifetime of the cluster members radically decrease because frequency interference between clusters make every cluster member consume a lot of energy to maintain or increase its transmission rate. In this paper, we analyze the frequency interference among the clusters with the game theory which deals with resource bargaining problems between players, and present a rational power allocation strategy. Both the cases that each cluster tries to selfishly occupy and cooperatively share the resource are analyzed in terms of non-cooperative and cooperative games. In simulation, we compare the cooperative game with non-cooperative game in terms of the node lifetime.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.14 no.3
• /
• pp.253-261
• /
• 2004

Game theory is mathematical analysis developed to study involved in making decisions. In 1928, Von Neumann proved that every two-person, zero-sum game with finitely many pure strategies for each player is deterministic. As well, 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. Not the rationality but through the process of Darwinian selection, a population of agents can evolve to an Evolutionary Stable Strategy (ESS) introduced by Maynard Smith. Keeping pace with these game theoretical studies, the first computer simulation of co-evolution was tried out by Hillis in 1991. Moreover, Kauffman proposed NK model to analyze co-evolutionary dynamics between different species. He showed how co-evolutionary phenomenon reaches static states and that these states are Nash equilibrium or ESS introduced in game theory. Since the studies about co-evolutionary phenomenon were started, however many other researchers have developed co-evolutionary algorithms, in this paper we propose Game theory based Co-Evolutionary Algorithm (GCEA) and confirm that this algorithm can be a solution of evolutionary problems by searching the ESS.To evaluate newly designed GCEA approach, we solve several test Multi-objective Optimization Problems (MOPs). From the results of these evaluations, we confirm that evolutionary game can be embodied by co-evolutionary algorithm and analyze optimization performance of GCEA by comparing experimental results using GCEA with the results using other evolutionary optimization algorithms.

• The Journal of Bigdata
• /
• v.4 no.2
• /
• pp.73-83
• /
• 2019

Since the emergence of the fourth industrial revolution, data analysis is being conducted in various fields. Distributed data processing has already become essential for the fast processing of large amounts of data. However, in the defense sector, simulation used cannot fully utilize the unstructured data which are prevailing at real environments. In this study, we propose a distributed data processing platform that can be applied to battalion level simulation models to provide visualized data for command decisions during training. 500,000 data points of strategic game were analyzed. Considering the winning factors in the data, variance processing was conducted to analyze the data for the top 10% teams. With the increase in the number of nodes, the model becomes scalable.

• Journal of Korea Game Society
• /
• v.4 no.3
• /
• pp.55-64
• /
• 2004

A dynamic graph is suitable for representing and managing dynamic changable obstacles or terrain information in 2D/3D games such as RPG and Strategy Simulation Games. We propose a dynamic hierarchical graph model with fixed level to perform a quick A* path finding. We divide a graph into subgraphs by using space classification and space model, and construct a hierarchical graph. And then we perform a quick path fading on the graph by using our dynamic graph operators. With our experiments we show that this graph model has efficient properties for finding path in a dynamic game environment.