{"title":"Pseudo-Shapley value for weak games of threats","authors":"Daniel Li Li, Erfang Shan","doi":"10.1007/s10878-025-01319-x","DOIUrl":null,"url":null,"abstract":"<p>For a real number <span>\\(\\omega \\)</span>, a weak game of threats (<i>N</i>, <i>v</i>) consists of a set <i>N</i> of <i>n</i> players and a function <span>\\(v:2^N\\rightarrow \\mathbb {R}\\)</span> such that <span>\\(\\omega v(\\emptyset )+(1-\\omega )v(N)=0\\)</span>, where <span>\\(v(\\emptyset )\\ne 0\\)</span> possibly. It is shown that there exists a unique value with respect to <span>\\(\\omega \\)</span> for weak games of threats that satisfies efficiency, linearity, symmetry and the null player property.</p>","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":"42 1","pages":""},"PeriodicalIF":1.1000,"publicationDate":"2025-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Combinatorial Optimization","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s10878-025-01319-x","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0
Abstract
For a real number \(\omega \), a weak game of threats (N, v) consists of a set N of n players and a function \(v:2^N\rightarrow \mathbb {R}\) such that \(\omega v(\emptyset )+(1-\omega )v(N)=0\), where \(v(\emptyset )\ne 0\) possibly. It is shown that there exists a unique value with respect to \(\omega \) for weak games of threats that satisfies efficiency, linearity, symmetry and the null player property.
期刊介绍:
The objective of Journal of Combinatorial Optimization is to advance and promote the theory and applications of combinatorial optimization, which is an area of research at the intersection of applied mathematics, computer science, and operations research and which overlaps with many other areas such as computation complexity, computational biology, VLSI design, communication networks, and management science. It includes complexity analysis and algorithm design for combinatorial optimization problems, numerical experiments and problem discovery with applications in science and engineering.
The Journal of Combinatorial Optimization publishes refereed papers dealing with all theoretical, computational and applied aspects of combinatorial optimization. It also publishes reviews of appropriate books and special issues of journals.