• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.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.

• Journal of Korea Game Society
• /
• v.15 no.4
• /
• pp.69-78
• /
• 2015

As the online game industry has been growing rapidly, more and more malicious activities to gain economic benefits have been reported as well. Game bot is one of the biggest problems in the online game industry. So we proposed a bot detection method based on the ERG theory of motivation for the first time. Most of the previous studies focused on behavior-based detection by monitoring patterns of the specific actions. In this paper, we applied the motivation theory to analyze user behaviors on a real game dataset. The result shows that normal users in the game followed the ERG theory of motivation in the same way as it works in real world. But in the case of game bots, the theory could not be applied because the game bot has specific reasons, unlike normal game users. We applied the ERG theory to users to distinguish game bot users from normal users. We detected the game bot with high accuracy of 99.78% by applying the theory.

• The KIPS Transactions:PartC
• /
• v.18C no.2
• /
• pp.97-102
• /
• 2011

Since the game theory provides a theoretical ground to distribute a shared resource between demanding users in a fair and efficient manner, it has been used for the bandwidth allocation problem in a network. However, the bandwidth allocation schemes with different game theory assign different amount of bandwidth in the same operational environments. However, only the mathematical framework is adopted when a bandwidth allocation scheme is devised without quantitatively comparing the results when they applied to the bandwidth allocation problem. Thus, in this paper, we compare the characteristics of the bandwidth allocation schemes using the bankrupt game theory and the bargaining game theory when they applied to the situation where nodes are competing for the bandwidth in a network. Based on the numerical results, we suggest the future research direction.

• Proceedings of the KIEE Conference
• /
• 2007.04a
• /
• 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
• /
• v.2 no.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.

• Journal of the Korean Mathematical Society
• /
• v.42 no.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
• /
• v.13 no.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.

• Journal of Korea Game Society
• /
• v.7 no.2
• /
• pp.91-100
• /
• 2007

The purpose of this study is to develope a criterion for evaluation on game-style courseware by the application of HCI theory. The HCI theory, which deals with principles or methods for developing systems people can use conveniently and pleasantly, has been applied to overall area of program development. And it also has been widely used to evaluate learning programs. However, there have been few studies on a game-style courseware evaluation on the basis of the HCI theory. Thus, it is necessary to apply the HCI theory to studies on the game-style courseware evaluation. This paper shows that evaluation criteria are developed on three viewpoint bases : usefulness, usability, and affect which are as elements in HCI. The evaluation criteria developed in this paper can be applied to a basis for evaluation on game-style coursewares.

• Journal of Information Technology Services
• /
• v.11 no.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)
• /
• v.11 no.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.