• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.51 no.4
• /
• pp.202-208
• /
• 2002

In a dynamic game where the players move in a periodical sequence, each player observes the strategy of the others. So the players who move later in a game get to know the moves of others having made before them. Those who move earlier must take this into account in devising their optimal strategy. In the Poolco model, the bidding game is executed periodically. The player participating in the bidding game accumulates the information of its own and others'strategies, and payoffs through the repeated bidding process. Thereby, the players in this game would be able to map out how get the maximum profit, and get closer to the optimal strategy. This paper presents a mathematical modeling for a player to determine his or her optimal strategy at period T, based on the information acquired from the previous rounds for the periods, T-1, T-2, and so on. The proposed modeling is demonstrated with a dynamic fame theory.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.11
• /
• pp.5631-5652
• /
• 2019

The existing defense strategy selection methods based on game theory basically select the optimal defense strategy in the form of mixed strategy. However, it is hard for network managers to understand and implement the defense strategy in this way. To address this problem, we constructed the incomplete information stochastic game model for the dynamic analysis to predict multi-stage attack-defense process by combining Bayesian game theory and the Markov decision-making method. In addition, the payoffs are quantified from the impact value of attack-defense actions. Based on previous statements, we designed an optimal defense strategy selection method. The optimal defense strategy is selected, which regards defense effectiveness as the criterion. The proposed method is feasibly verified via a representative experiment. Compared to the classical strategy selection methods based on the game theory, the proposed method can select the optimal strategy of the multi-stage attack-defense process in the form of pure strategy, which has been proved more operable than the compared ones.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1998.06a
• /
• pp.674-679
• /
• 1998

In this paepr, we proposed a new way to make a pre-pruned searching tree for GO game moves from macroscopic strategy described in linguistic expression. The strategy was a consequence of macroscopic recognition of GO game situations. The definitions of fuzzy macroscopic strategy, fuzzy tactics and tactical sequences using fuzzy set are shown and its family, so called "multi level fuzzy set". Some examples are also shown.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.52 no.11
• /
• pp.668-674
• /
• 2003

The electric marketplace is in the midst of major changes designed to promote competition. No longer vertically integrated with guaranteed customers and suppliers, electric generators and distributors will have to compete to sell and buy electricity. Unit commitment (UC) in such a competitive environment is not the same as the traditional one anymore. The objective of UC is not to minimize production cost as before but to find the solution that produces a maximum profit for a generation firm. This paper presents a hi-level formulation that decomposes the UC game into a generation-decision game (first level game) and a state(on/off)-decision game (second level game). Derivation that the first-level game has a pure Cournot Nash equilibrium(NE) helps to solve the second-level game. In case of having a mixed NE in the second-level game, this paper chooses a pure strategy having maximum probability in the mixed strategy in order to obviate the probabilistic on/off state which may be infeasible. Simulation results shows that proposed method gives the adequate UC solutions corresponding to a NE.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.11 no.3
• /
• pp.231-240
• /
• 2015

This study empirically analyzed the relationship between the franchise pc game rooms selection behavior and revisit, recommendations. Select Properties from the franchise pc game rooms store is ease of access, computer specifications, pleasant environment, brand power and pricing strategy. Korean franchise industry is in spite of the short history of just over 30 years growing very fast. Especially pc game rooms store is 14,782 in 2012 years, pc game rooms store is operated by franchise form 10.6%, 87.9% operated by private, co-operation was confirmed at 1.5%. Conclusions are as follows. First, factors that significantly affect the degree of revisit has been identified as computer specifications, pleasant environment, brand power. Second, the recommendation is an important factor of the computer specifications, brand power, pricing strategy. Finally, franchise pc game rooms successful strategy has excellent computer's specifications, it needs a promotion strategy to attract pc game tournaments to be notified of brand power. We can also see that running is an important factor in a pleasant environment and a flexible pricing strategy.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.59.2-59
• /
• 2001

This paper presents an evolvable cooperation strategy based on a genetic programming for the interactive robot soccer game. The interactive robot soccer game has been developed to allow a person to join in the game dynamically and to reinforce entertainment characteristics. In this game, a cooperation strategy between humans and autonomous robots is very important in order to make the game more enjoyable. First of all, necessary action sets for the cooperation strategy and its strategy structure are presented. In the first stage, a blocking action that an autonomous robot cut off an enemy robot from disturbing the way of the human controlled robot has been considered. The success probability of the blocking action has beer obtained in ...

• Proceedings of the Korea Database Society Conference
• /
• 2008.05a
• /
• pp.467-476
• /
• 2008

The success of Nintendo's Wii has changed the paradigm of console game. Existing games and consoles set up the game-playing system of complicated commands, narratives, and significantly advanced the degree of difficulty by the device's excellent capacity and the superiority of graphic in order to draw so called "Game Manias", while Nintendo established the easy game-playing system for not only game manias but women and elderly people. Such an innovation has carried out the most important role for Nintendo to dominate the market all over the world by 47.4% market share of consoles. In addition, it provided the users with unique interaction and emotional experience. In this study, we analyze the case above in terms of product design strategy, particularly emotional design strategy between Nintendo & Sony.

• Journal of Korea Game Society
• /
• v.2 no.1
• /
• pp.69-76
• /
• 2002

This paper describes basic producing techniques of fighting game, collision detection between fighters, fighting skill, thinking routine and processing method of enemy characters, and algorithm structure of fighting game. Also, I studied as for algorithm of the template and strategy methods of design pattern class applied to a fighting game.

• Journal of Korea Game Society
• /
• v.14 no.6
• /
• pp.39-48
• /
• 2014

Go is an extremely complex strategy board game despite its simple rules. By using MCTS, the computer Go programs with handicap game have been defeated human Go professionals. MCTS is based on the winning rate estimated by MC simulation rather than strategy concept. Meanwhile Genetic algorithm equipped with an adequate fitness function can find out the best solutions in the game. The game of Tic-Tac-Toe, also known as Naughts and Crosses, is one of the most popular games. We tried to find out the best strategy in the game of Tic-Tac-Toe. The experimental result showed that Genetic algorithm enables to find efficient strategies and can be applied to other board games such as Go and chess.

• Journal of Korea Game Society
• /
• v.10 no.3
• /
• pp.83-92
• /
• 2010

The command that game users give should be reflected to the game immediately and should be transferred to several objects at once. Also, all game users who participate in game should keep the same progress situation in Real-Time Strategy game. But it takes a certain amount of time to get the command pass to other users, and it is important issue that many commands are synchronized in a short amount of time on server of RTS game. Therefore we propose a scheme for an efficient synchronization based on event locking method on RTS game in this paper. We design and implement the gaming server applying to our proposed scheme. Also, we show efficiency of our proposed scheme by performance analysis in this paper.