• IE interfaces
• /
• v.23 no.2
• /
• pp.89-99
• /
• 2010

Containers are commonly used as an effective and relatively inexpensive method for transporting goods. Unfortunately, there are often imbalances between the number of import and export containers, and some ports have a surplus of empty containers while others have a deficit. The Empty Container Simulation Game was developed to address these problems. The game is a computer role playing simulation that simulates the distribution of empty containers in order to solve empty container imbalances among ports. An optimal solution is obtained by the computer using linear programming (LP). Upon completion of the game, a player's game results are displayed along with the LP solution. The game interface was designed to provide easy access and operation. This game will serve to provide an easy understanding and planning for empty container management.

• The Mathematical Education
• /
• v.43 no.1
• /
• pp.87-96
• /
• 2004

For finding the optimal strategy in Blackout game which was introduced in the homepage of popular mono "Beautiful mind", we develope a mathematical proof and an algorithm with a software. We only use the concept of basis and knowledge of basic linear algebra. This process can be extended to the fullsize Go table problem and shows why we have to study mathematics at the college level.

• Journal of Korea Game Society
• /
• v.3 no.1
• /
• pp.37-48
• /
• 2003

Although the user needs for computer game have been complicated and fragmented, new game development of Korean computer game developers are carried out from the developer's perspective. In the light of this limitation. This study introduces conjoint that designs an optimal new product for game users. We applied the conjoint analysis to Koran game market and found several important issues regarding Koran game users. Our results show that, regardless of game types, Korean game useis' preference mainly center on "variety of game."

• Journal of Korea Game Society
• /
• v.17 no.6
• /
• pp.129-138
• /
• 2017

In football simulation games, it is very important for the interest of the game to make the stats of the football players close to reality. As the management concept is introduced to the sports simulation game, when the user plays the game for a long time, the existing player character retires. Therefore, the game creates the environment of the game by creating a new player in the game. In this study, we propose a method to create a new player character by using genetic algorithm to have the optimal ability similar to existing players. We compare and evaluate the player character with the existing random generation method, the correction random method and the proposed algorithm, and verify the validity of the proposed method.

• 한국경영정보학회:학술대회논문집
• /
• 2007.06a
• /
• pp.661-666
• /
• 2007

MMORPG, massively multi-players in online role-playing game, is the most popular genre in online games. Because large number of players interacts with each other, virtual worlds in MMORPG are alike communities of real worlds. Moreover, players in virtual worlds trade game items with real money. This paper is to find impacts of real-money trading into real worlds, and game operators, by using two-period model between players of the game and the game operator. It was found that real-money trading benefits game operators, and there exists optimal supply of game items to maximize the profit of game operator. Moreover we found that the income disparity in real worlds could be decreased when real-money trading is allowed To support the analytical model, we used an empirical analysis using real-money trading data, and find the relationship among play time of MMORPG, transaction volume of real-money trading, and price of game items. In empirical analysis, it was found that real-money trading benefits game operators. Moreover, it was found that play time and price have positive relationship.

• Journal of Korea Port Economic Association
• /
• v.29 no.4
• /
• pp.73-95
• /
• 2013

This paper analyzes a competitive shipping market in East Asia in order to explore how container carriers make decisions on ship size, number of ships, service frequency, and service route. A sequential-move game based on non-cooperative game theory is applied to establish the models for the decision-makings involving the transportation volumes, freight rates, costs, and market shares of the service routes from Shanghai or Hong Kong to the ports in Busan, Gwangyang, and Incheon. According to the sub-game perfect Nash equilibrium solutions proposed by these models, carriers' decisions in such a competitive environment vary depending on sailing distance, transport demand, and freight rates. Therefore, carriers are recommended to reflect the optimal equilibrium solutions and a variety of decision factors when formulating strategies for transportation networks and operating fleets. Furthermore, ports should establish management strategies for these factors to provide optimal equilibrium solutions for carriers' transportation networks.

• 제어로봇시스템학회:학술대회논문집
• /
• 1998.10a
• /
• pp.379-379
• /
• 1998

The report presents an approach to constructing or control algorithms for finite dimensional dynamical systems under the deficit of information about dynamical disturbances. The approach is based on the constructions of the extremal shift strategy of the differential game theory.

• Bulletin of the Korean Mathematical Society
• /
• v.57 no.1
• /
• pp.127-131
• /
• 2020

We discuss two unrelated topics regarding Cops and Robbers, a well-known pursuit-evasion game played on a simple graph. First, we address a recent question of Breen et al. and prove the PSPACE-completeness of the cop throttling number, that is, the minimal possible sum of the number k of cops and the number capt(k) of moves that the robber can survive against k cops under the optimal play of both sides. Secondly, we revisit a teleporting version of the game due to Wagner; we disprove one of his conjectures and suggest a new related research problem.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.51 no.12
• /
• pp.597-602
• /
• 2002

The restructuring of power industry is still going on all over the world for last several decades. Many kinds of restructuring model have been studied, proposed, and applied. Among those models, power pool is more popular than other. This paper assumes the power pool market structure having competitive generation sector, and a new method is presented to build a bidding strategy in that market. The utilities participating in the market have the perfect information of their cost and price functions, but they don't know which strategy to be chosen by others. To define one's strategy as a vector, we make utility's cost/price functions into discrete step functions. An utility knows only his own strategy, so he estimates the other's cost/price functions into discrete step functions. An utility knows only his own strategy, so he estimates the other's strategy using Nash equilibrium or stochastic methods. And he also has to forecast the system demand. According to this forecasting result, his payoffs can be changed. Considering these all conditions, we formulate a bidding game problem and apply noncooperative game theory to that problem for the optimal strategy or solution. Some restrictive assumption are added for simplification of solving process. A numerical example is given in Case Study to show essential features and concrete results of this approach.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.12
• /
• pp.5759-5779
• /
• 2017

As the main means to cope with the stubborn problem of drunk driving, the inspection of drunk driving has already been paid more attention and thus reinforced. In this paper, we model this scenario as a Stackelberg game, where the police department (called defender) allocates resources dynamically in terms of the traffic situation on the traffic network to arrest drink drivers and drivers who drink (called attacker), whether choosing drunk driving or designated driving service, expect to minimize their cost for given travel routes. However, with the number of resources are limited, our goal is to calculate the optimal resource allocation strategy for the defender. Therefore, first, we provide an effective approach (named OISDD) to fulfill our goal, i.e., generate the optimal strategy to inspect drunk driving. Second, we apply OISDD to directed graphs (which are abstracted from Dalian traffic network) to analyze and test its correctness and rationality. The experimental results show that OISDD is feasible and efficient.