{"title":"Existence of nash equilibrium in single-leader multiple-follower games with min-max interval payoffs","authors":"Daping Zhang , Yanlong Yang , 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}
引用次数: 0
Abstract
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.
期刊介绍:
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.