• The Transactions of the Korean Institute of Electrical Engineers P
• /
• v.59 no.3
• /
• pp.263-267
• /
• 2010

Although electricity market structures may be different from each country, they have a long-term forward market and a short-term spot market in general. Particularly, a bilateral contract transacted at a long-term forward market fixes the electricity price between a genco and a customer so that the customer can avoid risk due to price-spike in the spot market. The genco also can make an efficient risk-hedging strategy through the bilateral contract. In this paper, we propose a new mechanism for deriving the optimal bilateral contract price using game theory. This mechanism can make the customer reveal his true willingness to purchase so that an adequate bilateral contract price is derived.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.11
• /
• pp.771-778
• /
• 2014

We propose Femto-cell power control scheme in HeNet with Game Theory. The Femto-cell which provide high quality with low power is issued by many benefits, however there is a bunch of interferences when many Femto-cells use overlapped bandwidth with Macro-cell. We defined base station of cellular networks and mobile users as players of Game Theory, and configured interference effect among each other as power utility function. Futhermore, we showed enhanced overall system performance, lower power usage and interference decrease by using optimal power.

• The Journal of the Korea Contents Association
• /
• v.13 no.6
• /
• pp.67-76
• /
• 2013

By integrating of intrinsic motivation theory and flow theory, this study sought to investigate the causal linkage among optimal balance of video game player's perceived skill and challenge, flow experience, intrinsic motivation and video game genre usage. A path analysis showed that the different types of video game usage were directly influenced by players' intrinsic motivations, which were also reinforced by players' flow experiences of enjoyment. However, the path model with a multiple group approach provided no strong evidence for gender differences in the relationships between the variables of interest.

• Journal of Korea Game Society
• /
• v.6 no.3
• /
• pp.3-12
• /
• 2006

Path-finding, one of the traditional Game A.I. problems, becomes an important issue to make games more realistic. Due to the limited resources in the computer system, path-finding systems sometimes produce a simplified and unrealistic path. The most relent researches have been focused on the path-finding avoiding only static obstacles. Various moving obstacles are however deployed in real games, a method avoiding those obstacles and producing a smooth path is necessary. In this paper, navigation mesh is used to represent 3D space and its topological characteristics are used for path-finding. Intellectual repulser and attractor are also used to avoid moving obstacles and to find an optimal path. We have evaluated the path produced by the method proposed in this paper and verified its usability in real game.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.8
• /
• pp.2854-2874
• /
• 2015

This paper presents a game theoretic approach to analyze the public goods (PGs) allocation in peer-to-peer (p2p) networks. In order to reduce the free-riders and promote the cooperation among peers, we propose an incentive mechanism with cooperation-based game theory. In this paper, we regarded the contributed resources by cooperators as public goods (PGs). We also build the PGs allocation in P2P networks to be the optimization problem, and the optimal solution of PGs allocation satisfies the Bowen-Lindahl-Samuelson equilibrium. Firstly, based on the subscriber mechanism, we analyze the feasibility and prove the validity, which can achieve Nash equilibrium. However, this strategy cannot meet to Bowen-Lindahl-Samuelson equilibrium as the free-riders do not pay with their private goods for consuming the PGs. Secondly, based on the Walker mechanism, we analyze the feasibility and prove the validity for the same allocation problem, which meets to Bowen-Lindahl-Samuelson equilibrium and achieves Pareto efficiency within cooperative game. Simulations show that the proposed walker mechanism can significantly improve the network performance of throughout, and effectively alleviate free-riding problem in P2P networks.

• Journal of Information Processing Systems
• /
• v.16 no.5
• /
• pp.1145-1157
• /
• 2020

A convolution neural networks (CNNs) has demonstrated outstanding performance compared to other algorithms in the field of face recognition. Regarding the over-fitting problem of CNN, researchers have proposed a residual network to ease the training for recognition accuracy improvement. In this study, a novel face recognition model based on game theory for call-over in the classroom was proposed. In the proposed scheme, an image with multiple faces was used as input, and the residual network identified each face with a confidence score to form a list of student identities. Face tracking of the same identity or low confidence were determined to be the optimisation objective, with the game participants set formed from the student identity list. Game theory optimises the authentication strategy according to the confidence value and identity set to improve recognition accuracy. We observed that there exists an optimal mapping relation between face and identity to avoid multiple faces associated with one identity in the proposed scheme and that the proposed game-based scheme can reduce the error rate, as compared to the existing schemes with deeper neural network.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.10
• /
• pp.3164-3170
• /
• 2000

The use of the A' for the path search of the agent in the game map give the overhead of computing time in real time game processing. The other heuristic search algorithms do not guarantee the optical path. The route table of which the row is defined by current position, goal position, visiting position is presented in this paper. This route table is made in the game development phase and tilized in game playing. The visiting position which is contatined in the optimal path to the goal position from the current position can guarantee the optical path, and this mothod has no overhead on computing time. But the memory space is requred too much. This problem can also be solved using the data compression by skipping the duplicated route table.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.10
• /
• pp.3810-3830
• /
• 2015

In this paper, we investigate the differential game theoretic approach for distributed dynamic cooperative power control in cognitive radio ad hoc networks (CRANETs). First, a payoff function is defined by taking into consideration the tradeoff between the stock of accumulated power interference to the primary networks and the dynamic regulation of the transmit power of secondary users (SUs). Specifically, the payoff function not only reflects the tradeoff between the requirement for quickly finding the stable available spectrum opportunities and the need for better channel conditions, but also reveals the impact of the differentiated types of data traffic on the demand of transmission quality. Then the dynamic power control problem is modeled as a differential game model. Moreover, we convert the differential game model into a dynamic programming problem to obtain a set of optimal strategies of SUs under the condition of the grand coalition. A distributed dynamic cooperative power control algorithm is developed to dynamically adjust the transmit power of SUs under grand coalition. Finally, numerical results are presented to demonstrate the effectiveness of the proposed algorithm for efficient power control in CRANETs.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.10a
• /
• pp.128-130
• /
• 2014

Digital products which is concentrated on function implementation are disregarded from consumers, while those that is interacting with human and user experience based on digital contents get to high royalties and preferences currently. This trend is the same as open market based on game fields. This paper aims to find the feature of proper interaction in board game on open market and derive the key design factor of them. After many literatures were reviewed, we found how to apply interaction factors to games. We expect to develop the game with the optimal user experience to apply the proper interaction to board game in domestic open market in the future.

• Journal of Platform Technology
• /
• v.9 no.1
• /
• pp.3-14
• /
• 2021

Cognitive Radio network (CR) is a promising paradigm that helps the unlicensed user (Secondary User) to analyse the spectrum and coordinate the spectrum access to support the creation of common control channel (CCC). The cooperation of secondary users and broadcasting between them is done through transmitting messages in CCC. In case, if the control channels may get jammed and it may directly degrade the network's performance and under such scenario jammers will devastate the control channels. Hopping sequences may be one of the predominant approaches and it may be used to fight against this problem to confront jammer. The jamming attack can be alleviated using one of the game modelling approach and in this proposed scheme stochastic games has been analysed with more single users to provide the flexible control channels against intrusive attacks by mentioning the states of each player, strategies ,actions and players reward. The proposed work uses a modern player action and better strategic view on game theoretic modelling is stochastic game theory has been taken in to consideration and applied to prevent the jamming attack in CR network. The selection of decision is based on Q learning approach to mitigate the jamming nodes using the optimal MDP decision process