• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권11호
• /
• pp.3674-3710
• /
• 2014

In this tutorial, we integrate the concept of cognitive radio technology into game theory and supermarket game theory to address the problem of resource allocation in multiuser multicarrier cognitive radio networks. In addition, multiuser multicarrier transmission technique is chosen as a candidate to study the resource allocation problem via game and supermarket game theory. This tutorial also includes various definitions, scenarios and examples related to (i) game theory (including both non-cooperative and cooperative games), (ii) supermarket game theory (including pricing, auction theory and oligopoly markets), and (iii) resource allocation in multicarrier techniques. Thus, interested readers can better understand the main tools that allow them to model the resource allocation problem in multicarrier networks via game and supermarket game theory. In this tutorial article, we first review the most fundamental concepts and architectures of CRNs and subsequently introduce the concepts of game theory, supermarket game theory and common solution to game models such as the Nash equilibrium and the Nash bargaining solution. Finally, a list of related studies is highlighted and compared in this tutorial.

• 한국게임학회 논문지
• /
• 제15권4호
• /
• pp.69-78
• /
• 2015

온라인 게임 산업이 급격히 성장함에 따라 경제적 이득을 목적으로 한 악성 행위가 증가되고 있다. 본 논문에서는 온라인 게임 내 악성 행위 중 높은 비중을 차지하는 게임 봇 탐지를 위한 모티베이션 기반 ERG 이론을 적용한 탐지 방법을 제안한다. 기존에 연구된 행위 기반 탐지 기법들이 특정 행위들을 특성치로 선정하여 분석하였다면, 본 논문에서는 모티베이션 이론을 적용하여 행위 분석을 수행하였다. 실제 MMORPG의 데이터를 분석하여 본 결과, 온라인 게임 내에서도 정상 사용자는 실제 세계와 마찬가지로 모티베이션과 관련된 ERG 이론이 잘 적용되는 것을 확인하였다. 반면에, 게임 봇은 정상 사용자와 다르게 특정 목적을 위한 행동 패턴이 나타나기 때문에 모티베이션 이론을 적용하여 탐지할 경우 정상 사용자와는 다른 행동 패턴을 보이는 것을 발견하였다. 이를 통해 ERG 이론을 적용한 봇 탐지 방법을 국내 7위의 규모의 게임에 적용하여 봇 제재 리스트와 교차 분석한 결과, 99.74% 의 정확도로 정상 사용자와 봇을 분류할 수 있었다.

• 정보처리학회논문지C
• /
• 제18C권2호
• /
• pp.97-102
• /
• 2011

게임 이론은 다수의 사용자에게 공유 자원을 효율적이고 공정하게 분배할 수 있는 이론적 기반을 제공하므로 이를 대역폭 할당에 이용하려는 연구가 활발히 진행되어 왔다. 그러나 게임 이론에 의한 대역폭 할당 기법들은 적용한 게임 기법들에 따라 동일 조건에서 할당하는 대역폭이 달라진다. 그러나 현재까지 네트워크 분야에서는 게임 이론의 수학적 근거만을 차용하고 있으며 이들이 대역폭 할당 문제에 적용될 때 각 기법 별 특성에 대한 정량적 비교 분석은 이루어지고 있지 않다. 이에 따라 본 논문에서는 다수의 노드가 대역폭을 공유하는 경우 파산(Bankruptcy) 게임 이론과 협상(Bargaining) 게임 이론을 이용하여 송신 노드의 입력율에 따른 각 노드 별 대역폭 할당 기법들의 특성을 비교 분석하고 이에 따른 향후 연구 방향을 제시한다.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2007년도 심포지엄 논문집 정보 및 제어부문
• /
• pp.240-242
• /
• 2007

The game theoretic analysis in wireless networks can be classified into the jamming game of the physical layer, the multiple access game of the medium access layer, the forwarder's dilemma and joint packet forwarding game of the network layer, and etc. In this paper, the game theoretic analysis about the multiple access game that selfish nodes exist in the IEEE 802.11 DCF(Distributed Coordination Function) wireless networks is addressed. In this' wireless networks, the modeling of the CSMA/CA protocol based DCF, the utility or payoff function calculation of the game, the system optimization (using optimization theory or convex optimization), and selection of Pareto-optimality and Nash Equilibrium in game strategies are the important elements for analyzing how nodes are operated in the steady state of system. Finally, the main issues about the game theory in the wireless network are introduced.

• 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.

• 대한수학회지
• /
• 제42권4호
• /
• pp.709-721
• /
• 2005

G. Gruenhage gave a characterization of paracompactness of locally compact spaces in terms of game theory ([6]). Starting from that result we give another such characterization using a selective version of that game, and study a selection principle in the class of locally compact spaces and its relationships with game theory and a Ramseyan partition relation. We also consider a selective version of paracompactness.

• International Journal of Internet, Broadcasting and Communication
• /
• 제13권1호
• /
• pp.238-242
• /
• 2021

Game theory has been regarded as a useful theoretical tool for modeling the interactions between distinct entities and thus it has been harnessed in various research field. In particular, research attention has been shown to how to apply game theory to modeling the interactions between malign and benign entities in the field of wireless networks. Although various game theoretic modeling work have been proposed in the field of wireless networks, our proposed work is disparate to the existing work in the sense that we focus on mobile malign node detection problem in static wireless sensor networks. More specifically, we propose a Bayesian game theoretic modeling for mobile malign node detection problem in static wireless sensor networks. In our modeling, we formulate a two-player static Bayesian game with imperfect information such that player 1 is aware of the type of player 2, but player 2 is not aware of the type of player 1. We use four strategies in our static Bayesian game. We obtain Bayesian Nash Equilibria with pure strategies under certain conditions.

• 한국게임학회 논문지
• /
• 제7권2호
• /
• pp.91-100
• /
• 2007

본 연구는 HCI 이론을 적용하여 게임형 학습 프로그램을 평가하기 위한 준거를 개발한다. 사람들이 편리하고 즐겁게 사용하도록 하는 시스템을 개발하는 원리나 방법을 연구하는 학문인 HCI 이론은 다양한 영역의 프로그램 개발에 광범위하게 적용되어 왔다. 그리고 학습 프로그램을 평가하는 데도 널리 활용되어 왔다. 그러나 HCI 이론을 적용한 게임형 코스웨어 평가에 대한 연구는 거의 없다. 따라서, 게임형 코스웨어 평가 연구에서도 HCI 이론 적용이 필요하다. 본 연구는 HCI의 구성요소인 유용성(Usefulness), 사용성(Usability), 감성(Affect)의 관점에서 평가 준거를 개발한다. 본 연구에서 개발한 평가 준거는 게임형 학습 프로그램을 평가하는 기준으로 활용될 수 있을 것이다.

• 한국IT서비스학회지
• /
• 제11권2호
• /
• pp.93-106
• /
• 2012

Recently, a Game Shut-down policy, partially limiting the time for the use of online game service, has been implemented in order to protect the youth from the excessive use of games by limiting their access to games in the late hours, based on the serious side effects of online games on the youth. However, the effectiveness of a Game Shut-down policy becomes a social issue. Thus, this study aims to investigate the alternative policies through the levels of the communications suggested by the theory of excellence, for the successful implementation of the policy. As a result of the study, the government and students, the recipient of those policies, need to strengthen their two-way communication in respect of the Game Shut-down policy, breaking from the existing views on the perception. The problem is that the current government's way of the communication for the Game Shut-down policy is one-way and it is aiming at achieving the objectives only. Thus, the communication in this manner will cause the side effect. 'the opportunistic violation of the system in the future', even if the students seemingly accept the system. Two-way communication will enhance the motivation for the voluntary acceptance of the system and lower the motivation for the opportunistic violation of the system. Thus, the government needs to strengthen two-way communication in the future.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권8호
• /
• pp.4043-4060
• /
• 2017

Network Intrusion Detection (NID), an important topic in the field of information security, can be viewed as a pattern recognition problem. The existing pattern recognition methods can achieve a good performance when the number of training samples is large enough. However, modern network attacks are diverse and constantly updated, and the training samples have much smaller size. Furthermore, to improve the learning ability of SVM, the research of kernel functions mainly focus on the selection, construction and improvement of kernel functions. Nonetheless, in practice, there are no theories to solve the problem of the construction of kernel functions perfectly. In this paper, we effectively integrate the advantages of the radial basis function kernel and the polynomial kernel on the notion of the game theory and propose a novel kernel SVM algorithm with game theory for NID, called GTNID-SVM. The basic idea is to exploit the game theory in NID to get a SVM classifier with better learning ability and generalization performance. To the best of our knowledge, GTNID-SVM is the first algorithm that studies ensemble kernel function with game theory in NID. We conduct empirical studies on the DARPA dataset, and the results demonstrate that the proposed approach is feasible and more effective.