• Proceedings of the KIEE Conference
• /
• 2001.11b
• /
• pp.63-66
• /
• 2001

In the Poolco model, the bidding game is executed periodically. The player participating to the bidding game accumulates the information of others' strategies and payoffs through the repeated process. Thereby, he is able to map out how he gets his maximum profit, and proceed to the optimal strategy region. This paper shows the algorithm for a player to determine his strategy in t period based the information of the game results of t-1, t-2 period. And this algorithm can be formulated by using Dynamic game theory.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.3
• /
• pp.1336-1356
• /
• 2017

The spectrum scarcity crisis has resulted in a shortage of resources for many emerging wireless services, and research on dynamic spectrum management has been used to solve this problem. Game theory can allocate resources to users in an economic way through market competition. In this paper, we propose a bidding game-based spectrum allocation mechanism in cognitive radio network. In our framework, primary networks provide heterogeneous wireless service and different numbers of channels, while secondary users have diverse bandwidth demands for transmission. Considering the features of traffic and QoS demands, we design a weighted interference graph-based grouping algorithm to divide users into several groups and construct the non-interference user-set in the first step. In the second step, we propose the dynamic bidding game-based spectrum allocation strategy; we analyze both buyer's and seller's revenue and determine the best allocation strategy. We also prove that our mechanism can achieve balanced pricing schema in competition. Theoretical and simulation results show that our strategy provides a feasible solution to improve spectrum utilization, can maximize overall utility and guarantee users' individual rationality.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.6 no.6
• /
• pp.943-950
• /
• 2002

Real time strategy game is a computer game genre of Playing with human or computer opponents in real time It differs from turn-type computer games in the game process method. Turn type games, such as chess, allow only one Player to move at a time. Real time strategy games allow two or more Players to move simultaneously. Therefore, in real time strategy computer games, the game components' movement plans must be calculated very quickly in order to not disturb other processes such as gathering resources, building structures, and combat activities. There are many approaches, which can reduce the amount of memory required for calculating path, search space, and reactive time of components. (or units). However, existing path finding algorithms tend to concentrate on achieving optimal Paths that are not as important or crucial in real time strategy game. This Paper introduces Dynamic Heuristic Af(DHA*) algorithm which is capable of reducing search space and reactive time of game units and compares with A* algorithm using static heuristic weighting.

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

In computer games, the level design and balance of characters are the key features for developing interesting games. Level designers make decision to change the parameters and opponent behaviors in order to avoid the player getting extremely frustrated with the improper level. Generally, opponent behavior is defined by static script, this causes the games to have static difficulty level and static environment. Therefore, it is difficult to keep track of the user playing interest, because a player can easily adapt to changeless repetition. In this paper, we propose a dynamic scripting method that able to maintain the level designers' intention where user enjoys the game by adjusting the opponent behavior while playing the game. The player's countermeasure pattern for dynamic level design is modeled using a Gaussian Mixture Model (GMM). The proposed method is applied to a shooting game, and the experimental results maintain the degree of interest intended by the level designer.

• Journal of Korea Game Society
• /
• v.4 no.3
• /
• pp.55-64
• /
• 2004

A dynamic graph is suitable for representing and managing dynamic changable obstacles or terrain information in 2D/3D games such as RPG and Strategy Simulation Games. We propose a dynamic hierarchical graph model with fixed level to perform a quick A* path finding. We divide a graph into subgraphs by using space classification and space model, and construct a hierarchical graph. And then we perform a quick path fading on the graph by using our dynamic graph operators. With our experiments we show that this graph model has efficient properties for finding path in a dynamic game environment.

• Earthquakes and Structures
• /
• v.23 no.6
• /
• pp.535-547
• /
• 2022

Handball sport, as its name postulates, is a team sport which highly physical workout. During a handball play, several ball impacts are applied on the hands resulting vibration in the forearm, upper arm, shoulders and in general in whole body. Hand has important role in the handball's game. So, understanding about the dynamics and some issues that improve the stability of the hand is important in the sport engineering field. Ulna and radius are two parallel bones in lower arm of human hand which their ends are located in elbow and wrist joint. The type of the joint provides the capability of rotation of the lower arm. These two bones with their ends conditions in the joints constructs a 4-link frame. The ulna is slightly thinner than radius. So, understanding about hand kinematics in handball's game is an important thing in the engineering field. So, in the current work with the aid of a multi-physics simulation, dynamic stability analysis of the ulna and radius bones will be presented in detail.

• 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 the Korea Academia-Industrial cooperation Society
• /
• v.10 no.4
• /
• pp.785-794
• /
• 2009

We studied on a technic to improve and implement the virtual environment grid information in the war-game model. The virtual environment data are categorized into ground, sea, and air, and separatedly managed and operated. The data are implemented and managed in the geographical information and topography type information. The geographical information, including grid location coordinate and sea level, are managed in computer files as a grid type. We improved the representation of the sea level by mapping the sea level value of the grid information file into GCV and suggested the dynamic virtual environment implementation technic for the region with the large range of tide. In the experiments, we could know that it is possible to adopt the dynamic virtual environment to the war-game model.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.7
• /
• pp.2231-2245
• /
• 2014

Cognitive Radio (CR) has very promising potential to improve spectrum utilization by allowing unlicensed Secondary Users (SUs) to access the spectrum dynamically without disturbing licensed Primary Users (PUs). Mitigating interference is a fundamental problem in CR scenarios. This is particularly problematic for deploying CR in cellular networks, when users are located at the cell edge, as the inter-cell interference mitigation and frequency reuse are critical requirements for both PUs and SUs. Further cellular networks require higher cell edge performance, then SUs will meet more challenges than PUs. To solve the performance decrease for SUs at the cell edge, a novel Dynamic Spectrum Allocation (DSA) scheme based on Game Theory is proposed in this paper. Full frequency reuse can be realized as well as inter-cell interference mitigated according to SUs' sensing, measurement and interaction in this scheme. A joint power/channel allocation algorithm is proposed to improve both cell-edge user experience and network performance through distributed pricing calculation and exchange based on game theory. Analytical proof is presented and simulation results show that the proposed scheme achieves high efficiency of spectrum usage and improvement of cell edge SUs' performance.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.4
• /
• pp.1192-1207
• /
• 2014

Dynamic spectrum sharing is a key technology to improve spectrum utilization in wireless networks. The elastic spectrum management provides a new opportunity for licensed primary users and unlicensed secondary users to efficiently utilize the scarce wireless resource. In this paper, we present a game-theoretic framework for dynamic spectrum allocation where the primary users rent the unutilized spectrum to the secondary users for a monetary profit. In reality, due to the ON-OFF behavior of the primary user, the quantity of spectrum that can be opportunistically shared by the secondary users is limited. We model this situation with the renewal theory and formulate the spectrum pricing scheme with the Bertrand game, taking into account the scarcity of the spectrum. By the Nash-equilibrium pricing scheme, each player in the game continually converges to a strategy that maximizes its own profit. We also investigate the impact of several properties, including channel quality and spectrum substitutability. Based on the equilibrium analysis, we finally propose a decentralized algorithm that leads the primary users to the Nash-equilibrium, called DST. The stability of the proposed algorithm in terms of convergence to the Nash equilibrium is also studied.