检索结果-南通市图书馆

Multiple Relay Selection Based on Game Theory in Cooperative Cognitive Radio Networks

在线全文

学校读者我要写书评

暂无评论

Chinese Journal of Electronics 2017年第3期26卷 624-633页

作者： WU Renyong WANG Wenru LI Renfa The College of Information Science and Engineering Hunan University

Due to the inefficiency of traditional fixed spectrum allocation policies,the paradox of apparent spectrum scarcity occurs while most of the bands are underutilized.This has prompted proposals for Dynamic spectrum sharing(DSS),which explains why Cognitive radio network(CRN)has been widely accepted as a promising approach to settle inefficient usage of scarce available radio spectrum.As a subset of DSS,Dynamic spectrum leasing(DSL)strategy has been proposed based on game idea,where Primary user(PU)has an incentive to allow Cognitive users(CUs)to access its licensed spectrum for a fraction of time in exchange for revenue.This paper proposes an approach,named multiple relay selection based on Game theory(GTMRS),to optimize the utilities of PU and CUs as a whole,where a pricing-based spectrum leasing mechanism is applied.While the parameter price c is jointly determined by PU and CUs,all selected cognitive user’s optimal cooperative powers can be satisfied through a non-cooperative game among themselves.Numerical results show that more CUs are involved in the cooperation and both utilities of PU and CUs as a whole are improved,which means the whole system throughput is increased.

关键词： Cognitive radio networks Dynamic spectrum leasing Cooperative transmission nash equilibrium

Electromagnetic buffer optimization based on nash game

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Acta Mechanica Sinica 2021年第8期37卷 1331-1344,I0003页

作者： Fengjie Xu Guolai Yang Zixuan Li Liqun Wang Quanzhao Sun School of Mechanical Engineering Nanjing University of Science and TechnologyNanjing210094People’s Republic of China Shandong University of Technology Shandong Province Zibo City255000People’s Republic of China

Aiming at the problem of unstable buffering process of electromagnetic buffer(EMB)under intensive impact load,a three-segment electromagnetic buffer is proposed.The inner tube and air-gap of EMB are divided into three segments.The finite element analysis and impact test results show that the resultant resistance force(RRF)curve has two hump-shaped peaks,which is the reason for the unstable buffering process.In order to stabilize the buffering process,a multi-objective optimization design method of EMB based on nash game theory is proposed.Firstly,the optimization model is established by taking the two peaks of the RRF curve and the maximum buffer displacement as the optimization objectives.Secondly,the multi-objective optimization model is transformed into a game model by sensitivity analysis and fuzzy clustering.Then,a nash equilibrium solution strategy of EMB nash game model based on symmetric elitist information exchange is proposed,which integrates gene expression programming(GEP)surrogate model and genetic algorithm(GA)as an optimization solver.Finally,the nash equilibrium of the game model is obtained.The results show that the smoothness of the RRF curve has been significantly improved,which proves the effectiveness of the game strategy.

关键词： Electromagnetic buffer Multi-objective optimization nash game nash equilibrium

Symmetry-based decomposition of finite games

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2019年第1期62卷 164-176页

作者： Changxi LI Fenghua HE Ting LIU Daizhan CHENG School of Astronautics Harbin Institute of Technology Key Laboratory of Systems and Control Academy of Mathematics and Systems SciencesChinese Academy of Sciences

The symmetry-based decompositions of finite games are investigated. First, the vector space of finite games is decomposed into a symmetric subspace and an orthogonal complement of the symmetric subspace. The bases of the symmetric subspace and those of its orthogonal complement are presented.Second, the potential-based orthogonal decompositions of two-player symmetric/antisymmetric games are presented. The bases and dimensions of all dual decomposed subspaces are revealed. Finally, some properties of these decomposed subspaces are obtained.

关键词： potential game symmetric game decomposition nash equilibrium semi-tensor product of matrices

A secure rational quantum state sharing protocol

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2018年第2期61卷 204-215页

作者： Zhao DOU Gang XU Xiu-Bo CHEN Xin LIU Yi-Xian YANG Information Security Center State Key Laboratory of Networking and Switching TechnologyBeijing University of Posts and Telecommunications School of Software Engineering Beijing University of Posts and Telecommunications School of Information Engineering Inner Mongolia University of Science and Technology School of Computer Science Shaanxi Normal University Gui Zhou University Guizhou Provincial Key Laboratory of Public Big Data

A novel rational protocol to share two arbitrary qubits among multiple parties is investigated in this paper. First, the protocol is presented, which is learned from Li et al.’s protocol. Second, the utility,security, correctness, fairness, nash equilibrium, and Pareto optimality of our scheme are discussed in detail,where the utility, correctness, and fairness of rational quantum state sharing protocols are creatively given because the agent who recovers the state plays a different and more important role. Another important point is that assumptions about our protocol are more practical and suitable than existing protocols.

关键词： rational quantum state sharing nash equilibrium secure correct

nash EQUILIBRIA WITHOUT CONTINUITY OF THE CHOICE RULES

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Acta Mathematica Scientia 2011年第4期31卷 1535-1540页

作者： José C. R. Alcantud Facultad de Economía y Empresa Universidad de Salamanca Campus Miguel de Unamuno E 37007 Salamanca

The proposal in Alcantud and Alo′s-Ferrer [1], where players that express their tastes according to choice rules facing a competitive situation, is further exploited here. We prove that, under lack of continuity of the choice rules it is also possible to ensure the existence of equilibrium. We shall appeal to general situations that are fulfilled by well-established models, where players have non-transitive preferences of various types.

关键词： nash equilibrium choice rules continuity Kakutani’s theorem

Modeling and game strategy analysis of suppressing IADS for multiple fighters' cooperation

在线全文

学校读者我要写书评

暂无评论

Journal of Systems Engineering and Electronics 2018年第2期29卷 296-304页

作者： LI Qiuni YANG Rennong LI Haoliang ZHANG Huan FENG Chao Aeronautics and Astronautics Engineering College Air Force Engineering University

This paper addresses the problem of suppression of the integrated air defense system(IADS) by multiple fighters’ cooperation. Considering the dynamic changing of the number of the nodes in the operational process, a profit model for the influence of the mission’s cost for the whole system is developed for both offense and defensive sides. The scenario analysis is given for the process of suppressing the IADS by multiple fighters. Based on this scenario analysis, the modeling method and the specific expression for the payoff function are proposed in four cases for each node. Moreover, a distributed virtual learning algorithm is designed for the n-person and n-strategy game, and the mixed strategy nash equilibrium(MSNE) of this game can be solved from the n × m × 3-dimensional profit space. Finally, the simulation examples are provided to demonstrate the effectiveness of the proposed model and the game algorithm.

关键词： cooperative suppression non-cooperative game nash equilibrium virtual learning

Resource Allocation Based on DEA and Non-Cooperative Game

在线全文

学校读者我要写书评

暂无评论

Journal of Systems Science & Complexity 2021年第6期34卷 2231-2249页

作者： WANG Menghan LI Lin DAI Qianzhi SHI Fangnan Department of Statistics and Finance The School of ManagementUniversity of Science and Technology of ChinaHefei 230026China Academy of Mathematics and Systems Science Chinese Academy of ScienceBeijing 100190China School of Economics Hefei University of TechnologyHefei 230009China Center for Industrial Information and Economic Research Hefei University of TechnologyHefei 23QQQ9China

Resource allocation is one of the most important applications of data envelopment analysis(DEA).Usually,the resource to be allocated is directly related to the interests of decision-making units(DMUs),thus the dynamic non-cooperative game is one of the representative behaviours in the allocation process.However,it is rarely considered in the previous DEA-based allocation studies,which may reduce the acceptability of the allocation plan.Therefore,this paper proposes a DEA-based resource allocation method considering the dynamic non-cooperative game behaviours of DMUs.The authors first deduce the efficient allocation set under the framework of variable return to scale(VRS)and build the allocation model subjecting to the allocation set.Then an iteration algorithm based on the concept of the non-cooperative game is provided for generating the optimal allocation plan.Several interesting characteristics of the algorithm are proved,including i)the algorithm is convergent,ii)the optimal allocation plan is a unique nash equilibrium point,and iii)the optimal allocation plan is unique no matter which positive value the initial allocation takes.Some advantages of the allocation plan have been found.For example,the allocation plan is more balanced,has more incentives and less outliers,compared with other DEA-based allocation plans.Finally,the proposed method is applied to allocate the green credit among the 30 Chinese iron and steel enterprises,and the results highlight the applicability of the allocation method and solution approach.Therefore,the approach can provide decision makers with a useful resource allocation tool from the perspective of dynamic non-cooperative game.

关键词： Data envelopment analysis(DEA) game theory green credit nash equilibrium resource allocation

Distributed projection subgradient algorithm for two-network zero-sum game with random sleep scheme

在线全文

学校读者我要写书评

暂无评论

Control Theory and Technology 2021年第3期19卷 405-417页

作者： Hongyun Xiong Jiangxiong Han Xiaohong Nian Shiling Li School of Automation Central South UniversityChangsha410075China

In this paper,a zero-sum game nash equilibrium computation problem with a common constraint set is investigated under two time-varying multi-agent subnetworks,where the two subnetworks have opposite payoff function.A novel distributed projection subgradient algorithm with random sleep scheme is developed to reduce the calculation amount of agents in the process of computing nash equilibrium.In our algorithm,each agent is determined by an independent identically distributed Bernoulli decision to compute the subgradient and perform the projection operation or to keep the previous consensus estimate,it effectively reduces the amount of computation and calculation time.Moreover,the traditional assumption of stepsize adopted in the existing methods is removed,and the stepsizes in our algorithm are randomized diminishing.Besides,we prove that all agents converge to nash equilibrium with probability 1 by our algorithm.Finally,a simulation example verifies the validity of our algorithm.

关键词： Zero-sum game nash equilibrium Time-varying multi-agent network Projection subgradient algorithm Random sleep scheme

A Two-Player Coalition Cooperative Scheme for the Bodyguard Allocation Problem

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Journal of Computer Science & Technology 2018年第4期33卷 823-837页

作者： Jose Alberto Fernandez-Zepedu Daniel Brubeck-Salcedo Daniel Fajardo-Delgado Hector Zatarain-Aceves Department of Computer Science Center for Scientific Research and Higher Education of Ensenada Ensenada BC 22860 Mexico Department of Systems and Computation Instituto Technol6gico de Ciudad Guzmdn Guzmdn JAL 49100 Mexico

We address the bodyguard allocation problem （BAP）, an optimization problem that illustrates the conflict of interest between two classes of processes with contradictory preferences within a distributed system. While a class of processes prefers to minimize its distance to a particular process called the root, the other class prefers to maximize it; at the same time, all the processes seek to build a communication spanning tree with the maximum social welfare. The two state-of-the-art algorithms for this problem always guarantee the generation of a spanning tree that satisfies a condition of nash equilibrium in the system; however, such a tree does not necessarily produce the maximum social welfare. In this paper, we propose a two-player coalition cooperative scheme for BAP, which allows some processes to perturb or break a nash equilibrium to find another one with a better social welfare. By using this cooperative scheme, we propose a new algorithm called FFC-BAPs for BAP. We present both theoretical and empirical analyses which show that this algorithm produces better quality approximate solutions than former algorithms for BAP.

关键词： bodyguard allocation problem coalitional game graph algorithm nash equilibrium