具有最小-最大区间收益的单领导多随从对策纳什均衡的存在性

IF 6.8 1区 计算机科学 0 COMPUTER SCIENCE, INFORMATION SYSTEMS
Daping Zhang , Yanlong Yang , Xicai Deng
{"title":"具有最小-最大区间收益的单领导多随从对策纳什均衡的存在性","authors":"Daping Zhang ,&nbsp;Yanlong Yang ,&nbsp;Xicai Deng","doi":"10.1016/j.ins.2025.122691","DOIUrl":null,"url":null,"abstract":"<div><div>In decision-making problems with hierarchical structures, leader–follower games are highly prevalent. As a core concept in game theory, the existence of Nash equilibrium is crucial. However, in reality, complex uncertainties often lead to imprecise game outcomes, and interval representations are an effective tool for capturing such uncertainties. To address the issue of imprecise payoffs in complex environments, this paper proposes the concept of min-max interval (for short, MMI) and studies the existence of Nash equilibrium in single-leader multiple-follower (for short, SLMF) games with MMI payoffs. MMI is an appropriate extension of the traditional interval-providing a more flexible tool for representing uncertain payoffs. We propose an MMI expected payoff ranking method to address the issue of players ranking MMIs. Based on this, operational rules for MMIs and concepts such as limits, continuity, and concavity of MMI-valued functions (for short, MIVFs) are defined. After extending key theorems of real-valued functions to the case of MIVFs, we combine these extended theorems with set-valued mapping theory and Kakutani’s fixed point theorem to prove the existence of Nash equilibrium in SLMF MMI-valued games. Additionally, we compare existing works to verify the innovativeness of the proposed method and provide numerical examples to demonstrate its applicability.</div></div>","PeriodicalId":51063,"journal":{"name":"Information Sciences","volume":"723 ","pages":"Article 122691"},"PeriodicalIF":6.8000,"publicationDate":"2025-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Existence of nash equilibrium in single-leader multiple-follower games with min-max interval payoffs\",\"authors\":\"Daping Zhang ,&nbsp;Yanlong Yang ,&nbsp;Xicai Deng\",\"doi\":\"10.1016/j.ins.2025.122691\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>In decision-making problems with hierarchical structures, leader–follower games are highly prevalent. As a core concept in game theory, the existence of Nash equilibrium is crucial. However, in reality, complex uncertainties often lead to imprecise game outcomes, and interval representations are an effective tool for capturing such uncertainties. To address the issue of imprecise payoffs in complex environments, this paper proposes the concept of min-max interval (for short, MMI) and studies the existence of Nash equilibrium in single-leader multiple-follower (for short, SLMF) games with MMI payoffs. MMI is an appropriate extension of the traditional interval-providing a more flexible tool for representing uncertain payoffs. We propose an MMI expected payoff ranking method to address the issue of players ranking MMIs. Based on this, operational rules for MMIs and concepts such as limits, continuity, and concavity of MMI-valued functions (for short, MIVFs) are defined. After extending key theorems of real-valued functions to the case of MIVFs, we combine these extended theorems with set-valued mapping theory and Kakutani’s fixed point theorem to prove the existence of Nash equilibrium in SLMF MMI-valued games. Additionally, we compare existing works to verify the innovativeness of the proposed method and provide numerical examples to demonstrate its applicability.</div></div>\",\"PeriodicalId\":51063,\"journal\":{\"name\":\"Information Sciences\",\"volume\":\"723 \",\"pages\":\"Article 122691\"},\"PeriodicalIF\":6.8000,\"publicationDate\":\"2025-09-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Information Sciences\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0020025525008242\",\"RegionNum\":1,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"0\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information Sciences","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0020025525008242","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"0","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

在具有等级结构的决策问题中,领导者-追随者游戏非常普遍。作为博弈论的核心概念,纳什均衡的存在性至关重要。然而,在现实中,复杂的不确定性往往会导致不精确的游戏结果,而区间表示是捕捉这种不确定性的有效工具。为了解决复杂环境下收益不精确的问题,本文提出了最小-最大区间(简称MMI)的概念,并研究了具有MMI收益的单领导多追随者(简称SLMF)对策中纳什均衡的存在性。MMI是传统区间的适当扩展,为表示不确定收益提供了更灵活的工具。我们提出了一种MMI期望收益排序方法来解决玩家对MMI进行排序的问题。在此基础上,定义了mmi的运算规则和mmi值函数(简称mivf)的极限、连续性、凹性等概念。将实值函数的关键定理推广到mivf的情况下,将这些定理与集值映射理论和Kakutani不动点定理结合起来,证明了SLMF mmi值对策中Nash均衡的存在性。此外,我们比较了现有的工作,以验证所提出的方法的创新性,并提供数值算例来证明其适用性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Existence of nash equilibrium in single-leader multiple-follower games with min-max interval payoffs
In decision-making problems with hierarchical structures, leader–follower games are highly prevalent. As a core concept in game theory, the existence of Nash equilibrium is crucial. However, in reality, complex uncertainties often lead to imprecise game outcomes, and interval representations are an effective tool for capturing such uncertainties. To address the issue of imprecise payoffs in complex environments, this paper proposes the concept of min-max interval (for short, MMI) and studies the existence of Nash equilibrium in single-leader multiple-follower (for short, SLMF) games with MMI payoffs. MMI is an appropriate extension of the traditional interval-providing a more flexible tool for representing uncertain payoffs. We propose an MMI expected payoff ranking method to address the issue of players ranking MMIs. Based on this, operational rules for MMIs and concepts such as limits, continuity, and concavity of MMI-valued functions (for short, MIVFs) are defined. After extending key theorems of real-valued functions to the case of MIVFs, we combine these extended theorems with set-valued mapping theory and Kakutani’s fixed point theorem to prove the existence of Nash equilibrium in SLMF MMI-valued games. Additionally, we compare existing works to verify the innovativeness of the proposed method and provide numerical examples to demonstrate its applicability.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Information Sciences
Information Sciences 工程技术-计算机:信息系统
CiteScore
14.00
自引率
17.30%
发文量
1322
审稿时长
10.4 months
期刊介绍: Informatics and Computer Science Intelligent Systems Applications is an esteemed international journal that focuses on publishing original and creative research findings in the field of information sciences. We also feature a limited number of timely tutorial and surveying contributions. Our journal aims to cater to a diverse audience, including researchers, developers, managers, strategic planners, graduate students, and anyone interested in staying up-to-date with cutting-edge research in information science, knowledge engineering, and intelligent systems. While readers are expected to share a common interest in information science, they come from varying backgrounds such as engineering, mathematics, statistics, physics, computer science, cell biology, molecular biology, management science, cognitive science, neurobiology, behavioral sciences, and biochemistry.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信