• Journal of Korea Game Society
• /
• v.14 no.2
• /
• pp.29-44
• /
• 2014

This Study analyzes gameness in SNS. SNS is not only communication tool for real life but also game like media for the experimental fiction. As the media like games, SNS meets 6 classic game features. After the Tatradic analysis, Expressive and manipulation rules move SNS paidia direction, player's effort and negotiable outcome are obsolesced. Player's attachment is enhanced and in SNS, the tradition of MUD retrieves abstract ground with representative expression. As following result, SNS is able to extend its own area to the player's creative world for the possible. SNS is the media like games.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39C no.4
• /
• pp.400-406
• /
• 2014

In this paper, we propose an approach to minimizing total power consumption by deploying multiple clean-up robots simultaneously in a given area. For this, we propose to use the cooperative game theoretic approaches (i.e., Nash bargaining solution (NBS)) such that the robots can optimally and fairly negotiate the area division based on available resources and characteristics of the area, thereby leading to the minimum total power consumption. We define a utility function that includes power consumptions for characteristics of areas and the robots can agree on a utility pair based on the NBS. Simulation results show that the proposed approach can reduce the total average power consumption by 15-30% compared to a random area division approach.

• The Journal of the Korea Contents Association
• /
• v.20 no.11
• /
• pp.292-300
• /
• 2020

According to the development of artificial intelligence technology, attempts have been made to interpret phenomena in various fields of the real world such as economic, social, and scientific fields through computer simulations using virtual artificial agents. In the existing artificial agent-based bargaining game analysis, there was a problem that did not reflect the cost incurred when the stage progresses in the real-world bargaining game and the depreciation of the bargaining target over time. This study intends to observe the effect on the bargaining game by adding the cost incurred in the bargaining stage and depreciation of the bargaining target over time (bargaining cost) to the previous artificial agent-based bargaining game model. As a result of the experiment, it was observed that as the cost incurred in the bargaining stage increased, the two artificial agents participating in the game had a share close to half the ratio and tried to conclude the negotiation in the early stage.

• Journal of Internet Computing and Services
• /
• v.7 no.2
• /
• pp.137-149
• /
• 2006

In this paper, we suggest a message-based communication protocol and a dynamic role assignment mechanism for efficient cooperation and teamwork of agents in computer game environments. This role assignment mechanism is a new one different from both existing static and dynamic mechanisms, in which all decisions related with role assignment are made at once in design phase or execution phase. According to our mechanism, all possible role sets are determined in design phase. Detail decisions regarding which agent takes what role, however, are made in execution phase. This mechanism for role assignment can minimize the negotiation effort in execution phase. Therefore, this mechanism is quite effective especially in real-time multiagent environments. Through experiments, we show the superiority of the new dynamic role assignment mechanism.

• KIPS Transactions on Computer and Communication Systems
• /
• v.12 no.10
• /
• pp.299-308
• /
• 2023

As the spectrum shortage problem has accelerated by the emergence of various services, New Radio-Unlicensed (NR-U) has appeared, allowing users who communicated in licensed bands to communicate in unlicensed bands. However, NR-U network users reduce the performance of Wi-Fi network users who communicate in the same unlicensed band. In this paper, we aim to simultaneously maximize the fairness and throughput of the unlicensed band, where the NR-U network users and the WiFi network users coexist. First, we propose an optimal power allocation scheme based on Monte Carlo Policy Gradient of reinforcement learning to maximize the sum of rates of NR-U networks utilizing rate-splitting multiple access in unlicensed bands. Then, we propose a channel occupancy time division algorithm based on sequential Raiffa bargaining solution of game theory that can simultaneously maximize system throughput and fairness for the coexistence of NR-U and WiFi networks in the same unlicensed band. Simulation results show that the rate splitting multiple access shows better performance than the conventional multiple access technology by comparing the sum-rate when the result value is finally converged under the same transmission power. In addition, we compare the data transfer amount and fairness of NR-U network users, WiFi network users, and total system, and prove that the channel occupancy time division algorithm based on sequential Raiffa bargaining solution of this paper satisfies throughput and fairness at the same time than other algorithms.

• KIPS Transactions on Computer and Communication Systems
• /
• v.10 no.8
• /
• pp.215-222
• /
• 2021

In order to alleviate the limited resource problem and interference problem in cellular networks, the dual connectivity technology has been introduced with the cooperation of small cell base stations. In this paper, we design a new efficient and fair resource allocation scheme for the dual connectivity technology. Based on two different bargaining solutions - Generalizing Tempered Aspiration bargaining solution and Gupta and Livne bargaining solution, we develop a two-stage radio resource allocation method. At the first stage, radio resource is divided into two groups, such as real-time and non-real-time data services, by using the Generalizing Tempered Aspiration bargaining solution. At the second stage, the minimum request processing speeds for users in both groups are guaranteed by using the Gupta and Livne bargaining solution. These two-step approach can allocate the 5G radio resource sequentially while maximizing the network system performance. Finally, the performance evaluation confirms that the proposed scheme can get a better performance than other existing protocols in terms of overall system throughput, fairness, and communication failure rate according to an increase in service requests.

• Journal of Internet Computing and Services
• /
• v.11 no.5
• /
• pp.105-117
• /
• 2010

In recent years, dynamic collaboration (DC) among cloud providers (CPs) is becoming an inevitable approach for the widely use of cloud computing and to realize the greatest value of it. In our previous paper, we proposed a combinatorial auction (CA) based cloud market model called CACM that enables a DC platform among different CPs. The CACM model allows any CP to dynamically collaborate with suitable partner CPs to form a group before joining an auction and thus addresses the issue of conflicts minimization that may occur when negotiating among providers. But how to determine optimal group bidding prices, how to obtain the stability condition of the group and how to distribute the winning prices/profits among the group members in the CACM model have not been studied thoroughly. In this paper, we propose to formulate the above problems of cooperative negotiation in the CACM model as a bankruptcy game which is a special type of N-person cooperative game. The stability of the group is analyzed by using the concept of the core and the amount of allocationsto each member of the group is obtained by using Shapley value. Numerical results are presented to demonstrate the behaviors of the proposed approaches.

• Photonics industry news
• /
• s.18
• /
• pp.44-53
• /
• 2003

광파이버는 고도화된 네트워크의 주요 형태로서 향후 지속적으로 통신 사업자에 의해 구축되어야 할 설비이다. 현 단계에서 일방적으로 광파이버 개방의무가 특정 통신사업에게 부과될 경우 개방으로 얻게 되는 긍정적인 측면보다는 부정적인 측면이 더 크게 나타날 것이라는 주장도 제기되고 있다. 현재 광파이버를 개방한 국가는 미국, 일본 등 일부 국가게 불과하며, 대부분의 국가에서는 광파이버 개방을 사업자간 협상에 맡기고 있거나 설비제공대상에서 제외시키고 있다. 한편, 이미 광파이버를 개방하고 있는 미국과 일본은 광대역서비스부문의 투자촉진을 위해 기존의 광파이버 개방의무를 완화하는 추세로 나아가고 있다. 이런 점들을 고려했을 때 국내의 광파이버 개방문제는 정책결정에 앞서 신중한 검토가 요구된다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2011.06d
• /
• pp.221-224
• /
• 2011

본 논문에서는 중첩 된 WBAN(Wireless Body Area Network) 환경에서 비경쟁 전송구간의 신뢰성 있는 전송을 위해 한정된 자원(비경쟁 전송구간)을 각각의 WBAN에게 할당하는 방안을 제안한다. 이를 위해 협동적 게임 이론(cooperative game theory)을 바탕으로 한정된 자원(비경쟁 전송구간)을 효율적이고 공평하게 할당 할 수 있도록 내쉬중재(Nash arbitration) 기법을 통한 자원 할당 방안을 살펴본다. 내쉬중재 협상해법을 통해 WBAN 간 비경쟁 전송구간의 충돌 없이 신뢰성 있는 전송을 보장한다. 또한, 각 WBAN의 비경쟁 전송 구간 내의 디바이스 우선순위와 할당받은 timeslot의 개수를 고려하여 전략 선택에 따른 형평성과 각 WBAN이 비경쟁전송 구간 내에 요구하는 최소한의 timeslot을 보장한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.06c
• /
• pp.136-138
• /
• 2006

정밀한 요구사항 분석과 다양한 전략의 응용을 통해 최대이익과 최소손해를 보장할 수 있는 게임이론 협상 프로세스를 제안하고, 그러한 프로세스가 지속되는 상호작용 속에서 보이는 한계점을 Win-Win 모델을 도입함으로서 보완하고자 한다. 또한 이러한 게임이론 보완 방법론을 통해, 이해관계자간의 지속적인 상호작용 속에서 꾸준한 이익을 보장할 수 있다는 제안의 타당성을 사례연구를 통해서 확인한다.