• International journal of advanced smart convergence
• /
• 제7권1호
• /
• pp.15-23
• /
• 2018

Spectrum allocation is a key operation in cognitive radio networks (CRNs), where secondary users (SUs) are usually selfish - to achieve itself utility maximization. In view of this context, much prior lit literature proposed spectrum allocation base on non-cooperative game models. However, the most of them proposed non-cooperative game models based on complete information of CRNs. In practical, primary users (PUs) in a dynamic wireless environment with noise uncertainty, shadowing, and fading is difficult to attain a complete information about them. In this paper, we propose a non-cooperative game joint hidden markov model scheme for spectrum allocation in CRNs. Firstly, we propose a new hidden markov model for SUs to predict the sensing results of competitors. Then, we introduce the proposed hidden markov model into the non-cooperative game. That is, it predicts the sensing results of competitors before the non-cooperative game. The simulation results show that the proposed scheme improves the energy efficiency of networks and utilization of SUs.

• ETRI Journal
• /
• 제36권2호
• /
• pp.280-285
• /
• 2014

In this paper, the optimal power control problem in a cooperative relay network is investigated and a new power control scheme is proposed based on a non-cooperative differential game. Optimal power allocated to each node for a relay is formulated using the Nash equilibrium in this paper, considering both the throughput and energy efficiency together. It is proved that the non-cooperative differential game algorithm is applicable and the optimal power level can be achieved.

• International Journal of Contents
• /
• 제7권4호
• /
• pp.10-18
• /
• 2011

Cooperative Group Games (CGG) emphasize participation, challenges and fun by cooperation among group members rather than competition. CGGs have been proven to be an efficient education method that teaches the value of cultivating cooperation skills, discipline, and sense of public order for tackling problems together through various types of interactions. When integrated with computer game technology, the general classic CGG can be reborn with new educational and entertaining aspects. To combine the joy of physical movement of group games and the richness of computer game contents, a motion based arcade CGG has been developed in this study, based on the original ideas and structures of classic off-line CGGs. While implementing the classic game concepts in arcade environment, various design attributes have been considered and applied, which were supposed to promote cooperative game play. Overall, the process of the implementation and test results of our four CGGs suggest several design strategies for effective arcade CGGs.

• 대한수학회지
• /
• 제39권5호
• /
• pp.745-764
• /
• 2002

In this paper we Study a time-optimal model of pursuit in which the players move on a plane with bounded velocities. This game is supposed to be a nonzero-sum group pursuit game. The main point of the work is to construct and compare cooperative and non-cooperative solutions in the game and make a conclusion about cooperation possibility in differential pursuit games. We consider all possible cooperations of the players in the game. For that purpose for every game $\Gamma(x_0,y_0,z_0)$ we construct the corresponding game in characteristic function form $\Gamma_v(x_0,y_0,z_0)$. We show that in this game there exists the nonempty core for any initial positions of the players. The core can take four various forms depending on initial positions of the players. We study how the core changes when the game is proceeding. For the original agreement (an imputation from the original core) to remain in force at each current instant t it is necessary for the core to be time-consistent. Nonemptiness of the core in any current subgame constructing along a cooperative trajectory and its time-consistency are shown. Finally, we discuss advantages and disadvantages of choosing this or that imputation from the core.

• 공학교육연구
• /
• 제24권4호
• /
• pp.41-51
• /
• 2021

This paper is to study whether cooperative learning applying group games becomes a teaching method that can increase interest and participation in class in calculus and the effect of the number of students. To increase interest and participation in class, the researcher conducted cooperative learning by applying smartphones and various game tools to group games. The consequences of the study confirmed that students' interest and participation in the class increased regardless of their mathematics basics. Therefore, it is expected that the calculus which is difficult for students to understand will be more easily approached by cooperative learning applying group games in the future.

• 한국통신학회논문지
• /
• 제35권2B호
• /
• pp.269-278
• /
• 2010

클러스터링 프로토콜의 클러스터 간 주파수 간섭에서 클러스터 멤버는 자신의 전송률을 유지 또는 증가시키기 위해 많은 양의 에너지를 소비하여 노드 수명이 급격히 감소하는 문제가 있다. 이에 서로 다른 주파수를 사용하는 FDM 기반의 자원할당 정책이 요구된다. 본 논문에서는 클러스터 간 주파수 간섭 문제를 해결하기 위해 게임의 참여자간 자원협상문제를 다루는 게임이론을 사용하여 클러스터 간 합리적인 파워 전략을 제시하였다. 특히 각 클러스터가 이기적으로 주파수 자원을 점유하려는 경우를 가정한 비협조게임과 협상을 통해 주파수를 나누어 사용하는 협조게임의 관점에서 각각 분석하였다. 또한 시뮬레이션을 사용하여 협조게임과 비협조게임에서의 노드의 수명시간을 비교하였다.

• ETRI Journal
• /
• 제31권1호
• /
• pp.89-91
• /
• 2009

This letter considers the problem of resource sharing among a relay and multiple user nodes in cooperative transmission networks. We formulate this problem as a sellers' market competition and use a noncooperative game to jointly consider the benefits of the relay and the users. We also develop a distributed algorithm to search the Nash equilibrium, the solution of the game. The convergence of the proposed algorithm is analyzed. Simulation results demonstrate that the proposed game can stimulate cooperative diversity among the selfish user nodes and coordinate resource allocation among the user nodes effectively.

• 대한전기학회논문지:전력기술부문A
• /
• 제52권9호
• /
• pp.542-549
• /
• 2003

In this paper, a novel approach to generator maintenance scheduling strategy in competitive electricity markets based on non-cooperative dynamic game theory is presented. The main contribution of this study can be considered to develop a game-theoretic framework for analyzing strategic behaviors of generating companies (Gencos) from the standpoints of the generator maintenance-scheduling problem (GMP) game. To obtain the equilibrium solution for the GMP game, the GMP problem is formulated as a dynamic non-cooperative game with complete information. In the proposed game, the players correspond to the profit-maximizing individual Gencos, and the payoff of each player is defined as the profits from the energy market. The optimal maintenance schedule is defined by subgame perfect equilibrium of the game. Numerical results for two-Genco system by both proposed method and conventional one are used to demonstrate that 1) the proposed framework can be successfully applied in analyzing the strategic behaviors of each Genco in changed markets and 2) both methods show considerably different results in terms of market stability or system reliability. The result indicates that generator maintenance scheduling strategy is one of the crucial strategic decision-makings whereby Gencos can maximize their profits in a competitive market environment.

• 대한전자공학회논문지TC
• /
• 제46권5호
• /
• pp.36-47
• /
• 2009

RFID의 리더와 태그간의 비가역성으로 인해 리더들이 밀집한 경우 리더간에 서로 간섭을 일으켜서 태그로부터 오는 신호의 SIR을 낮게 만들어 수신단에서 태그를 식별하지 못하는 RFID 주파수 간섭문제가 존재한다. 현재 이에 대한 해결 방법으로서 서로 다른 시간자원을 할당하는 TDM 기반의 방법들이 제안되고 있다. 그러나 대부분 리더들 간에 최적의 시간 할당을 구하는 것이 아닌 heuristic 스케줄링 알고리즘을 제안하고 있다. 이에 본 논문에서는 리더들 간의 주파수 간섭문제를 게임의 참여자간에 발생되는 이해관계를 해결하는 게임이론을 주파수 간섭문제에 적용함으로써 TDM을 사용하는 RFID 리더간에 발생되는 시간 자원 할당 문제를 사전 협약이 존재하는 협조 게임의과 협약이 존재하지 않는 비협조 게임의 내쉬 협상 해와 내쉬 균형 관점에서 해석해 보았다. 게임이론을 적용한 결과는 밀집리더환경에서는 협조게임의 내쉬 협상 해가 비협조게임의 내쉬 균형보다 더 큰 이득을 만들어 내는 것을 보여주고, 밀집 리더 환경에서의 최적의 시간할당량을 보여준다.

• 한국게임학회 논문지
• /
• 제12권4호
• /
• pp.3-12
• /
• 2012

본 논문은 소셜게임에서 플레이어들이 어떻게 사회적 관계를 시작하고 유지, 순환시키는 구조를 만들어내는지에 대한 양상 연구를 그 목적으로 한다. 소셜게임에서 플레이어들은 상호 협력하여 도움을 주고받는다. 본 논문에서는 이 협력의 구조가 진화심리학과 신화학의 호혜 이론에 기반하고 있음을 착안, <팜빌>, <씨티빌>, <엠파이어즈 앤 얼라이언스>, <타이니 팜> 등의 텍스트 분석을 통해 고정성, 상호 유상성, 지속성, 전시성이라는 소셜게임의 협력 매커니즘을 도출해내고 이 호혜성의 게임 기제들이 게임 시스템에 어떻게 적용, 플레이되고 있는지를 증명하고자 하였다. 이와 같은 연구는 소셜게임을 포함한 디지털 게임에서 플레이어들 간의 협력적 스토리텔링을 창발시키는 게임 시스템을 개발하는 유의미한 지표를 제공한다는데 그 의의를 갖는다.