• Journal of Korean Institute of Industrial Engineers
• /
• v.41 no.5
• /
• pp.414-424
• /
• 2015

In this research, we consider a smart grid network of electricity with multiple consumers connected to a monopolistic provider. Each consumer can be informed the real time price changes through the smart meter and updates his consumption schedule to minimize the energy consumption expenditures by which the required power demand should be satisfied under the given real time pricing scheme. This real-time decision making problem has been recently studied through game-theoretic approach. The present paper contributes to the existing literature by incorporating storage appliance into the set of available household appliances which has somewhat distinctive functions compared to other types of appliances and would be regarded to play a significant role in energy consumption scheduling for the future smart grid. We propose a game-theoretic algorithm which could draw the optimal energy consumption scheduling for each household appliances including storage. Results on simulation data showed that the storage contributed to increase the efficiency of energy consumption pattern in the viewpoint of not only individual consumer but also whole system.

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

This article investigates the problem of opportunistic spectrum access in dynamic environment, in which the signal-to-noise ratio (SNR) is time-varying. Different from existing work on continuous feedback, we consider more practical scenarios in which the transmitter receives an Acknowledgment (ACK) if the received SNR is larger than the required threshold, and otherwise a Non-Acknowledgment (NACK). That is, the feedback is discrete. Several applications with different threshold values are also considered in this work. The channel selection problem is formulated as a non-cooperative game, and subsequently it is proved to be a potential game, which has at least one pure strategy Nash equilibrium. Following this, a multi-agent Q-learning algorithm is proposed to converge to Nash equilibria of the game. Furthermore, opportunistic spectrum access with multiple discrete feedbacks is also investigated. Finally, the simulation results verify that the proposed multi-agent Q-learning algorithm is applicable to both situations with binary feedback and multiple discrete feedbacks.

• Journal of Korea Game Society
• /
• v.19 no.3
• /
• pp.5-14
• /
• 2019

The gaming server is based on a distributed server. In order to distribute workloads of gaming servers, distributed gaming servers apply some algorithms which divide each of gaming server's workload into balanced workload among the gaming servers and as a result, efficiently manage response time and fusibility of server requested by the clients. In this paper, we propose a load balancing agent using PPO(Proximal Policy Optimization) which is one of the methods from a greedy algorithm and Policy Gradient which is from Reinforcement Learning. The proposed load balancing agent is compared with the previous researches based on the simulation.

• KIPS Transactions on Computer and Communication Systems
• /
• v.8 no.1
• /
• pp.1-8
• /
• 2019

In this paper, we design a new mobile crowdsourcing control scheme based on the incentive mechanism. By using a novel incentive mechanism, mobile nodes can get the maximum payoff when they report their true private information. As mobile nodes participate in the overlapping coalition formation game, they can effectively invest their resource while getting the higher reward. Simulation results clearly indicate that the proposed scheme has a better performance than the other existing schemes under various mobile crowdsourcing environments.

• Journal of Korea Game Society
• /
• v.14 no.6
• /
• pp.49-58
• /
• 2014

In particle-based fluid simulation, the yield stress is required for the deformation of the viscoelastic material like gel. von Mises's yield condition has been proposed to implement deformation of viscoelastic objects, but did not express the explosion. Furthermore, von Mises's yield condition is hard to approximate. We propose an ideal yield condition for viscoelastic object that reference from Tresca's yield condition. Unlike conventional particle-based simulation approximate the external power by the deformed length of the object, this paper is approximate the external power by area of the object. We check up that explosion was realistic when a viscoelastic object is compressed under the ideal yield condition.

• The KIPS Transactions:PartC
• /
• v.12C no.3 s.99
• /
• pp.369-378
• /
• 2005

War simulation system is a virtual space that my tactical simulation exercise is held. The data used in this system are considered sensitive and needs to be protected. But suity vulnerabilities and possible security loopholes were not considered when designing the war game simulation system. So currently the systemis highly vulnerable against hackers and data leakages. This paper proposed a security system for war game simulation system based on considering the currently vulunerabilities and possible suity leakages. The proposed security system supports security patches. In this paper, we analyze vulunerabilities of the running environment of current system and we design and implement the security system that is consisted of three components : Authentication System, Encryption System and Network Security System. The security patches are safe and there are no negative effects on the system's performance. The patches are proved to be effective and very reliable towards solving the security vulnerabilities.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.15 no.4
• /
• pp.135-143
• /
• 2015

A Multiplayer Online Game(MOG) is a game capable of supporting hundreds or thousands of players and is mostly played using the Internet. P2P(peer-to-peer) architectures for MOGs can potentially achieve high scalability, low cost, and good performance. The basic idea of many P2P-based games is to distribute the game state among peers and along with it processing, network, and storage tasks. In a primary-copy based replication scheme where any update to the object has to be first performed on the primary copy, this means distributing primary copies of objects among peers. Most multiplayer games use a primary-copy model in order to provide strong consistency control over an object. Games consist of various types of actions that have different levels of sensitivity and can be categorized according to their consistency requirements. With the appropriate consistency level of each action type within a game, this paper allows developers to choose the right trade-off between performance and consistency. The performance for P2P game architecture with the primary-copy model is evaluated through simulation experiments and analysis.

• The Journal of the Korea Contents Association
• /
• v.9 no.10
• /
• pp.75-101
• /
• 2009

The purpose of this article is to analyze the needs of middle and elder generation about serious game for the elderly. The results of this study are; (1) elder generation prefers leisure activities such as mountain climbing, yoga, golf, walking and travel, etc., for health, interest, the development for oneself and relieving stress; (2) they don't prefer game activity for leisure, but prefer to use serious game for health, simulation, medical treatment and sports than middle generation; (3) elder generation has various characteristics and needs so that we should consider their demographical variables when we research and develop serious game contents for the elderly.

• Journal of Korea Game Society
• /
• v.14 no.3
• /
• pp.47-54
• /
• 2014

The game of Go is one of the oldest games and originated at least more than 2,500 years ago. In game programming the most successful approach is to use game tree searches using evaluation functions. However it is really difficult to construct feasible evaluation function in computer Go. Monte-Carlo Tree Search(MCTS) has created strong computer Go programs such as MoGo and CrazyStone which defeated human Go professionals played on the $9{\times}9$ board. MCTS is based on the winning rate estimated by Monte-Carlo simulation. Prior to implementing MCTS into computer Go, we tried to measure each winning rate of three positions, center, corner and side, in Tic-Tac-Toe playing as the best first move. The experimental result revealed that the center is the best, a corner the next and a side the last as the best first move.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.5
• /
• pp.2286-2309
• /
• 2016

Overlay networks have been widely deployed upon the Internet by Service Providers (SPs) to provide improved network services. However, the interaction between each overlay and traffic engineering (TE) as well as the interaction among co-existing overlays may occur. In this paper, we adopt both non-cooperative and cooperative game theory to analyze these interactions, which are collectively called hybrid interaction. Firstly, we model a situation of the hybrid interaction as an n+1-player non-cooperative game, in which overlays and TE are of equal status, and prove the existence of Nash equilibrium (NE) for this game. Secondly, we model another situation of the hybrid interaction as a 1-leader-n-follower Stackelberg-Nash game, in which TE is the leader and co-existing overlays are followers, and prove that the cost at Stackelberg-Nash equilibrium (SNE) is at least as good as that at NE for TE. Thirdly, we propose a cooperative coalition mechanism based on Shapley value to overcome the inherent inefficiency of NE and SNE, in which players can improve their performance and form stable coalitions. Finally, we apply distinct genetic algorithms (GA) to calculate the values for NE, SNE and the assigned cost for each player in each coalition, respectively. Analytical results are confirmed by the simulation on complex network topologies.