检索结果-南通市图书馆

polynomial time Method for Solving Nash Equilibria of Zero-Sum Games

American Journal of Computational Mathematics 2021年第1期11卷 23-30页

作者： Yoshihiro Tanaka Mitsuru Togashi Faculty of Economics and Business Hokkaido University Sapporo Japan Graduate School of Accountancy Waseda University Tokyo Japan

There are a few studies that focus on solution methods for finding a Nash equilibrium of zero-sum games. We discuss the use of Karmarkar’s interior point method to solve the Nash equilibrium problems of a zero-sum game, and prove that it is theoretically a polynomial time algorithm. We implement the Karmarkar method, and a preliminary computational result shows that it performs well for zero-sum games. We also mention an affine scaling method that would help us compute Nash equilibria of general zero-sum games effectively.

关键词： Zero-Sum Games Nash Equilibria Karmarkar’s Method polynomial time

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Optimizing polynomial-time Solutions to a Network Weighted Vertex Cover Game

引用

IEEE/CAA Journal of Automatica Sinica 2023年第2期10卷 512-523页

作者： Jie Chen Kaiyi Luo Changbing Tang Zhao Zhang Xiang Li the Adaptive Networks and Control Laboratory Department of Electronic EngineeringFudan UniversityShanghai 200433China the College of Mathematics and Computer Science Zhejiang Normal UniversityJinhua 321004 Yuxi Middle School Taizhou 317399China IEEE the College of Physics and Electronics Information Engineering Zhejiang Normal UniversityJinhua 321004China the College of Mathematics and Computer Science Zhejiang Normal UniversityJinhua 321004China the Adaptive Networks and Control Laboratory Department of Electronic EngineeringFudan UniversityShanghai 200433 the Institute of Complex Networks and Intelligent Systems Shanghai Research Institute for Intelligent Autonomous SystemsTongji UniversityShanghai 201210China

Weighted vertex cover(WVC)is one of the most important combinatorial optimization *** this paper,we provide a new game optimization to achieve efficiency and time of solutions for the WVC problem of weighted *** first model the WVC problem as a general game on weighted *** the framework of a game,we newly define several cover states to describe the WVC ***,we reveal the relationship among these cover states of the weighted network and the strict Nash equilibriums(SNEs)of the ***,we propose a game-based asynchronous algorithm(GAA),which can theoretically guarantee that all cover states of vertices converging in an SNE with polynomial ***,we improve the GAA by adding 2-hop and 3-hop adjustment mechanisms,termed the improved game-based asynchronous algorithm(IGAA),in which we prove that it can obtain a better solution to the WVC problem than using a the ***,numerical simulations demonstrate that the proposed IGAA can obtain a better approximate solution in promising computation time compared with the existing representative algorithms.

关键词： Game-based asynchronous algorithm(GAA) game optimization polynomial time strict Nash equilibrium(SNE) weighted vertex cover(WVC)

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Notes on Liveness and Boundedness of Extended Strong Asymmetric Choice Nets Ⅱ

引用

Journal of Computer Science & Technology 2001年第5期16卷 426-433页

作者：焦莉陆维明 DivisionofComputerScience InstituteofMathematicsAcademyofMathematicsandSystemScienceTheChineseAcademyofSciencesBeijing100080P.R.China DivisionofComputerScience InstituteofMath

In this paper, the Extended Strong Asymmetric Choice Nets Ⅱ (ESACN Ⅱ), a subclass of Asymmetric Choice Nets (ACN) including Extended Free Choice Nets (EFCN) and Strong Asymmetric Choke Nets Ⅱ (SACN Ⅱ, is presented. A necessary and sufficient condition for liveness of ESACN Ⅱ is proposed. Moreover, a criterion is introduced, which is necessary and sufficient for judgement of liveness and boundedness of ESACN Ⅱ. Meanwhile a polynomial time algorithm is given to decide liveness and boundedness for ESACN Ⅱ.

关键词： asymmetric choice net (ACN) extended strong asymmetric choice nets Ⅱ (ESACN Ⅱ) liveness boundedness algorithm polynomial time

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

欢迎您,

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：