Pure Nash equilibria in weighted matroid congestion games with non-additive aggregation and beyond

IF 1 3区 数学 Q3 MATHEMATICS, APPLIED Discrete Applied Mathematics Pub Date : 2024-10-30 DOI:10.1016/j.dam.2024.10.017
Kenjiro Takazawa
{"title":"Pure Nash equilibria in weighted matroid congestion games with non-additive aggregation and beyond","authors":"Kenjiro Takazawa","doi":"10.1016/j.dam.2024.10.017","DOIUrl":null,"url":null,"abstract":"<div><div>Congestion games offer a primary model in the study of pure Nash equilibria in non-cooperative games, and a number of generalized models have been proposed in the literature. One line of generalization includes weighted congestion games, in which the cost of a resource is a function of the total weight of the players choosing that resource. Another line includes congestion games with mixed costs, in which the cost imposed on a player is a convex combination of the total cost and the maximum cost of the resources in her strategy. This model is further generalized to that of congestion games with non-additive aggregation. For the above models, the existence of a pure Nash equilibrium is proved under some assumptions, including the case in which the strategy space of each player is the base family of a matroid and the case in which the cost functions have a certain kind of monotonicity. In this paper, we deal with common generalizations of these two lines, namely weighted matroid congestion games with non-additive aggregation, and its further generalization. Our main technical contribution is a proof of the existence of pure Nash equilibria in these generalized models under a simplified assumption on the monotonicity, which provides a common extension of the previous results. We also present an extension on the existence of pure Nash equilibria in weighted matroid congestion games with mixed costs.</div></div>","PeriodicalId":50573,"journal":{"name":"Discrete Applied Mathematics","volume":"361 ","pages":"Pages 226-235"},"PeriodicalIF":1.0000,"publicationDate":"2024-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Applied Mathematics","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0166218X24004505","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0

Abstract

Congestion games offer a primary model in the study of pure Nash equilibria in non-cooperative games, and a number of generalized models have been proposed in the literature. One line of generalization includes weighted congestion games, in which the cost of a resource is a function of the total weight of the players choosing that resource. Another line includes congestion games with mixed costs, in which the cost imposed on a player is a convex combination of the total cost and the maximum cost of the resources in her strategy. This model is further generalized to that of congestion games with non-additive aggregation. For the above models, the existence of a pure Nash equilibrium is proved under some assumptions, including the case in which the strategy space of each player is the base family of a matroid and the case in which the cost functions have a certain kind of monotonicity. In this paper, we deal with common generalizations of these two lines, namely weighted matroid congestion games with non-additive aggregation, and its further generalization. Our main technical contribution is a proof of the existence of pure Nash equilibria in these generalized models under a simplified assumption on the monotonicity, which provides a common extension of the previous results. We also present an extension on the existence of pure Nash equilibria in weighted matroid congestion games with mixed costs.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
非加权聚合加权矩阵拥塞博弈中的纯纳什均衡及其他
拥挤博弈是研究非合作博弈中纯纳什均衡的一个主要模型,文献中也提出了许多广义模型。其中一种广义模型包括加权拥挤博弈,在这种博弈中,一种资源的成本是选择该资源的博弈者总权重的函数。另一个模型包括混合成本的拥堵博弈,在这种博弈中,棋手的成本是其策略中资源的总成本和最大成本的凸组合。这一模型被进一步归纳为非加总的拥挤博弈模型。对于上述模型,我们在一些假设条件下证明了纯纳什均衡的存在,包括每个博弈方的策略空间是一个矩阵的基族,以及成本函数具有某种单调性。在本文中,我们将讨论这两种情况的共同概括,即具有非加性聚合的加权矩阵拥塞博弈及其进一步概括。我们的主要技术贡献是在简化的单调性假设下证明了这些广义模型中纯纳什均衡的存在性,这是对之前结果的共同扩展。我们还对具有混合成本的加权矩阵拥塞博弈中纯纳什均衡的存在性进行了扩展。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Discrete Applied Mathematics
Discrete Applied Mathematics 数学-应用数学
CiteScore
2.30
自引率
9.10%
发文量
422
审稿时长
4.5 months
期刊介绍: The aim of Discrete Applied Mathematics is to bring together research papers in different areas of algorithmic and applicable discrete mathematics as well as applications of combinatorial mathematics to informatics and various areas of science and technology. Contributions presented to the journal can be research papers, short notes, surveys, and possibly research problems. The "Communications" section will be devoted to the fastest possible publication of recent research results that are checked and recommended for publication by a member of the Editorial Board. The journal will also publish a limited number of book announcements as well as proceedings of conferences. These proceedings will be fully refereed and adhere to the normal standards of the journal. Potential authors are advised to view the journal and the open calls-for-papers of special issues before submitting their manuscripts. Only high-quality, original work that is within the scope of the journal or the targeted special issue will be considered.
期刊最新文献
Multiplicity of signless Laplacian eigenvalue 2 of a connected graph with a perfect matching Rainbow short linear forests in edge-colored complete graph Resistance distances in generalized join graphs Partitions of Zm with identical representation functions Complexity of Maker–Breaker games on edge sets of graphs
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1