• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.44 no.2
• /
• pp.215-221
• /
• 2024

The government is encouraging the expansion of renewable energy facilities through national renewable energy policy. However, the installation of renewable energy generation facilities has led to local resident complaints due to landscape degradation, electromagnetic wave emission, real estate devaluation, and environmental pollution. This creates conflicts between power project developers and residents, making the progress of projects more difficult. This study applies non-cooperative game theory to analyze eight cases of renewable energy projects where conflicts between developers and residents were resolved through resident's investment participation. By accepting investments from local stakeholders, residents achieved returns ranging from a maximum of 25 % to a minimum of 4.1 %. It was found through game theory analysis that a dominant strategy involves residents agreeing to the development of the project and the developers sharing a portion of the profits with the residents. The analysis results show that the point where dominant strategy meet forms a Nash equilibrium, and at the same time becomes the Pareto optimal point, benefiting both power generation operators and residents.

• Journal of Korea Port Economic Association
• /
• v.29 no.4
• /
• pp.73-95
• /
• 2013

This paper analyzes a competitive shipping market in East Asia in order to explore how container carriers make decisions on ship size, number of ships, service frequency, and service route. A sequential-move game based on non-cooperative game theory is applied to establish the models for the decision-makings involving the transportation volumes, freight rates, costs, and market shares of the service routes from Shanghai or Hong Kong to the ports in Busan, Gwangyang, and Incheon. According to the sub-game perfect Nash equilibrium solutions proposed by these models, carriers' decisions in such a competitive environment vary depending on sailing distance, transport demand, and freight rates. Therefore, carriers are recommended to reflect the optimal equilibrium solutions and a variety of decision factors when formulating strategies for transportation networks and operating fleets. Furthermore, ports should establish management strategies for these factors to provide optimal equilibrium solutions for carriers' transportation networks.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.6
• /
• pp.1996-2013
• /
• 2015

This paper considers a scenario that more D2D users exist in the cell, they compete for cellular resources to increase their own data rates, which may cause transmission interference to cellular users (CU) and the unfairness of resource allocation. We design a resource allocation scheme for selfish D2D users assisted by cooperative relay technique which is used to further enhance the users' transmission rates, meanwhile guarantee the QoS requirement of the CUs. Two transmission modes are considered for D2D users: direct transmission mode and cooperative relay transmission mode, both of which reuses the cellular uplink frequency resources. To ensure the fairness of resource distribution, Nash bargaining theory is used to determine the transmission mode and solve the bandwidth allocation problem for D2D users choosing cooperative relay transmission mode, and coalition formation game theory is used to solve the uplink frequency sharing problem between D2D users and CUs through a new defined "Selfish order". Through theoretical analysis, we obtain the closed Nash bargaining solution under CUs' rate constraints, and prove the stability of the formatted coalition. Simulation results show that the proposed resource allocation approach achieves better performance on resource allocation fairness, with only little sacrifice on the system sum rates.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.8
• /
• pp.2854-2874
• /
• 2015

This paper presents a game theoretic approach to analyze the public goods (PGs) allocation in peer-to-peer (p2p) networks. In order to reduce the free-riders and promote the cooperation among peers, we propose an incentive mechanism with cooperation-based game theory. In this paper, we regarded the contributed resources by cooperators as public goods (PGs). We also build the PGs allocation in P2P networks to be the optimization problem, and the optimal solution of PGs allocation satisfies the Bowen-Lindahl-Samuelson equilibrium. Firstly, based on the subscriber mechanism, we analyze the feasibility and prove the validity, which can achieve Nash equilibrium. However, this strategy cannot meet to Bowen-Lindahl-Samuelson equilibrium as the free-riders do not pay with their private goods for consuming the PGs. Secondly, based on the Walker mechanism, we analyze the feasibility and prove the validity for the same allocation problem, which meets to Bowen-Lindahl-Samuelson equilibrium and achieves Pareto efficiency within cooperative game. Simulations show that the proposed walker mechanism can significantly improve the network performance of throughout, and effectively alleviate free-riding problem in P2P networks.

• Journal of Communications and Networks
• /
• v.17 no.4
• /
• pp.440-448
• /
• 2015

In this paper, we study the problem of selfish behavior of secondary users (SUs) based on cognitive radio (CR) with the presence of primary users (PUs). SUs are assumed to contend on a channel using the carrier sense multiple access with collision avoidance (CSMA/CA) and PUs do not consider transmission of SUs, where CSMA/CA protocols rely on the random deference of packets. SUs are vulnerable to selfish attacks by which selfish users could pick short random deference to obtain a larger share of the available bandwidth at the expense of other SUs. In this paper, game theory is used to study the systematic cheating of SUs in the presence of PUs in multichannel CR networks. We study two cases: A single cheater and multiple cheaters acting without any restraint. We identify the Pareto-optimal point of operation of a network with multiple cheaters and also derive the Nash equilibrium of the network. We use cooperative game theory to drive the Pareto optimality of selfish SUs without interfering with the activity of PUs. We show the influence of the activity of PUs in the equilibrium of the whole network.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.10
• /
• pp.3867-3886
• /
• 2015

This article investigates the problem of opportunistic spectrum access in dynamic environment, in which the signal-to-noise ratio (SNR) is time-varying. Different from existing work on continuous feedback, we consider more practical scenarios in which the transmitter receives an Acknowledgment (ACK) if the received SNR is larger than the required threshold, and otherwise a Non-Acknowledgment (NACK). That is, the feedback is discrete. Several applications with different threshold values are also considered in this work. The channel selection problem is formulated as a non-cooperative game, and subsequently it is proved to be a potential game, which has at least one pure strategy Nash equilibrium. Following this, a multi-agent Q-learning algorithm is proposed to converge to Nash equilibria of the game. Furthermore, opportunistic spectrum access with multiple discrete feedbacks is also investigated. Finally, the simulation results verify that the proposed multi-agent Q-learning algorithm is applicable to both situations with binary feedback and multiple discrete feedbacks.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.11
• /
• pp.771-778
• /
• 2014

We propose Femto-cell power control scheme in HeNet with Game Theory. The Femto-cell which provide high quality with low power is issued by many benefits, however there is a bunch of interferences when many Femto-cells use overlapped bandwidth with Macro-cell. We defined base station of cellular networks and mobile users as players of Game Theory, and configured interference effect among each other as power utility function. Futhermore, we showed enhanced overall system performance, lower power usage and interference decrease by using optimal power.

• 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.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.7
• /
• pp.2631-2649
• /
• 2021

Device-to-Device (D2D) communication is one of the enabling technologies for 5G networks that support proximity-based service (ProSe) for wireless network communications. This paper proposes a power control algorithm based on the Nash equilibrium and game theory to eliminate the interference between the cellular user device and D2D links. This leadsto reliable connectivity with minimal power consumption in wireless communication. The power control in D2D is modeled as a non-cooperative game. Each device is allowed to independently select and transmit its power to maximize (or minimize) user utility. The aim is to guide user devices to converge with the Nash equilibrium by establishing connectivity with network resources. The proposed algorithm with pricing factors is used for power consumption and reduces overall interference of D2Ds communication. The proposed algorithm is evaluated in terms of the energy efficiency of the average power consumption, the number of D2D communication, and the number of iterations. Besides, the algorithm has a relatively fast convergence with the Nash Equilibrium rate. It guarantees that the user devices can achieve their required Quality of Service (QoS) by adjusting the residual cost coefficient and residual energy factor. Simulation results show that the power control shows a significant reduction in power consumption that has been achieved by approximately 20% compared with algorithms in [11].

• 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.