• 한국수학교육학회지시리즈A:수학교육
• /
• 제43권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.

• 한국게임학회 논문지
• /
• 제3권1호
• /
• pp.37-48
• /
• 2003

최근 들어 게임 사용자들의 욕구가 점점 다양해지고 있지만, 국내 게임제작사들의 신상품개발은 여전히 제작자 관점에서 행해지고 있다. 게임제작사들의 이와 같은 제작자 중심의 상품개발은 거시적으로 게임문화의 다양성을 저해할 뿐 아니라, 게임제작사 자신도 과다경쟁으로 건전한 수익기반을 잃게 될 위험이 크다. 이러한 차원에서 본 연구의 방향을 게임제작사들이 게임사용자 관점에서 사용자들의 욕구를 게임제작에 과학적으로 반영할 수 있는 컨조인트 분석을 소개하는데 중점을 두었다. 컨조인트분석을 직접 한국의 게임사용자들에게 적용하여, 컨조인트 분석을 통해 어떻게 사용자들이 선호하는 게임을 찾아낼 수 있는 가를 보여주었다. 컨조인트 분석결과 한국의 게임 사용자들은 시뮬레이션 게임, RPG 게임, 아케이드 게임의 경우 "다양성 측면"을 가장 중요시하는 것으로 나타났으며, 온라인 게임인 경우 "시나리오"를 가장 중요시하는 것으로 나타났다. 또한 "조작의 간편성"등 사용의 편리성에 대한 욕구도 강한 것으로 나타났다.

• 한국게임학회 논문지
• /
• 제17권6호
• /
• pp.129-138
• /
• 2017

축구 시뮬레이션 게임에서 축구 선수들의 능력치를 현실에 가깝게 만드는 것은 게임의 흥미를 위해 매우 중요한 요소이다. 스포츠 시뮬레이션 게임에 경영 개념이 도입되면서 장시간 게임을 플레이하게 되면 기존 선수 캐릭터의 은퇴문제가 발생하고 새로운 선수 캐릭터를 생성하여 게임의 환경을 유지하게 된다. 본 연구에서는 새로운 선수 캐릭터를 생성할 때 유전 알고리즘을 활용하여 기존의 선수와 유사하면서 최적의 능력을 갖추게 하는 방식을 제안한다. 기존의 랜덤 생성방식, 보정 랜덤방식과 제안한 알고리즘으로 선수 캐릭터를 생성하여 비교, 평가하여 제안한 방식의 유효성을 검증한다.

• 한국경영정보학회:학술대회논문집
• /
• 한국경영정보학회 2007년도 International Conference
• /
• 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.

• 한국항만경제학회지
• /
• 제29권4호
• /
• pp.73-95
• /
• 2013

본 논문은 컨테이너 선사들의 선형, 항로 및 항차의 결정방법을 구축하기 위해 동아시아지역의 경쟁적인 해운시장을 분석하였다. 상하이항과 홍콩항으로부터 국내의 부산, 광양 및 인천항향 서비스 항로에 운송량, 운임, 원가, 그리고 시장점유율을 기반으로 한 모형에 비협조적게임이론에 기초한 순차진행게임을 적용하였다. 이러한 모형의 문제를 풀도록 제안된 하위게임 완전 내시균형해에 따르면, 경쟁환경에서 선사들의 의사결정은 운항거리, 운송수요, 그리고 운임수준에 따라 달라지는 것으로 분석되었다. 그러므로 선사들은 운송네트워크와 최적선대에 대한 전략을 구성할 때 최적균형해를 이용하고 이를 위해 다양한 의사결정 요인들을 동시에 고려해야만 한다. 추가적으로, 항만들은 다양한 요인들을 이용해 각 항만이 선사 운송네트워크의 최적 균형해를 제공하기 위한 경영전략을 구축해야만 할 것이다.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1998년도 제13차 학술회의논문집
• /
• 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.

• 대한수학회보
• /
• 제57권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.

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

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권5호
• /
• pp.1554-1566
• /
• 2014

Cloud Computing allows application providers seamlessly scaling their services and enables users scaling their usage according to their needs. In this paper, using queuing game model, we present service scheduling schemes which are used in software as a service (SaaS). The object is maximizing the Cloud Computing platform's (CCP's) payoff via controlling the service requests whether to join or balk, and controlling the value of CCP's admission fee. Firstly, we treat the CCP as one virtual machine (VM) and analyze the optimal queue length with a fixed admission fee distribution. If the position number of a new service request is bigger than the optimal queue length, it balks. Otherwise, it joins in. Under this scheme, the CCP's payoff can be maximized. Secondly, we extend this achievement to the multiple VMs situation. A big difference between single VM and multiple VMs is that the latter one needs to decide which VM the service requests turn to for service. We use a corresponding algorithm solve it. Simulation results demonstrate the good performance of our schemes.