• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2001년도 추계학술대회 논문집 전력기술부문
• /
• 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)
• /
• 제11권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.

• 한국정보통신학회논문지
• /
• 제6권6호
• /
• pp.943-950
• /
• 2002

실시간 전략 게임은 인간 혹은 컴퓨터를 상대로 하는 게임 장르이다. 이것은 턴방식의 컴퓨터게임과는 게임 진행 방식이 상이하다. 체스와 같은 턴방식은 오직 한 명의 플레이어의 동작을 허용하지만 실시간 전략게임은 복수의 플레이어의 동시다발적인 동작을 허용한다. 따라서 실시간 전략게임에서는 게임 내 유닛들의 이동경로는 자원채취, 건물건설, 그리고 전투 프로세스들의 처리를 위한 충분한 시간을 확보하기 위해 신속히 계산되어야 한다. 경로계산에 필요한 메모리, 탐색공간, 유닛들의 반응속도를 향상시키려는 여러 접근방식들이 소개되고 있다. 현재의 경로계산 알고리즘들은 최상 경로계산에 치중한 나머지 실시간 전략게임에서의 계산 과부하 문제를 고려하고 있지 않다 .이런 점에서 본 논문은 탐색공간을 줄이고 유닛들의 반응속도를 높이는 DHA*(Dynamic Heuristic Af) 알고리듬을 제안하고, 기존 A* 알고리듬과 비교하여 본 제안 DHA* 알고리듬의 성능이 우수함을 입증한다.

• 한국게임학회 논문지
• /
• 제6권1호
• /
• pp.3-10
• /
• 2006

게임에서 레벨 디자인 (Level Design)과 캐릭터간의 밸런스는 게임의 흥미를 결정하는 매우 중요한 요소이며, 레벨 디자이너에 의해 결정 된다. 기존의 게임에서는 플레이어가 가장 큰 재미를 느낄 수 있는 캐릭터의 공격 패턴과 속성은 정적으로 정해졌으며 스크립트 형식으로 표현됐다. 이와 같이 정적으로 정해진 레벨에 따라 진행되면 플레이어가 쉽게 적응하게 되고, 플레이어의 학습능력에 따라 레벨 디자이너가 의도했던 밸런스가 깨질 수 있었다. 이런 문제점을 해결하기 위해 본 논문에서는 게임 도중에 플레이어의 대응 패턴을 GMM(Gaussian Mixture Model)으로 모델링하고 분석하여 레벨 디자이너가 의도했던 레벨과 재미를 느낄 수 있는 환경을 제공하는 방법을 제안한다. 제안한 방법을 실제 2D슈팅게임에 적용하여 플레이어의 패턴을 분석한 결과와 동적 레벨 디자인의 결과를 보인다.

• 한국게임학회 논문지
• /
• 제4권3호
• /
• pp.55-64
• /
• 2004

RPG, 전략 시뮬레이션등의 2D/3D 게임에서 동적으로 변화하는 장애물이나 지형 정보 등을 관리하기에는 대체로 동적 그래프가 적합하다. 이 논문에서는 빠르게 길 찾기를 수행하고 동적으로 변경할 수 있는 고정 레벨의 계층적 그래프 모델을 제안한다. 공간 분류나 공간 모델을 이용해 그래프를 분할하여 계층적 그래프를 구성하고, 동적 그래프의 연산자들을 제시하여 계층적 그래프 모델에서의 실시간 A* 길 찾기 방법을 실험하였다. 본 논문에서 제안한 모델이 동적 장애물이나 동적 구조를 가지는 게임 환경에서 빠르게 길 찾기를 수행하기에 적합한 그래프 모델임을 실험을 통해 입증하였다.

• Earthquakes and Structures
• /
• 제23권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.

• 대한전기학회논문지:전력기술부문A
• /
• 제52권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.

• 한국산학기술학회논문지
• /
• 제10권4호
• /
• pp.785-794
• /
• 2009

워게임모델에서 가상환경격자정보에 관한 개선과 구축기법을 연구하였다. 가상환경자료는 지상, 해상, 공중으로 구분하여 관리 및 운용한다. 가상환경자료는 지리정보와 지형형태정보로 구축 및 관리한다. 지리정보는 격자(Grid) 형태로서 격자위치좌표와 수심을 파일로 관리한다. 그 격자정보파일의 수심값을 이동가능대표값(GCV)으로 개선하고, 조석차가 심한지역에 대해서 동적가상환경구축기법을 제안하였다. 제안된 시스템 의 구현 및 시험을 통하여 동적 가상환경을 워게임모델에 적용이 가능하다는 것을 알 수 있었다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권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)
• /
• 제8권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.