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.展开更多
In a symmetric affiliated value model, this paper analyses High-Technology industrial firms’ competitive strategy in research and development. (R&D). We obtain the symmetric Bayesian Nash Equilibrium functions wi...In a symmetric affiliated value model, this paper analyses High-Technology industrial firms’ competitive strategy in research and development. (R&D). We obtain the symmetric Bayesian Nash Equilibrium functions with or without government’s prize: b1(x)=v(x,)Fn-1 (y∣y), and b3(x)= . We find the firm’s investment level will increase in prize, only when the constant prize V0≥v(y,y) , does the firm invest more aggressively with constant prize than with variable prize. Key words affiliated value - Bayesian Nash solution - prize CLC number O 29 - F 224.3 Biography: Che Ka-jia (1954-), female, Ph. D candidate, research direction: financial mathematics and business administration.展开更多
There are three important roles in evasion conflict: pursuer, target and defender. Pursuers’ mission is to access targets; targets’ mission is to escape from pursuers’ capture; defenders’ mission is to intercept p...There are three important roles in evasion conflict: pursuer, target and defender. Pursuers’ mission is to access targets; targets’ mission is to escape from pursuers’ capture; defenders’ mission is to intercept pursuers who are potentially dangerous to targets. In this paper, a distributed online mission plan(DOMP) algorithm for pursuers is proposed based on fuzzy evaluation and Nash equilibrium. First, an integrated effectiveness evaluation model is given. Then, the details of collaborative mission planning which includes the co-optimization of task distributing, trajectory and corresponding maneuvering scheme are presented. Finally, the convergence and steadiness of DOMP are discussed with simulation results. Compared with centralized mission planning, DOMP is more robust and can greatly improve the effectiveness of pursuing. It can be applied to dynamic scenario due to its distributed architecture.展开更多
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.展开更多
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.展开更多
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.展开更多
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.展开更多
In this paper,the pursuit-evasion game with state and control constraints is solved to achieve the Nash equilibrium of both the pursuer and the evader with an iterative self-play technique.Under the condition where th...In this paper,the pursuit-evasion game with state and control constraints is solved to achieve the Nash equilibrium of both the pursuer and the evader with an iterative self-play technique.Under the condition where the Hamiltonian formed by means of Pontryagin’s maximum principle has the unique solution,it can be proven that the iterative control law converges to the Nash equilibrium solution.However,the strong nonlinearity of the ordinary differential equations formulated by Pontryagin’s maximum principle makes the control policy difficult to figured out.Moreover the system dynamics employed in this manuscript contains a high dimensional state vector with constraints.In practical applications,such as the control of aircraft,the provided overload is limited.Therefore,in this paper,we consider the optimal strategy of pursuit-evasion games with constant constraint on the control,while some state vectors are restricted by the function of the input.To address the challenges,the optimal control problems are transformed into nonlinear programming problems through the direct collocation method.Finally,two numerical cases of the aircraft pursuit-evasion scenario are given to demonstrate the effectiveness of the presented method to obtain the optimal control of both the pursuer and the evader.展开更多
This paper presents a differential game model of centrally planned economics(CPEs). The Nash solution and Pareto solutions are derived.It concludes that CPEs is ineffident in the framework of game theory.
In this paper, we study the virtual resource(VR) allocation problem in LTE-based wireless network virtualization(WNV). A practical network scenario, where multiple virtual wireless service providers(WSPs)request the V...In this paper, we study the virtual resource(VR) allocation problem in LTE-based wireless network virtualization(WNV). A practical network scenario, where multiple virtual wireless service providers(WSPs)request the VR from a unique mobile network operator(MNO) is considered. Our objective is two folds. The first is to guarantee the minimum rate requirements of the MNO and the WSPs. The second is to distribute the system rate among the MNO and the WSPs in the Pareto optimal manner. To this end, an efficient VR allocation scheme based on bargaining game theory is proposed, and the Nash bargaining solution(NBS) method is used to solve the proposed game problem. The proposed game problem is proved to be a convex optimization problem. By using standard convex optimization method, the global optimal NBS of the game is obtained in closed form. The effectiveness of the proposed VR allocation game is testified through numerical results.展开更多
In government procurement, government and suppliers are connected for their interests, government and agencies are connected for commissions. This paper focuses on these two kinds of relationship and use rent-seeking...In government procurement, government and suppliers are connected for their interests, government and agencies are connected for commissions. This paper focuses on these two kinds of relationship and use rent-seeking game model to analyze the behavior of the government.展开更多
基金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.
文摘In a symmetric affiliated value model, this paper analyses High-Technology industrial firms’ competitive strategy in research and development. (R&D). We obtain the symmetric Bayesian Nash Equilibrium functions with or without government’s prize: b1(x)=v(x,)Fn-1 (y∣y), and b3(x)= . We find the firm’s investment level will increase in prize, only when the constant prize V0≥v(y,y) , does the firm invest more aggressively with constant prize than with variable prize. Key words affiliated value - Bayesian Nash solution - prize CLC number O 29 - F 224.3 Biography: Che Ka-jia (1954-), female, Ph. D candidate, research direction: financial mathematics and business administration.
基金co-supported by the Heilongjiang Postdoctoral Scientific Research Developmental Fund (No. LBH-Q14054)the Fundamental Research Funds for the Central Universities of China (No. HEUCFD1503)
文摘There are three important roles in evasion conflict: pursuer, target and defender. Pursuers’ mission is to access targets; targets’ mission is to escape from pursuers’ capture; defenders’ mission is to intercept pursuers who are potentially dangerous to targets. In this paper, a distributed online mission plan(DOMP) algorithm for pursuers is proposed based on fuzzy evaluation and Nash equilibrium. First, an integrated effectiveness evaluation model is given. Then, the details of collaborative mission planning which includes the co-optimization of task distributing, trajectory and corresponding maneuvering scheme are presented. Finally, the convergence and steadiness of DOMP are discussed with simulation results. Compared with centralized mission planning, DOMP is more robust and can greatly improve the effectiveness of pursuing. It can be applied to dynamic scenario due to its distributed architecture.
基金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 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 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+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.
文摘In this paper,the pursuit-evasion game with state and control constraints is solved to achieve the Nash equilibrium of both the pursuer and the evader with an iterative self-play technique.Under the condition where the Hamiltonian formed by means of Pontryagin’s maximum principle has the unique solution,it can be proven that the iterative control law converges to the Nash equilibrium solution.However,the strong nonlinearity of the ordinary differential equations formulated by Pontryagin’s maximum principle makes the control policy difficult to figured out.Moreover the system dynamics employed in this manuscript contains a high dimensional state vector with constraints.In practical applications,such as the control of aircraft,the provided overload is limited.Therefore,in this paper,we consider the optimal strategy of pursuit-evasion games with constant constraint on the control,while some state vectors are restricted by the function of the input.To address the challenges,the optimal control problems are transformed into nonlinear programming problems through the direct collocation method.Finally,two numerical cases of the aircraft pursuit-evasion scenario are given to demonstrate the effectiveness of the presented method to obtain the optimal control of both the pursuer and the evader.
文摘This paper presents a differential game model of centrally planned economics(CPEs). The Nash solution and Pareto solutions are derived.It concludes that CPEs is ineffident in the framework of game theory.
基金supported in part by China University of Mining and Technology Funds for Academic Frontier Research(Grant No.2015XKQY18)National High-tech R&D Program of China(863 Program)(Grant Nos.2015AA015701+1 种基金2015AA01A705)National Natural Science Foundation of China(Grant No.61100167)
文摘In this paper, we study the virtual resource(VR) allocation problem in LTE-based wireless network virtualization(WNV). A practical network scenario, where multiple virtual wireless service providers(WSPs)request the VR from a unique mobile network operator(MNO) is considered. Our objective is two folds. The first is to guarantee the minimum rate requirements of the MNO and the WSPs. The second is to distribute the system rate among the MNO and the WSPs in the Pareto optimal manner. To this end, an efficient VR allocation scheme based on bargaining game theory is proposed, and the Nash bargaining solution(NBS) method is used to solve the proposed game problem. The proposed game problem is proved to be a convex optimization problem. By using standard convex optimization method, the global optimal NBS of the game is obtained in closed form. The effectiveness of the proposed VR allocation game is testified through numerical results.
文摘In government procurement, government and suppliers are connected for their interests, government and agencies are connected for commissions. This paper focuses on these two kinds of relationship and use rent-seeking game model to analyze the behavior of the government.
