• Information and Communications Magazine
• /
• v.26 no.7
• /
• pp.10-16
• /
• 2009

본고에서는 무선 통신 망에서 게임 이론이 적용된 주요 물리 계층 설계 기술을 소개한다. 셀룰러 망과 ad-hoc 망에서 일반적으로 적용할 수 있는 비협력 게임 이론 모형을 제시하고 서로 다른 목적을 위해 제안된 게임 전략과 유틸리티 함수를 소개함으로써 게임 이론으로 다양한 분산 알고리즘을 도출할 수 있음을 보인다.

• Information and Communications Magazine
• /
• v.30 no.12
• /
• pp.66-75
• /
• 2013

수학을 기반으로 경제학에서 널리 사용되던 게임이론이 최근 네트워크 디자인 분야에서 중요한 수단으로 활용되고 있다. 통신 네트워크에서 게임이론의 응용 분야로는 혼잡 제어, 네트워크 라우팅, 네트워크 부하균형, 통신보안, 대역폭 가격선정, 무선 협력통신, 트래픽 컨트롤, 전력제어, 자원 할당과 서비스 품질 보장 등 다양한 분야가 존재한다. 본 고에서는 최근 주목받고 있는 게임이론의 기본개념과 발전해온 역사, 그리고 대표적인 게임모델들에 대하여 간단히 소개하고자 한다.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2009.05a
• /
• pp.381-384
• /
• 2009

강변여과는 인공함양을 활용한 대체수자원의 대표적 방법으로 하천수를 충적층으로 통과시켜 간접취수함으로써 오염저감과 수질사고 대처 능력의 장점을 가지고 있다. 유럽을 시작으로 많은 선진국에서는 150년 정도의 개발역사를 가지고 있으며, 우리나라에서도 현재 낙동강을 중심으로 강변여과를 활용한 상수도 공급이 이루어지고 있다. 본 논문은 이러한 강변여과 개발을 위한 개발전 개발전략과 적절한 개발위치 선정에 대한 연구로서 게임이론적 접근을 시도하였다. 강변여과 개발을 위한 지자체간 협력 게임이론을 적용함으로써 협력관계를 통한 추가이익 발생이 가능하게 되어 강변여과 개발타당성을 확보할 수 있다. 본 연구에서는 입지 선정에서 대상 후보지의 인자비교를 위한 일부 항목의 자료 유무에 상관없이, 적지분석이 가능한 게임모형을 개발하고 그 적용성에 대해 검토하였다.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.8
• /
• pp.55-62
• /
• 2014

A game theoretic approach is applied for studying the energy efficient rate scheduling. The individual utility function is defined first. Then, a non cooperative rate game is modeled in which each user decides the transmission rate to maximize its own utility. The utility function considered here is the consumed energy for the individual user's data transmissions. In particular, using the fact that the utility function is convex, we prove the existence of Nash Equilibrium in the energy efficient rate scheduling problem at hand. Accordingly, a non cooperative scheduling algorithm is provided. For better energy efficiency, the sum of the individual user's utility function is optimized Finally, the convergence analysis and numerical results to show the energy efficiency of the proposed algorithms are provided.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2017.07a
• /
• pp.113-114
• /
• 2017

본 논문에서는 셀룰라시스템의 상향링크 자원을 사용하는 D2D 단말의 전송전력 최적화문제를 게임이론적 방법으로 고찰해본다. 먼저, 전송전력 최적화문제를 비협력적 전송전력게임으로 구성하고, 구성된 전송전력게임이 나쉬 평형을 가지게 됨을 확인한다. 본 논문에서 도출된 나쉬 평형에서는 개별 D2D 단말은 오로지 자신의 전송전력을 최적화하도록 전송전력값을 선택한다. 하지만, 시스템 입장에서는 결국 모든 단말의 전송전력값은 나쉬평형이라고 하는 전송전력의 유일한 수렴점에 도달하게 된다. 컴퓨터실험을 통하여 다수 개의 D2D 사용자 환경에서 나쉬평형이 존재함을 확인한다.

• Journal of Korea Game Society
• /
• v.12 no.4
• /
• pp.3-12
• /
• 2012

This study discusses how players make the mutually cooperative mechanism in Social Games. In SNG, many players exchange helps each other. That mechanism is not only one-off but also repetitive process. In the perspective of reciprocity in Evolutionary psychology and Mythology, this study analyzes mutual cooperation in several game texts most well known in the SNG field. According to the field study results, four cooperative mechanisms were extracted. These 4 principles apply to every digital game design for emerging of cooperative storytelling among players.

• The KIPS Transactions:PartC
• /
• v.18C no.2
• /
• pp.97-102
• /
• 2011

Since the game theory provides a theoretical ground to distribute a shared resource between demanding users in a fair and efficient manner, it has been used for the bandwidth allocation problem in a network. However, the bandwidth allocation schemes with different game theory assign different amount of bandwidth in the same operational environments. However, only the mathematical framework is adopted when a bandwidth allocation scheme is devised without quantitatively comparing the results when they applied to the bandwidth allocation problem. Thus, in this paper, we compare the characteristics of the bandwidth allocation schemes using the bankrupt game theory and the bargaining game theory when they applied to the situation where nodes are competing for the bandwidth in a network. Based on the numerical results, we suggest the future research direction.

• Journal of Korea Game Society
• /
• v.7 no.1
• /
• pp.59-68
• /
• 2007

Online games are getting more popular among today's fun-seeking young students. The immersive power of these Internet-based games is so strong that many educators consider the integration of the games and learning to enhance learner motivation. However, the online games, which are primarily aiming g for 'fun', have cognitive, emotional, and social features and impacts that are different from the so-called 'educational' games. Therefore an interdisciplinary approach for better understanding of the online game in regard to its impact on learning and fun should be essential. In this study, the researcher will analyze relevant literature and theories from cognitive psychology, media and communication theory, and Ludology to grasp holistic understanding of online game phenomena, which will serve as basis of further research and development in this emerging area.

• Journal of the Korean Data and Information Science Society
• /
• v.20 no.1
• /
• pp.49-55
• /
• 2009

A cooperative game often arises from domination problem on graphs and the core in a cooperative game could be the optimal solution of a linear programming of a given game. In this paper, we define a {k}-fractional domination game which is a specific type of fractional domination games and find the core of a {k}-fractional domination game. Moreover, we may investigate the balancedness of a {k}-fractional domination game using a concept of a linear programming and duality. We also conjecture the concavity for {k}-fractional dominations game which is important problem to find the elements of the core.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.10a
• /
• pp.107-110
• /
• 2015

In this paper, we propose a coalitonal game theoritic approach to the power control problem in resource-constrained wireless sensor networks, where the objective is to enhance power efficiency of individual sensors while providing the QoS requirements. We model this problem as two-sided one-to-one matching game and deploly deferred acceptance procedure that produces a single matching in the core. Furthermore, we show that, by applying the procedure repeatedly, a certain stable state is achieved where no sensor can anticipate improvements in their power efficiency as far as all of them are subject to their own QoS constraints. We evaluate our proposal by comparing them with cluster-based and the local optimal solution obtained by maximizing the total system energy efficiency, where the objective function is non-convex.