The Russia-Ukraine situation has become a notable international issue,with the resulting changes in global diplomatic relations gaining considerable attention.To examine the evolving diplomatic strategies of the count...The Russia-Ukraine situation has become a notable international issue,with the resulting changes in global diplomatic relations gaining considerable attention.To examine the evolving diplomatic strategies of the countries involved,the authors apply the theories and methodologies of complex network games.First,the authors incorporate overflow payoff theory from economic and trade cooperation networks to summarise the spillover income phenomenon in diplomatic games and to facilitate modelling.Drawing on the classic Fermi rule in network game theory,the authors introduce belief and the same-strategy factors to propose an evolutionary game rule driven by interests,beliefs,and neighbouring strategies.Using numerical simulations,the authors examine the factors that affect the evolutionarily stable strategies of various nations.The authors also conduct comparative experiments to validate the scientific credibility of the method proposed in this paper.展开更多
Economies of scale,economies of scope,and technology spillover are decisive eco-nomic elements that are crucial to the development in the Fintech industry.Thesepositive externalities are often realized through network...Economies of scale,economies of scope,and technology spillover are decisive eco-nomic elements that are crucial to the development in the Fintech industry.Thesepositive externalities are often realized through network links.In this paper,we presenta dynamic network offinancialfirms which exhibits these decisive elements.Thenetwork game equilibria are characterized.A Pareto efficient solution involving col-laboration of allfirms is provided.To obtain a fair-share distribution of cooperativegains,the Shapley value is adopted as the sharing mechanism.Payoff distributionmechanisms which guarantee the fulfilment of the Shapley value distribution in eachstage of the cooperation duration are derived.展开更多
Based on the introduction of the connotations and characteristics of tourism industrial eco-network,it has expatiated on the connotations of and approaches to enterprise coupling in tourism industrial eco-network.As t...Based on the introduction of the connotations and characteristics of tourism industrial eco-network,it has expatiated on the connotations of and approaches to enterprise coupling in tourism industrial eco-network.As there are different understandings and definitions of these connotations,the following four aspects must be achieved in order to realize coupling in the real sense for the enterprises in the network.① Establish the idea of "the whole is larger than the sum of all the parts",and construct interests community of tourism industrial eco-network.② Construct cooperation mechanism of joint struggle to transfer the advantages of the single to the advantages of the whole.③ Create and maintain strong service culture.④ Avoid as many service blunders as possible and construct damage warning mechanism in industrial eco-network.With the construction of the game model of tourism enterprise coupling and corresponding analysis,the results indicate that the mode of loose cooperation between enterprises in the tourism industry could hardly reach any forceful binding agreements.Consequently it is hard to realize the coordinated effects brought about by the cooperative game of tourism enterprise coupling and these enterprises would often come to a "prisoner dilemma" because of present tiny benefits.In the end,it suggests that during the process of competition tourism enterprises should also strengthen mutual cooperation as relying upon the platform of industrial eco-network.展开更多
In this paper a comprehensive introduction for modeling and control of networked evolutionary games （NEGs） via semi-tensor product （STP） approach is presented. First, we review the mathematical model of an NEG, wh...In this paper a comprehensive introduction for modeling and control of networked evolutionary games （NEGs） via semi-tensor product （STP） approach is presented. First, we review the mathematical model of an NEG, which consists of three ingredients： network graph, fundamental network game, and strategy updating rule. Three kinds of network graphs are considered, which are i） undirected graph for symmetric games; ii） directed graph for asymmetric games, and iii） d-directed graph for symmetric games with partial neighborhood information. Three kinds of fundamental evolutionary games （FEGs） are discussed, which are i） two strategies and symmetric （S-2）; ii） two strategies and asymmetric （A-2）; and iii） three strategies and symmetric （S-3）. Three strategy updating rules （SUR） are introduced, which are i） Unconditional Imitation （UI）; ii） Fermi Rule（FR）; iii） Myopic Best Response Adjustment Rule （MBRA）. First, we review the fundamental evolutionary equation （FEE） and use it to construct network profile dynamics （NPD）of NEGs. To show how the dynamics of an NEG can be modeled as a discrete time dynamics within an algebraic state space, the fundamental evolutionary equation （FEE） of each player is discussed. Using FEEs, the network strategy profile dynamics （NSPD） is built by providing efficient algorithms. Finally, we consider three more complicated NEGs： i） NEG with different length historical information, ii） NEG with multi-species, and iii） NEG with time-varying payoffs. In all the cases, formulas are provided to construct the corresponding NSPDs. Using these NSPDs, certain properties are explored. Examples are presented to demonstrate the model constructing method, analysis and control design technique, and to reveal certain dynamic behaviors of NEGs.展开更多
This paper is concerned with anti-disturbance Nash equilibrium seeking for games with partial information.First,reduced-order disturbance observer-based algorithms are proposed to achieve Nash equilibrium seeking for ...This paper is concerned with anti-disturbance Nash equilibrium seeking for games with partial information.First,reduced-order disturbance observer-based algorithms are proposed to achieve Nash equilibrium seeking for games with firstorder and second-order players,respectively.In the developed algorithms,the observed disturbance values are included in control signals to eliminate the influence of disturbances,based on which a gradient-like optimization method is implemented for each player.Second,a signum function based distributed algorithm is proposed to attenuate disturbances for games with secondorder integrator-type players.To be more specific,a signum function is involved in the proposed seeking strategy to dominate disturbances,based on which the feedback of the velocity-like states and the gradients of the functions associated with players achieves stabilization of system dynamics and optimization of players'objective functions.Through Lyapunov stability analysis,it is proven that the players'actions can approach a small region around the Nash equilibrium by utilizing disturbance observerbased strategies with appropriate control gains.Moreover,exponential(asymptotic)convergence can be achieved when the signum function based control strategy(with an adaptive control gain)is employed.The performance of the proposed algorithms is tested by utilizing an integrated simulation platform of virtual robot experimentation platform(V-REP)and MATLAB.展开更多
Using the semi-tensor product method, this paper investigates the modeling and analysis of networked evolutionary games(NEGs) with finite memories, and presents a number of new results. Firstly, a kind of algebraic ex...Using the semi-tensor product method, this paper investigates the modeling and analysis of networked evolutionary games(NEGs) with finite memories, and presents a number of new results. Firstly, a kind of algebraic expression is formulated for the networked evolutionary games with finite memories, based on which the behavior of the corresponding evolutionary game is analyzed. Secondly, under a proper assumption, the existence of Nash equilibrium of the given networked evolutionary games is proved and a free-type strategy sequence is designed for the convergence to the Nash equilibrium. Finally, an illustrative example is worked out to support the obtained new results.展开更多
This paper considers the modeling and convergence of hyper-networked evolutionary games （HNEGs）. In an HNEG the network graph is a hypergraph, which allows the fundamental network game to be a multi-player one. Usin...This paper considers the modeling and convergence of hyper-networked evolutionary games （HNEGs）. In an HNEG the network graph is a hypergraph, which allows the fundamental network game to be a multi-player one. Using semi-tensor product of matrices and the fundamental evolutionary equation, the dynamics of an HNEG is obtained and we extend the results about the networked evolutionary games to show whether an HNEG is potential and how to calculate the potential. Then we propose a new strategy updating rule, called the cascading myopic best response adjustment rule （MBRAR）, and prove that under the cascading MBRAR the strategies of an HNEG will converge to a pure Nash equilibrium. An example is presented and discussed in detail to demonstrate the theoretical and numerical results.展开更多
Elastic control could balance the distributed control plane in Software-Defined Networking(SDN). Dynamic switch migration has been proposed to achieve it. However, existing schemes mainly focus on how to execute migra...Elastic control could balance the distributed control plane in Software-Defined Networking(SDN). Dynamic switch migration has been proposed to achieve it. However, existing schemes mainly focus on how to execute migration operation, but not why. This paper designs a decision-making mechanism based on zero-sum game theory to reelect a new controller as the master for migrated switches. It first chooses a switch for migration in the heavy controller which invites its neighbors as the game players to compete for the master role of this switch in the game-playing field(GPF) which is an occasional and loose domain for game-playing. Second, based on the concept of GPF, we design a decentralized strategy to play the game and determine which player as the final master. We implement it by extending the Open Flow protocol. Finally, numerical results demonstrate that our distributed strategy can approach elastic control plane with better performance.展开更多
Energy saving is the most important issue in research and development for wireless sensor networks. A power control mechanism can reduce the power consumption of the whole network. Because the character of wireless se...Energy saving is the most important issue in research and development for wireless sensor networks. A power control mechanism can reduce the power consumption of the whole network. Because the character of wireless sensor networks is restrictive energy, this paper proposes a distributed power control algorithm based on game theory for wireless sensor networks which objects of which are reducing power consumption and decreasing overhead and increasing network lifetime. The game theory and OPNET simulation shows that the power control algorithm converges to a Nash Equilibrium when decisions are updated according to a better response dynamic.展开更多
Device to device(D2 D) multi-hop communication in multicast networks solves the contradiction between high speed requirements and limited bandwidth in regional data sharing communication services. However, most networ...Device to device(D2 D) multi-hop communication in multicast networks solves the contradiction between high speed requirements and limited bandwidth in regional data sharing communication services. However, most networking models demand a large control overhead in eNodeB. Moreover, the topology should be calculated again due to the mobility of terminals, which causes the long delay. In this work, we model multicast network construction in D2 D communication through a fuzzy mathematics and game theory based algorithm. In resource allocation, we assume that user equipment(UE) can detect the available frequency and the fuzzy mathematics is introduced to describe an uncertain relationship between the resource and UE distributedly, which diminishes the time delay. For forming structure, a distributed myopic best response dynamics formation algorithm derived from a novel concept from the coalitional game theory is proposed, in which every UE can self-organize into stable structure without the control from eNodeB to improve its utilities in terms of rate and bit error rate(BER) while accounting for a link maintenance cost, and adapt this topology to environmental changes such as mobility while converging to a Nash equilibrium fast. Simulation results show that the proposed architecture converges to a tree network quickly and presents significant gains in terms of average rate utility reaching up to 50% compared to the star topology where all of the UE is directly connected to eNodeB.展开更多
We study the evolutionary snowdrift game in a heterogeneous Newman-Watts small-world network. The heterogeneity of the network is controlled by the number of hubs. It is found that the moderate heterogeneity of the ne...We study the evolutionary snowdrift game in a heterogeneous Newman-Watts small-world network. The heterogeneity of the network is controlled by the number of hubs. It is found that the moderate heterogeneity of the network can promote the cooperation best. Besides, we study how the hubs affect the evolution of cooperative behaviours of the heterogeneous Newman-Watts small-world network. Simulation results show that both the initial states of hubs and the connections between hubs can play an important role. Our work gives a further insight into the effect of hubs on the heterogeneous networks.展开更多
The exact evolutionary history of any set of biological taxa is unknown, and all phylogenetic reconstructions are approximations. The problem becomes harder when one must consider a mix of vertical and lateral phyloge...The exact evolutionary history of any set of biological taxa is unknown, and all phylogenetic reconstructions are approximations. The problem becomes harder when one must consider a mix of vertical and lateral phylogenetic signals. In this paper we propose a game theoretic approach to constructing biological networks. The key hypothesis is that evolution is driven by distinct mechanisms that seek to maximize two competing objectives, taxonomic conservation and diversity. One branch of the mathematical theory of games is brought to bear. It translates this evolutionary game hypothesis into a mathematical model in two-player zero-sum games, with the zero-sum assumption conforming to one of the fundamental constraints in nature in mass and energy conservation. We demonstrate why and how a mechanistic and localized adaptation to seek out greater information for conservation and diversity may always lead to a global Nash equilibrium in phylogenetic affinity. Our game theoretic method, referred to as bioinformatic game theory, is used to construct network clusters. As an example, we applied this method to clustering of a multidomain protein family. The protein clusters identified were consistent with known protein subfamilies, indicating that this game-theoretic approach provides a new framework in biological sequence analysis, especially in studying gene-genome and domain-protein relationships.展开更多
This paper investigates the networked evolutionary model based on snow-drift game with the strategy of rewards and penalty. Firstly, by using the semi-tensor product of matrices approach, the mathematical model of the...This paper investigates the networked evolutionary model based on snow-drift game with the strategy of rewards and penalty. Firstly, by using the semi-tensor product of matrices approach, the mathematical model of the networked evolutionary game is built. Secondly, combined with the matrix expression of logic, the mathematical model is expressed as a dynamic logical system and next converted into its evolutionary dynamic algebraic form. Thirdly, the dynamic evolution process is analyzed and the final level of cooperation is discussed. Finally, the effects of the changes in the rewarding and penalty factors on the level of cooperation in the model are studied separately, and the conclusions are verified by examples.展开更多
Wireless Body Area Network(WBAN) is an emerging technology to provide real-time health monitoring and ubiquitous healthcare services. In many applications, multiple wireless body area networks have to coexist in a sma...Wireless Body Area Network(WBAN) is an emerging technology to provide real-time health monitoring and ubiquitous healthcare services. In many applications, multiple wireless body area networks have to coexist in a small area, resulting in serious inter-network interference. This not only reduces network reliability that is especially important in emergency medical applications, but also consumes more power of WBANs. In this paper, an inter-network interference mitigation approach based on a power control algorithm is proposed. Power control is modeled as a non-cooperative game, in which both inter-network interference and energy efficiency of WBANs are considered. The existence and uniqueness of Nash Equilibrium in the game are proved, and an optimal scheme based on best response is proposed to find its Nash Equilibrium. By coordinating the transmission power levels among networks under interference environment, the total system throughput can be increased with minimum power consumed. The effectiveness of the proposed method has been illustrated by simulation results, where the performance of the proposed approach is evaluated in terms of overall utility and power efficiency and convergence speed.展开更多
To avoid uneven energy consuming in wireless sen- sor networks, a clustering routing model is proposed based on a Bayesian game. In the model, Harsanyi transformation is introduced to convert a static game of incomple...To avoid uneven energy consuming in wireless sen- sor networks, a clustering routing model is proposed based on a Bayesian game. In the model, Harsanyi transformation is introduced to convert a static game of incomplete information to the static game of complete but imperfect information. In addition, the existence of Bayesian nash equilibrium is proved. A clustering routing algorithm is also designed according to the proposed model, both cluster head distribution and residual energy are considered in the design of the algorithm. Simulation results show that the algorithm can balance network load, save energy and prolong network lifetime effectively.展开更多
To address the issues that middleboxes as a fundamental part of today's networks are facing, Network Function Virtualization(NFV)has been recently proposed, which in essence asserts to migrate hardware-based middl...To address the issues that middleboxes as a fundamental part of today's networks are facing, Network Function Virtualization(NFV)has been recently proposed, which in essence asserts to migrate hardware-based middleboxes into software-based virtualized function entities.Due to the demands of virtual services placement in NFV network environment, this paper models the service amount placement problem involving with the resources allocation as a cooperative game and proposes the placement policy by Nash Bargaining Solution(NBS). Specifically,we first introduce the system overview and apply the rigorous cooperative game-theoretic guide to build the mathematical model, which can give consideration to both the responding efficiency of service requirements and the allocation fairness.Then a distributed algorithm corresponding to NBS is designed to achieve predictable network performance for virtual instances placement.Finally, with simulations under various scenarios,the results show that our placement approach can achieve high utilization of network through the analysis of evaluation metrics namely the satisfaction degree and fairness index. With the suitable demand amount of services, the average values of two metrics can reach above 90%. And by tuning the base placement, our solution can enable operators to flexibly balance the tradeoff between satisfaction and fairness of resourcessharing in service platforms.展开更多
With the explosive growth of highspeed wireless data demand and the number of mobile devices, fog radio access networks(F-RAN) with multi-layer network structure becomes a hot topic in recent research. Meanwhile, due ...With the explosive growth of highspeed wireless data demand and the number of mobile devices, fog radio access networks(F-RAN) with multi-layer network structure becomes a hot topic in recent research. Meanwhile, due to the rapid growth of mobile communication traffic, high cost and the scarcity of wireless resources, it is especially important to develop an efficient radio resource management mechanism. In this paper, we focus on the shortcomings of resource waste, and we consider the actual situation of base station dynamic coverage and user requirements. We propose a spectrum pricing and allocation scheme based on Stackelberg game model under F-RAN framework, realizing the allocation of resource on demand. This scheme studies the double game between the users and the operators, as well as between the traditional operators and the virtual operators, maximizing the profits of the operators. At the same time, spectrum reuse technology is adopted to improve the utilization of network resource. By analyzing the simulation results, it is verified that our proposed scheme can not only avoid resource waste, but also effectively improve the operator's revenue efficiency and overall network resource utilization.展开更多
In this paper, we investigate the link resource management problem for optical networks, to achieve the resource cost during the information transmission. We use the differential game to formulate the cost control pro...In this paper, we investigate the link resource management problem for optical networks, to achieve the resource cost during the information transmission. We use the differential game to formulate the cost control problem for the link resource management, to minimize the resource allocation cost functions, which dynamic behaviours are described by differential equations. Each link controls its transmission bandwidth based on the Nash equilibriums of the differential game. The effectiveness of the proposed model is given through numerical simulations.展开更多
In this paper, we carry out QoE (Quality of Experience) assessment of fairness between players in a networked balloon bursting game with olfactory and haptic senses. We also make a comparison of the fairness among dif...In this paper, we carry out QoE (Quality of Experience) assessment of fairness between players in a networked balloon bursting game with olfactory and haptic senses. We also make a comparison of the fairness among different types of networked games with olfactory and haptic senses in the assessment. Then, we clarify the differences owing to usage of olfactory and haptic senses among the games. As a result, we illustrate that the fairness is largely affected by the delay difference, and we also demonstrate that the allowable range depends on the type of games, type of senses which are employed in the games, and the play methods.展开更多
In January 2010,the State Council of China decided to speed up the convergence of the telecommunications network,cable network and Internet network.That means the government-led practical exploration of the networks c...In January 2010,the State Council of China decided to speed up the convergence of the telecommunications network,cable network and Internet network.That means the government-led practical exploration of the networks convergence.The convergence is related to the entities in the fields of telecommunications,broadcasting and the Internet industry.The authors apply the static game theory to analyze the games among the players in the fields of telecommunications and broadcasting,and point out that the games would strengthen the network infrastructures,promote the development of related industries,and profoundly influence and change the ways of thinking and social management in China.At last,the paper puts forward some policy recommendations.展开更多
基金supported by the Key Research Project of the Basic Research Program under Grant No.2020-J***-ZD-005。
文摘The Russia-Ukraine situation has become a notable international issue,with the resulting changes in global diplomatic relations gaining considerable attention.To examine the evolving diplomatic strategies of the countries involved,the authors apply the theories and methodologies of complex network games.First,the authors incorporate overflow payoff theory from economic and trade cooperation networks to summarise the spillover income phenomenon in diplomatic games and to facilitate modelling.Drawing on the classic Fermi rule in network game theory,the authors introduce belief and the same-strategy factors to propose an evolutionary game rule driven by interests,beliefs,and neighbouring strategies.Using numerical simulations,the authors examine the factors that affect the evolutionarily stable strategies of various nations.The authors also conduct comparative experiments to validate the scientific credibility of the method proposed in this paper.
文摘Economies of scale,economies of scope,and technology spillover are decisive eco-nomic elements that are crucial to the development in the Fintech industry.Thesepositive externalities are often realized through network links.In this paper,we presenta dynamic network offinancialfirms which exhibits these decisive elements.Thenetwork game equilibria are characterized.A Pareto efficient solution involving col-laboration of allfirms is provided.To obtain a fair-share distribution of cooperativegains,the Shapley value is adopted as the sharing mechanism.Payoff distributionmechanisms which guarantee the fulfilment of the Shapley value distribution in eachstage of the cooperation duration are derived.
基金Supported by Sichuan Circular Economy Research Centre of Sichuan Province Key Research Base of Philosophy and Social Science in2008(XHJJ-0808)~~
文摘Based on the introduction of the connotations and characteristics of tourism industrial eco-network,it has expatiated on the connotations of and approaches to enterprise coupling in tourism industrial eco-network.As there are different understandings and definitions of these connotations,the following four aspects must be achieved in order to realize coupling in the real sense for the enterprises in the network.① Establish the idea of "the whole is larger than the sum of all the parts",and construct interests community of tourism industrial eco-network.② Construct cooperation mechanism of joint struggle to transfer the advantages of the single to the advantages of the whole.③ Create and maintain strong service culture.④ Avoid as many service blunders as possible and construct damage warning mechanism in industrial eco-network.With the construction of the game model of tourism enterprise coupling and corresponding analysis,the results indicate that the mode of loose cooperation between enterprises in the tourism industry could hardly reach any forceful binding agreements.Consequently it is hard to realize the coordinated effects brought about by the cooperative game of tourism enterprise coupling and these enterprises would often come to a "prisoner dilemma" because of present tiny benefits.In the end,it suggests that during the process of competition tourism enterprises should also strengthen mutual cooperation as relying upon the platform of industrial eco-network.
基金This work was partially supported by National Natural Science Foundation of China （Nos. 61273013, 61333001, 61104065, 61322307）.
文摘In this paper a comprehensive introduction for modeling and control of networked evolutionary games （NEGs） via semi-tensor product （STP） approach is presented. First, we review the mathematical model of an NEG, which consists of three ingredients： network graph, fundamental network game, and strategy updating rule. Three kinds of network graphs are considered, which are i） undirected graph for symmetric games; ii） directed graph for asymmetric games, and iii） d-directed graph for symmetric games with partial neighborhood information. Three kinds of fundamental evolutionary games （FEGs） are discussed, which are i） two strategies and symmetric （S-2）; ii） two strategies and asymmetric （A-2）; and iii） three strategies and symmetric （S-3）. Three strategy updating rules （SUR） are introduced, which are i） Unconditional Imitation （UI）; ii） Fermi Rule（FR）; iii） Myopic Best Response Adjustment Rule （MBRA）. First, we review the fundamental evolutionary equation （FEE） and use it to construct network profile dynamics （NPD）of NEGs. To show how the dynamics of an NEG can be modeled as a discrete time dynamics within an algebraic state space, the fundamental evolutionary equation （FEE） of each player is discussed. Using FEEs, the network strategy profile dynamics （NSPD） is built by providing efficient algorithms. Finally, we consider three more complicated NEGs： i） NEG with different length historical information, ii） NEG with multi-species, and iii） NEG with time-varying payoffs. In all the cases, formulas are provided to construct the corresponding NSPDs. Using these NSPDs, certain properties are explored. Examples are presented to demonstrate the model constructing method, analysis and control design technique, and to reveal certain dynamic behaviors of NEGs.
基金supported by the National Natural Science Foundation of China(NSFC)(62222308,62173181,62073171,62221004)the Natural Science Foundation of Jiangsu Province(BK20200744,BK20220139)+3 种基金Jiangsu Specially-Appointed Professor(RK043STP19001)1311 Talent Plan of Nanjing University of Posts and Telecommunicationsthe Young Elite Scientists SponsorshipProgram by CAST(2021QNRC001)the Fundamental Research Funds for the Central Universities(30920032203)。
文摘This paper is concerned with anti-disturbance Nash equilibrium seeking for games with partial information.First,reduced-order disturbance observer-based algorithms are proposed to achieve Nash equilibrium seeking for games with firstorder and second-order players,respectively.In the developed algorithms,the observed disturbance values are included in control signals to eliminate the influence of disturbances,based on which a gradient-like optimization method is implemented for each player.Second,a signum function based distributed algorithm is proposed to attenuate disturbances for games with secondorder integrator-type players.To be more specific,a signum function is involved in the proposed seeking strategy to dominate disturbances,based on which the feedback of the velocity-like states and the gradients of the functions associated with players achieves stabilization of system dynamics and optimization of players'objective functions.Through Lyapunov stability analysis,it is proven that the players'actions can approach a small region around the Nash equilibrium by utilizing disturbance observerbased strategies with appropriate control gains.Moreover,exponential(asymptotic)convergence can be achieved when the signum function based control strategy(with an adaptive control gain)is employed.The performance of the proposed algorithms is tested by utilizing an integrated simulation platform of virtual robot experimentation platform(V-REP)and MATLAB.
基金supported by the National Natural Science Foundation of China(61503225)the Natural Science Foundation of Shandong Province(ZR2015FQ003,ZR201709260273)
文摘Using the semi-tensor product method, this paper investigates the modeling and analysis of networked evolutionary games(NEGs) with finite memories, and presents a number of new results. Firstly, a kind of algebraic expression is formulated for the networked evolutionary games with finite memories, based on which the behavior of the corresponding evolutionary game is analyzed. Secondly, under a proper assumption, the existence of Nash equilibrium of the given networked evolutionary games is proved and a free-type strategy sequence is designed for the convergence to the Nash equilibrium. Finally, an illustrative example is worked out to support the obtained new results.
基金supported partly by National Natural Science Foundation of China(Nos.61074114 and 61273013)
文摘This paper considers the modeling and convergence of hyper-networked evolutionary games （HNEGs）. In an HNEG the network graph is a hypergraph, which allows the fundamental network game to be a multi-player one. Using semi-tensor product of matrices and the fundamental evolutionary equation, the dynamics of an HNEG is obtained and we extend the results about the networked evolutionary games to show whether an HNEG is potential and how to calculate the potential. Then we propose a new strategy updating rule, called the cascading myopic best response adjustment rule （MBRAR）, and prove that under the cascading MBRAR the strategies of an HNEG will converge to a pure Nash equilibrium. An example is presented and discussed in detail to demonstrate the theoretical and numerical results.
基金supported by the Foundation for Innovative Research Groups of the National Natural Science Foundation of China(Grant No.61521003)the National Basic Research Program of China(2012CB315901,2013CB329104)+2 种基金the National Natural Science Foundation of China(Grant No.61372121,61309020,61309019)the National High-Tech Research&Development Program of China(Grant No.2013AA013505)the National Science and Technology Support Program Project(Grant No.2014BAH30B01)
文摘Elastic control could balance the distributed control plane in Software-Defined Networking(SDN). Dynamic switch migration has been proposed to achieve it. However, existing schemes mainly focus on how to execute migration operation, but not why. This paper designs a decision-making mechanism based on zero-sum game theory to reelect a new controller as the master for migrated switches. It first chooses a switch for migration in the heavy controller which invites its neighbors as the game players to compete for the master role of this switch in the game-playing field(GPF) which is an occasional and loose domain for game-playing. Second, based on the concept of GPF, we design a decentralized strategy to play the game and determine which player as the final master. We implement it by extending the Open Flow protocol. Finally, numerical results demonstrate that our distributed strategy can approach elastic control plane with better performance.
文摘Energy saving is the most important issue in research and development for wireless sensor networks. A power control mechanism can reduce the power consumption of the whole network. Because the character of wireless sensor networks is restrictive energy, this paper proposes a distributed power control algorithm based on game theory for wireless sensor networks which objects of which are reducing power consumption and decreasing overhead and increasing network lifetime. The game theory and OPNET simulation shows that the power control algorithm converges to a Nash Equilibrium when decisions are updated according to a better response dynamic.
基金supported by the National Science and Technology Major Project of China(2013ZX03005007-004)the National Natural Science Foundation of China(6120101361671179)
文摘Device to device(D2 D) multi-hop communication in multicast networks solves the contradiction between high speed requirements and limited bandwidth in regional data sharing communication services. However, most networking models demand a large control overhead in eNodeB. Moreover, the topology should be calculated again due to the mobility of terminals, which causes the long delay. In this work, we model multicast network construction in D2 D communication through a fuzzy mathematics and game theory based algorithm. In resource allocation, we assume that user equipment(UE) can detect the available frequency and the fuzzy mathematics is introduced to describe an uncertain relationship between the resource and UE distributedly, which diminishes the time delay. For forming structure, a distributed myopic best response dynamics formation algorithm derived from a novel concept from the coalitional game theory is proposed, in which every UE can self-organize into stable structure without the control from eNodeB to improve its utilities in terms of rate and bit error rate(BER) while accounting for a link maintenance cost, and adapt this topology to environmental changes such as mobility while converging to a Nash equilibrium fast. Simulation results show that the proposed architecture converges to a tree network quickly and presents significant gains in terms of average rate utility reaching up to 50% compared to the star topology where all of the UE is directly connected to eNodeB.
基金supported by the National Basic Research Program of China (No 2006CB705500)the National Natural Science Foundation of China (Grant Nos 60744003, 10635040, 10532060 and 10472116)the Specialized Research Fund for the Doctoral Program of Higher Education of China
文摘We study the evolutionary snowdrift game in a heterogeneous Newman-Watts small-world network. The heterogeneity of the network is controlled by the number of hubs. It is found that the moderate heterogeneity of the network can promote the cooperation best. Besides, we study how the hubs affect the evolution of cooperative behaviours of the heterogeneous Newman-Watts small-world network. Simulation results show that both the initial states of hubs and the connections between hubs can play an important role. Our work gives a further insight into the effect of hubs on the heterogeneous networks.
文摘The exact evolutionary history of any set of biological taxa is unknown, and all phylogenetic reconstructions are approximations. The problem becomes harder when one must consider a mix of vertical and lateral phylogenetic signals. In this paper we propose a game theoretic approach to constructing biological networks. The key hypothesis is that evolution is driven by distinct mechanisms that seek to maximize two competing objectives, taxonomic conservation and diversity. One branch of the mathematical theory of games is brought to bear. It translates this evolutionary game hypothesis into a mathematical model in two-player zero-sum games, with the zero-sum assumption conforming to one of the fundamental constraints in nature in mass and energy conservation. We demonstrate why and how a mechanistic and localized adaptation to seek out greater information for conservation and diversity may always lead to a global Nash equilibrium in phylogenetic affinity. Our game theoretic method, referred to as bioinformatic game theory, is used to construct network clusters. As an example, we applied this method to clustering of a multidomain protein family. The protein clusters identified were consistent with known protein subfamilies, indicating that this game-theoretic approach provides a new framework in biological sequence analysis, especially in studying gene-genome and domain-protein relationships.
文摘This paper investigates the networked evolutionary model based on snow-drift game with the strategy of rewards and penalty. Firstly, by using the semi-tensor product of matrices approach, the mathematical model of the networked evolutionary game is built. Secondly, combined with the matrix expression of logic, the mathematical model is expressed as a dynamic logical system and next converted into its evolutionary dynamic algebraic form. Thirdly, the dynamic evolution process is analyzed and the final level of cooperation is discussed. Finally, the effects of the changes in the rewarding and penalty factors on the level of cooperation in the model are studied separately, and the conclusions are verified by examples.
基金supported by the National Natural Science Foundation of China (No.61074165 and No.61273064)Jilin Provincial Science & Technology Department Key Scientific and Technological Project (No.20140204034GX)Jilin Province Development and Reform Commission Project (No.2015Y043)
文摘Wireless Body Area Network(WBAN) is an emerging technology to provide real-time health monitoring and ubiquitous healthcare services. In many applications, multiple wireless body area networks have to coexist in a small area, resulting in serious inter-network interference. This not only reduces network reliability that is especially important in emergency medical applications, but also consumes more power of WBANs. In this paper, an inter-network interference mitigation approach based on a power control algorithm is proposed. Power control is modeled as a non-cooperative game, in which both inter-network interference and energy efficiency of WBANs are considered. The existence and uniqueness of Nash Equilibrium in the game are proved, and an optimal scheme based on best response is proposed to find its Nash Equilibrium. By coordinating the transmission power levels among networks under interference environment, the total system throughput can be increased with minimum power consumed. The effectiveness of the proposed method has been illustrated by simulation results, where the performance of the proposed approach is evaluated in terms of overall utility and power efficiency and convergence speed.
基金supported by the National Natural Science Fundation of China (60974082 60874085)+2 种基金the Fundamental Research Funds for the Central Universities (K50510700004)the Technology Plan Projects of Guangdong Province (20110401)the Team Project of Hanshan Normal University (LT201001)
文摘To avoid uneven energy consuming in wireless sen- sor networks, a clustering routing model is proposed based on a Bayesian game. In the model, Harsanyi transformation is introduced to convert a static game of incomplete information to the static game of complete but imperfect information. In addition, the existence of Bayesian nash equilibrium is proved. A clustering routing algorithm is also designed according to the proposed model, both cluster head distribution and residual energy are considered in the design of the algorithm. Simulation results show that the algorithm can balance network load, save energy and prolong network lifetime effectively.
基金supported by The National Basic Research Program of China (973) (Grant No. 2012CB315901, 2013CB329104)The National Natural Science Foundation of China (Grant No. 61521003, 61372121, 61309019, 61572519, 61502530)The National High Technology Research and Development Program of China (863) (Grant No. 2015AA016102)
文摘To address the issues that middleboxes as a fundamental part of today's networks are facing, Network Function Virtualization(NFV)has been recently proposed, which in essence asserts to migrate hardware-based middleboxes into software-based virtualized function entities.Due to the demands of virtual services placement in NFV network environment, this paper models the service amount placement problem involving with the resources allocation as a cooperative game and proposes the placement policy by Nash Bargaining Solution(NBS). Specifically,we first introduce the system overview and apply the rigorous cooperative game-theoretic guide to build the mathematical model, which can give consideration to both the responding efficiency of service requirements and the allocation fairness.Then a distributed algorithm corresponding to NBS is designed to achieve predictable network performance for virtual instances placement.Finally, with simulations under various scenarios,the results show that our placement approach can achieve high utilization of network through the analysis of evaluation metrics namely the satisfaction degree and fairness index. With the suitable demand amount of services, the average values of two metrics can reach above 90%. And by tuning the base placement, our solution can enable operators to flexibly balance the tradeoff between satisfaction and fairness of resourcessharing in service platforms.
基金supported in part by the National Natural Science Foundation of China (61771120)the Fundamental Research Funds for the Central Universities (N171602002)
文摘With the explosive growth of highspeed wireless data demand and the number of mobile devices, fog radio access networks(F-RAN) with multi-layer network structure becomes a hot topic in recent research. Meanwhile, due to the rapid growth of mobile communication traffic, high cost and the scarcity of wireless resources, it is especially important to develop an efficient radio resource management mechanism. In this paper, we focus on the shortcomings of resource waste, and we consider the actual situation of base station dynamic coverage and user requirements. We propose a spectrum pricing and allocation scheme based on Stackelberg game model under F-RAN framework, realizing the allocation of resource on demand. This scheme studies the double game between the users and the operators, as well as between the traditional operators and the virtual operators, maximizing the profits of the operators. At the same time, spectrum reuse technology is adopted to improve the utilization of network resource. By analyzing the simulation results, it is verified that our proposed scheme can not only avoid resource waste, but also effectively improve the operator's revenue efficiency and overall network resource utilization.
基金supported by National Science Foundation Project of P. R. China (No.61501026,U1603116)the Fundamental Research Funds for the Central Universities (No.FRF-TP-15-032A1)
文摘In this paper, we investigate the link resource management problem for optical networks, to achieve the resource cost during the information transmission. We use the differential game to formulate the cost control problem for the link resource management, to minimize the resource allocation cost functions, which dynamic behaviours are described by differential equations. Each link controls its transmission bandwidth based on the Nash equilibriums of the differential game. The effectiveness of the proposed model is given through numerical simulations.
文摘In this paper, we carry out QoE (Quality of Experience) assessment of fairness between players in a networked balloon bursting game with olfactory and haptic senses. We also make a comparison of the fairness among different types of networked games with olfactory and haptic senses in the assessment. Then, we clarify the differences owing to usage of olfactory and haptic senses among the games. As a result, we illustrate that the fairness is largely affected by the delay difference, and we also demonstrate that the allowable range depends on the type of games, type of senses which are employed in the games, and the play methods.
文摘In January 2010,the State Council of China decided to speed up the convergence of the telecommunications network,cable network and Internet network.That means the government-led practical exploration of the networks convergence.The convergence is related to the entities in the fields of telecommunications,broadcasting and the Internet industry.The authors apply the static game theory to analyze the games among the players in the fields of telecommunications and broadcasting,and point out that the games would strengthen the network infrastructures,promote the development of related industries,and profoundly influence and change the ways of thinking and social management in China.At last,the paper puts forward some policy recommendations.
