• Journal of KIISE:Information Networking
• /
• v.37 no.6
• /
• pp.415-419
• /
• 2010

Bandwidth is an extremely valuable and scarce resource in a wireless network. Therefore, efficient bandwidth management is necessary in order to provide high quality service to users with different requirements. In this paper, we propose a bandwidth reservation algorithm based on Nash Bargaining Solution. The proposed algorithm has low complexity and are quite flexible in the different situations of network. Simulation results indicate that the proposed scheme has excellent performance than other existing schemes.

• KIPS Transactions on Computer and Communication Systems
• /
• v.10 no.4
• /
• pp.93-100
• /
• 2021

The Ethereum shard system for solving the scalability problem of the blockchain has a load balancing issue, which is modeled as a graph partitioning problem. In this paper, we propose an adaptive online weighted graph partitioning algorithm that can negotiate between two utility of the shard system using the game theory's bargaining solution. The bargaining solution is an axiomatic solution that can fairly determine the points of conflict of utility. The proposed algorithm was improved to apply the existing online graph partitioning algorithm to the weighted graph, and load balancing was performed efficiently through the design considering the situation of the sharding system using the extension of Nash bargaining solution, which is extended to apply solution to non-convex feasible set of bargaining problem. As a result of the experiment, it showed up to 37% better performance than typical load balancing algorithm of shard system.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.5
• /
• pp.36-47
• /
• 2009

There exists RFID reader-to reader frequency which can not recognize tag in dense reader nude because the interference causes low SIR. To solve this frequency, the many algorithms based on TDM have been proposed. But the most of existing algorithms not obtain the optimal time allocation but propose heuristic scheduling algorithm. In this paper, we apply game theory which deals with interest between players of game to RFID reader-to reader interference and analyze the time allocation problem of reader based on TDM in terms of cooperative game which the players bind agreements using Nash Bargaining Solution(NBS) and non-cooperative game which the players do not bind agreements using Nash Equilibrium(NE). The applied results show that in dense reader mode, NBS of cooperative game is superior to NE of non-cooperative game and present optimal time allocation in dense reader mode.

• 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을 보장한다.

• The Journal of Society for e-Business Studies
• /
• v.14 no.4
• /
• pp.133-148
• /
• 2009

This study has tried to suggest a new model that can effectively redistribute the tickets in the online ticket resale market, while suggesting a new allocation mechanism based on an agent negotiation. To this end, this study has analyzed an auction in the online ticket resale market through Game theory. As a result of new agent mechanism, it has been proved that the price stability of ticket resale market leads to an increase. An agent negotiation helps to stabilize the ticket prices that are usually inclined to rise at auction, benefiting all the participants in the negotiations, consequently showing a Pareto solution. Especially, a framework for a negotiation process is suggested and domain and processes ontology are designed interrelatedly. With this modeling, a possibility of Ontology based agent negotiation is suggested.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.51 no.7
• /
• pp.311-316
• /
• 2002

It has been a basic model for the present electric power industry that more than two generators compete, and thereby the market clearing price and the generation schedules are determined through the bid process. In order for this paradigm to be applicable to real electric power systems and markets, it is necessary to reflect many physical and economic constraints related to frequency and transmission in the dispatching schedule. The paper presents an approach to deriving a Nash bargaining solution in a competitive electricity market where multiple generators are playing with the system operator who mitigates the transmission congestion to minimize the total transaction cost. In this study, we take the effect of the line flows and the role of system operator into the Game. Finally, a case study has been demonstrated to verify the proposed cooperative game.

• Journal of Korea Technology Innovation Society
• /
• v.15 no.3
• /
• pp.700-721
• /
• 2012

This paper deals with methods for determining the reasonable royalty rates in the valuation of patents. To calculate the reliable reasonable royalty rate of a patent, we review pros and cons of the 25% rule royalty calculating method and the recent trend of this method. We also review the game theory of Nash Bargaining equation and review the Investment of Rate of Return Method according to the financial analysis. Next, we refer to the reasonable royalty damage cases among the recent patent infringement cases in USA and analyze the corresponding patents. We extract the patent indicators from the patent bibliographic information. Finally, we obtain a regression model for calculating a reasonable royalty rate using the patent indicators and the reasonable royalty rates in the recent patent infringement cases.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.65 no.3
• /
• pp.463-468
• /
• 2016

The overall performance of multiuser systems significantly depends on how effectively and fairly manage resources shared by them. The efficient resource management strategies are even more important for multimedia users since multimedia data is delay-sensitive and massive. In this paper, we focus on resource allocation based on a game-theoretic approach, referred to as Nash bargaining solution (NBS), to provide a quality of service (QoS) guarantee for each user. While the NBS has been known as a fair and optimal resource management strategy, it is challenging to find the NBS efficiently due to the computationally-intensive task. In order to reduce the computation requirements for NBS, we propose an approach that requires significantly low complexity even when networks consist of a large number of users and a large amount of resources. The proposed approach linearizes utility functions of each user and formulates the problem of finding NBS as a convex optimization, leading to nearly-optimal solution with significantly reduced computation complexity. Simulation results confirm the effectiveness of the proposed approach.

• Journal of Korean Society of Water and Wastewater
• /
• v.24 no.1
• /
• pp.63-72
• /
• 2010

This study aims to make a decision about the rational option for a multipurpose dams development of the Tumen river basin so that the adjoining countries will effectively deal with the chronic problems and fully satisfy the fast growing demand of water and power. It has been thus far investigated that the interests between North Korea and China closely depend on the selected option, and they are not well compatible with each other. These situations are defined in terms of the cooperative two-person nonzero-sum game. The Nash bargaining model is then applied to contemplate the rational option, considering two scenarios of economic growth of the North Korea. After analyzing the model, it was expected that 1) two multipurpose dams must be cooperatively developed, and 2) their benefits should be allocated according to demand of each country. The authors finally suggest that a cooperative organisation be established to effectively manage the dams beyond the border of the countries.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.7
• /
• pp.1299-1305
• /
• 2017

In this paper, we consider a beamforming game between the transmitters in a two-user multiple-input single-output interference channel using limited feedback and investigate how each transmitter is able to find a modified strategy from the quantized channel state information (CSI). In the beamforming game, each of the transmitters (i.e., a player) tries to maximize the achievable rate (i.e., a payoff function) via a proper beamforming strategy. In our case, each transmitter's beamforming strategy is represented by a linear combining factor between the maximum ratio transmission (MRT) and the zero forcing (ZF) beamforming vectors, which is the Pareto optimal achieving strategy. With the quantized CSI, the transmitters' strategies may not be valid because of the quantization errors. We propose a modified solution, which takes into account the effects of the quantization errors.