This study introduces a novel bargaining solution termed the"'min-distance bargaining solution"and applies it to a differential games model.A comprehensive algorithm for implementing this new solution is...This study introduces a novel bargaining solution termed the"'min-distance bargaining solution"and applies it to a differential games model.A comprehensive algorithm for implementing this new solution is presented,considering its time consistency within the differential games framework.Realistic scenarios are carefully analyzed to derive insightful findings regarding the mindistance solution,which are further validated through simulations using the resource extraction differential games model.Specifically,we examine scenarios such as managing a finite resource stock in the resource extraction game.Furthermore,a comparative analysis is conducted,pitting the mindistance bargaining solution against well-established alternatives such as Nash bargaining,Kalai-Smorodinsky,and Egalitarian solutions.By subjecting these solutions to numerical evaluations,the study offers valuable insights into decision-making processes.The findings not only contribute to negotiation theory by providing theoretical support but also have practical implications for decision-makers seeking effective strategies.This research significantly advances the field of negotiation theory,particularly in the context of differential games.The proposed min-distance bargaining solution demonstrates its applicability to real-world scenarios and enhances our understanding of strategic decision-making.展开更多
A bandwidth-exchange cooperation algorithm based on the Nash bargaining solution （NBS） is proposed to encourage the selfish users to participate with more cooperation so as to improve the users＇ energy efficiency. ...A bandwidth-exchange cooperation algorithm based on the Nash bargaining solution （NBS） is proposed to encourage the selfish users to participate with more cooperation so as to improve the users＇ energy efficiency. As a result, two key problems, i.e. , when to cooperate and how to cooperate, are solved. For the first problem, a proposed cooperation condition that can decide when to cooperate and guarantee users＇ energy efficiency achieved through cooperation is not lower than that achieved without cooperation. For the second problem, the cooperation bandwidth allocations （CBAs） based on the NBS solve the problem how to cooperate when cooperation takes place. Simulation results show that, as the modulation order of quadrature amplitude modulation （QAM） increases, the cooperation between both users only occurs with a large signal-to-noise ratio （SNR）. Meanwhile, the energy efficiency decreases as the modulation order increases. Despite all this, the proposed algorithm can obviously improve the energy efficiency measured in bits-per-Joule compared with non-cooperation.展开更多
In this paper,we propose a cooperative spectrum sharing strategy based on the Nash bargaining solution.Specifically,the primary system leases a fraction of its transmission time to the secondary system in exchange for...In this paper,we propose a cooperative spectrum sharing strategy based on the Nash bargaining solution.Specifically,the primary system leases a fraction of its transmission time to the secondary system in exchange for cooperation to improve its transmission performance.To gain access to the spectrum of the primary system,the secondary system needs to split a fraction of its transmission bandwidth to help to forward the primary signal.As a reward,the secondary system can use the remaining bandwidth to transmit its own signal.We find a unique solution for this time and bandwidth allocation using the Nash bargaining solution.Simulation results demonstrate that the performance of the primary and secondary systems can both be improved by the proposed spectrum sharing strategy.展开更多
This paper presents a symmetric cooperation strategy for cooperative relay networks with multiple users. The multi-user symmetric cooperation model and the relay selection algorithm are proposed. Then, the time slot a...This paper presents a symmetric cooperation strategy for cooperative relay networks with multiple users. The multi-user symmetric cooperation model and the relay selection algorithm are proposed. Then, the time slot allocation problem is cast into a bargaining problem, and the optimal time slot allocation solution is obtained by Nash bargaining solution （NBS）. Moreover, we also consider the implementations of the cooperation strategy, i.e., the grouping and admission control algorithm. Simulation results show that users can obtain larger rates under the symmetric cooperation strategy than the non-cooperative case.展开更多
Dear Editor,This letter proposes a novel Nash bargaining solution-based multiobjective model predictive control(MPC)scheme to deal with the interaction force control and the path-following problem of the constrained i...Dear Editor,This letter proposes a novel Nash bargaining solution-based multiobjective model predictive control(MPC)scheme to deal with the interaction force control and the path-following problem of the constrained interactive robot.Considering the elastic interaction force model,a mechanical trade-off always exists between the interaction force and position,which means that neither force nor path following can satisfy their desired demands completely.Based on this consideration,two irreconcilable control specifications,the force object function and the position track object function,are proposed,and a new multi-objective MPC scheme is then designed.展开更多
In wireless cellular networks, the interference alignment （IA） is a promising technique for interference management. A new IA scheme for downlink cellular network with multi-cell and multi-user was proposed, in the ...In wireless cellular networks, the interference alignment （IA） is a promising technique for interference management. A new IA scheme for downlink cellular network with multi-cell and multi-user was proposed, in the proposed scheme, the interference in the networks is divided into inter-cell interference （ICI） among cells and inter-user interference （IUI） in each cell. The ICI is aligned onto a multi-dimensional subspace by multiplying the ICI alignment precoding matrix which is designed by the singular value decomposition （SVD） scheme at the base station （BS） side. The aligned ICI is eliminated by timing the interference suppression matrix which is designed by zero-forcing （ZF） scheme at the user equipment （UE） side. Meanwhile, the IUI is aligned by multiplying the IUI alignment precoding matrix which is designed based on Nash bargaining solution （NBS） in game theory. The NBS is solved by the particle swarm optimization （PSO） method. Simulations show that, compared with the traditional ZF IA scheme, the proposed scheme can obtain higher data rate and guarantee the data rate fairness of UEs with little additional complexity.展开更多
Wireless cooperative communications require appropriate power allocation （PA） between the source and relay nodes. In selfish cooperative communication networks, two partner user nodes could help relaying information...Wireless cooperative communications require appropriate power allocation （PA） between the source and relay nodes. In selfish cooperative communication networks, two partner user nodes could help relaying information for each other, but each user node has the incentive to consume his power solely to decrease its own symbol error rate （SER） at the receiver. In this paper, we propose a fair and efficient PA scheme for the decode-and-forward cooperation protocol in selfish cooperative relay networks. We formulate this PA problem as a two-user cooperative bargaining game, and use Nash bargaining solution （NBS） to achieve a win-win strategy for both partner users. Simulation results indicate that the NBS is fair in that the degree of cooperation of a user only depends on how much contribution its partner can make to decrease its SER at the receiver, and efficient in the sense that the SER performance of both users could be improved through the game.展开更多
To solve the contradiction between the increasing demand of diverse vehicular wireless applications and the shortage of spectrum resource, a novel cognitive cooperative vehicular ad-hoc network （CC- VANET） framework...To solve the contradiction between the increasing demand of diverse vehicular wireless applications and the shortage of spectrum resource, a novel cognitive cooperative vehicular ad-hoc network （CC- VANET） framework is proposed in this paper. Firstly, we develop an adaptive cognitive spectrum sensing （ACSS） mechanism which can help to trigger and adjust the spectrum sensing window according to network traffic load status and communication quality. And then, Generalized Nash Bargaining SoLution （GNBS）, which can achieve a good tradeoff between efficiency and weighted fairness, is proposed to formulate the asymmetric inter- cell resource allocation. Finally, GNBS- Safety （GNBS-S） scheme is developed to enhance the Quality of Service （QoS） of safety applications, especially in the heavy load status, where the bandwidth demanded and supplied cannot be matched well. Furthermore, the primary user activity （PUA） which can cause rate loss to secondary users, is also considered to alleviate its influence to fairness. Simulation results indicate that the proposed CC-VANET scheme can greatly improve the spectrum efficiency and reduce the transmission delay and packet loss rate on the heavy contention status. And GNBS spectrum allocation scheme outperforms both the Max-rain and Max-rate schemes, and canenhance the communication reliability of safety service considerably in CC-VANET.展开更多
Inter-femtocell interference becomes serious when femtocells are densely deployed. To mitigate the inter-femtocell interference, this paper proposes a cluster-based bandwidth allocation algorithm. We create femtocell ...Inter-femtocell interference becomes serious when femtocells are densely deployed. To mitigate the inter-femtocell interference, this paper proposes a cluster-based bandwidth allocation algorithm. We create femtocell clusters by constructing a weighted interference graph and allocate bandwidth to each cluster based on a Nash bargaining solution(NBS). Simulation results show that the cluster-based bandwidth allocation algorithm can reduce the inter-femtocell interference and meet the minimum rate constraint of each cluster.展开更多
This paper proposes a bargaining game theoretic resource(including the subcarrier and the power) allocation scheme for wireless orthogonal frequency division multiple access(OFDMA) networks.We define a wireless user s...This paper proposes a bargaining game theoretic resource(including the subcarrier and the power) allocation scheme for wireless orthogonal frequency division multiple access(OFDMA) networks.We define a wireless user s payoff as a function of the achieved data-rate.The fairness resource allocation problem can then be modeled as a cooperative bargaining game.The objective of the game is to maximize the aggregate payoffs for the users.To search for the Nash bargaining solution(NBS) of the game,a suboptimal subcarrier allocation is performed by assuming an equal power allocation.Thereafter,an optimal power allocation is performed to maximize the sum payoff for the users.By comparing with the max-rate and the max-min algorithms,simulation results show that the proposed game could achieve a good tradeoff between the user fairness and the overall system performance.展开更多
To take advantage of the multiuser diversity resulted from the variation in channel conditions among the users, it has become an interesting and challenging problem to efficiently allocate the resources such as subcar...To take advantage of the multiuser diversity resulted from the variation in channel conditions among the users, it has become an interesting and challenging problem to efficiently allocate the resources such as subcarriers, bits, and power. Most of current research concentrates on solving the resource-allocation problem for all users together in a centralized way, which brings about high computational complexity and makes it impractical for real system. Therefore, a coalitional game framework for downlink multi-user resource allocation in long term evolution （LTE） system is proposed, based on the divide-and-conquer idea. The goal is to maximize the overall system data rate under the constraints of each user＇s minimal rate requirement and maximal transmit power of base station while considering the fairness among users. In this framework, a coalitional formation algorithm is proposed to achieve optimal coalition formation and a two-user bargaining algorithm is designed to bargain channel assignment between two users. The total computational complexity is greatly reduced in comparison with conventional methods. The simulation results show that the proposed algorithms acquire a good tradeoff between the overall system throughout and fairness, compared to maximal rate and max-min schemes.展开更多
文摘This study introduces a novel bargaining solution termed the"'min-distance bargaining solution"and applies it to a differential games model.A comprehensive algorithm for implementing this new solution is presented,considering its time consistency within the differential games framework.Realistic scenarios are carefully analyzed to derive insightful findings regarding the mindistance solution,which are further validated through simulations using the resource extraction differential games model.Specifically,we examine scenarios such as managing a finite resource stock in the resource extraction game.Furthermore,a comparative analysis is conducted,pitting the mindistance bargaining solution against well-established alternatives such as Nash bargaining,Kalai-Smorodinsky,and Egalitarian solutions.By subjecting these solutions to numerical evaluations,the study offers valuable insights into decision-making processes.The findings not only contribute to negotiation theory by providing theoretical support but also have practical implications for decision-makers seeking effective strategies.This research significantly advances the field of negotiation theory,particularly in the context of differential games.The proposed min-distance bargaining solution demonstrates its applicability to real-world scenarios and enhances our understanding of strategic decision-making.
基金The National Natural Science Foundation of China(No.61201143)Innovation Foundations of CAST(ITS)(No.F-WYY-2013-016)the Fundamental Research Funds for the Central Universities(No.HIT.IBRSEM.201309)
文摘A bandwidth-exchange cooperation algorithm based on the Nash bargaining solution （NBS） is proposed to encourage the selfish users to participate with more cooperation so as to improve the users＇ energy efficiency. As a result, two key problems, i.e. , when to cooperate and how to cooperate, are solved. For the first problem, a proposed cooperation condition that can decide when to cooperate and guarantee users＇ energy efficiency achieved through cooperation is not lower than that achieved without cooperation. For the second problem, the cooperation bandwidth allocations （CBAs） based on the NBS solve the problem how to cooperate when cooperation takes place. Simulation results show that, as the modulation order of quadrature amplitude modulation （QAM） increases, the cooperation between both users only occurs with a large signal-to-noise ratio （SNR）. Meanwhile, the energy efficiency decreases as the modulation order increases. Despite all this, the proposed algorithm can obviously improve the energy efficiency measured in bits-per-Joule compared with non-cooperation.
基金supported by the National Natural Science Foundation of China under Grants No.61372087,No.61303235the Zhejiang Leading Team of Science and Technology Innovation on Modem Communication and Network System under Grant No.2010R50011the Project of the Zhejiang Provincial Science and Technology Department under Grant No.Y201329389
文摘In this paper,we propose a cooperative spectrum sharing strategy based on the Nash bargaining solution.Specifically,the primary system leases a fraction of its transmission time to the secondary system in exchange for cooperation to improve its transmission performance.To gain access to the spectrum of the primary system,the secondary system needs to split a fraction of its transmission bandwidth to help to forward the primary signal.As a reward,the secondary system can use the remaining bandwidth to transmit its own signal.We find a unique solution for this time and bandwidth allocation using the Nash bargaining solution.Simulation results demonstrate that the performance of the primary and secondary systems can both be improved by the proposed spectrum sharing strategy.
基金supported by National Basic Research Program of China (973 Program) (No. 2010CB731800)Key Project of National Natural Science Foundation of China (No. 60934003)Scientific and Technological Supporting Project of Hebei Province(No. 072435155D)
文摘This paper presents a symmetric cooperation strategy for cooperative relay networks with multiple users. The multi-user symmetric cooperation model and the relay selection algorithm are proposed. Then, the time slot allocation problem is cast into a bargaining problem, and the optimal time slot allocation solution is obtained by Nash bargaining solution （NBS）. Moreover, we also consider the implementations of the cooperation strategy, i.e., the grouping and admission control algorithm. Simulation results show that users can obtain larger rates under the symmetric cooperation strategy than the non-cooperative case.
基金supported by the National Natural Science Foundation of China(62303095)the Natural Science Foundation of Sichuan Province(2023NSFSC0872).
文摘Dear Editor,This letter proposes a novel Nash bargaining solution-based multiobjective model predictive control(MPC)scheme to deal with the interaction force control and the path-following problem of the constrained interactive robot.Considering the elastic interaction force model,a mechanical trade-off always exists between the interaction force and position,which means that neither force nor path following can satisfy their desired demands completely.Based on this consideration,two irreconcilable control specifications,the force object function and the position track object function,are proposed,and a new multi-objective MPC scheme is then designed.
基金supported by the National Key Technology R&D Program of China (2012ZX03001031-004)State Key Laboratory of Wireless Mobile Communications (China Academy of Telecommunication Technology)
文摘In wireless cellular networks, the interference alignment （IA） is a promising technique for interference management. A new IA scheme for downlink cellular network with multi-cell and multi-user was proposed, in the proposed scheme, the interference in the networks is divided into inter-cell interference （ICI） among cells and inter-user interference （IUI） in each cell. The ICI is aligned onto a multi-dimensional subspace by multiplying the ICI alignment precoding matrix which is designed by the singular value decomposition （SVD） scheme at the base station （BS） side. The aligned ICI is eliminated by timing the interference suppression matrix which is designed by zero-forcing （ZF） scheme at the user equipment （UE） side. Meanwhile, the IUI is aligned by multiplying the IUI alignment precoding matrix which is designed based on Nash bargaining solution （NBS） in game theory. The NBS is solved by the particle swarm optimization （PSO） method. Simulations show that, compared with the traditional ZF IA scheme, the proposed scheme can obtain higher data rate and guarantee the data rate fairness of UEs with little additional complexity.
基金supported by National Natural Science Foundation of China (No. 60972059)Project Funded by the Priority Academic Program Development of Jiangsu Higher Education Institutions (PAPD)+3 种基金Fundamental Research Funds for the Central Universities of China (Nos. 2010QNA27 and 2011QNB26)China Postdoctoral Science Foundation (No. 20100481185)the Ph. D. Programs Foundation of Ministry of Education of China (Nos. 20090095120013 and 20110095120006)Talent Introduction Program, and Young Teacher Sailing Program of China University of Mining and Technology
文摘Wireless cooperative communications require appropriate power allocation （PA） between the source and relay nodes. In selfish cooperative communication networks, two partner user nodes could help relaying information for each other, but each user node has the incentive to consume his power solely to decrease its own symbol error rate （SER） at the receiver. In this paper, we propose a fair and efficient PA scheme for the decode-and-forward cooperation protocol in selfish cooperative relay networks. We formulate this PA problem as a two-user cooperative bargaining game, and use Nash bargaining solution （NBS） to achieve a win-win strategy for both partner users. Simulation results indicate that the NBS is fair in that the degree of cooperation of a user only depends on how much contribution its partner can make to decrease its SER at the receiver, and efficient in the sense that the SER performance of both users could be improved through the game.
基金supported in part by program for National Natural Science Foundation of China under Grant No.61271184863 Program of China under Grant No.2013AA013301+1 种基金New Century Excellent Talents in University(NCET-11-0594)Open Fund of the State Key Laboratory of Integrated Services Networks(No.ISN12-03)
文摘To solve the contradiction between the increasing demand of diverse vehicular wireless applications and the shortage of spectrum resource, a novel cognitive cooperative vehicular ad-hoc network （CC- VANET） framework is proposed in this paper. Firstly, we develop an adaptive cognitive spectrum sensing （ACSS） mechanism which can help to trigger and adjust the spectrum sensing window according to network traffic load status and communication quality. And then, Generalized Nash Bargaining SoLution （GNBS）, which can achieve a good tradeoff between efficiency and weighted fairness, is proposed to formulate the asymmetric inter- cell resource allocation. Finally, GNBS- Safety （GNBS-S） scheme is developed to enhance the Quality of Service （QoS） of safety applications, especially in the heavy load status, where the bandwidth demanded and supplied cannot be matched well. Furthermore, the primary user activity （PUA） which can cause rate loss to secondary users, is also considered to alleviate its influence to fairness. Simulation results indicate that the proposed CC-VANET scheme can greatly improve the spectrum efficiency and reduce the transmission delay and packet loss rate on the heavy contention status. And GNBS spectrum allocation scheme outperforms both the Max-rain and Max-rate schemes, and canenhance the communication reliability of safety service considerably in CC-VANET.
基金supported by National Basic Research Program of China(No.2010CB731800)National Natural Science Foundation of China(Nos.61203104,61221003,61174127,61104033 and 61172095)+2 种基金Natural Science Foundation of Hebei Province(Nos.F2012203126 and F2012203109)Research Foundation for the Doctoral Program of Higher Education(Nos.20121333120012,20110073130005,and20110073120025)Program for Doctor Foundation of Yanshan University(No.B632)
文摘Inter-femtocell interference becomes serious when femtocells are densely deployed. To mitigate the inter-femtocell interference, this paper proposes a cluster-based bandwidth allocation algorithm. We create femtocell clusters by constructing a weighted interference graph and allocate bandwidth to each cluster based on a Nash bargaining solution(NBS). Simulation results show that the cluster-based bandwidth allocation algorithm can reduce the inter-femtocell interference and meet the minimum rate constraint of each cluster.
基金supported by National Natural Science Foundation of China (No.60972059)Project Funded by the Priority Academic Program Development of Jiangsu Higher Education Institutions+3 种基金Fundamental Research Funds for the Central Universities of China (No.2010QNA27)China Postdoctoral Science Foundation(No.20100481185)Postdoctoral Research Funds of Jiangsu Province(No.1101108C)Postdoctoral Fellowship Program of the China Scholarship Council
文摘This paper proposes a bargaining game theoretic resource(including the subcarrier and the power) allocation scheme for wireless orthogonal frequency division multiple access(OFDMA) networks.We define a wireless user s payoff as a function of the achieved data-rate.The fairness resource allocation problem can then be modeled as a cooperative bargaining game.The objective of the game is to maximize the aggregate payoffs for the users.To search for the Nash bargaining solution(NBS) of the game,a suboptimal subcarrier allocation is performed by assuming an equal power allocation.Thereafter,an optimal power allocation is performed to maximize the sum payoff for the users.By comparing with the max-rate and the max-min algorithms,simulation results show that the proposed game could achieve a good tradeoff between the user fairness and the overall system performance.
基金supported by the National Science and Technology Major Project(2011ZX03001-007-03)the National Natural Science Foundation of China(61271182)
文摘To take advantage of the multiuser diversity resulted from the variation in channel conditions among the users, it has become an interesting and challenging problem to efficiently allocate the resources such as subcarriers, bits, and power. Most of current research concentrates on solving the resource-allocation problem for all users together in a centralized way, which brings about high computational complexity and makes it impractical for real system. Therefore, a coalitional game framework for downlink multi-user resource allocation in long term evolution （LTE） system is proposed, based on the divide-and-conquer idea. The goal is to maximize the overall system data rate under the constraints of each user＇s minimal rate requirement and maximal transmit power of base station while considering the fairness among users. In this framework, a coalitional formation algorithm is proposed to achieve optimal coalition formation and a two-user bargaining algorithm is designed to bargain channel assignment between two users. The total computational complexity is greatly reduced in comparison with conventional methods. The simulation results show that the proposed algorithms acquire a good tradeoff between the overall system throughout and fairness, compared to maximal rate and max-min schemes.
