Resource-Aware Cost-Sharing Methods for Scheduling Games

IF 0.7 4区 管理学 Q3 Engineering Military Operations Research Pub Date : 2023-04-12 DOI:10.1287/opre.2023.2434
G. Christodoulou, Vasilis Gkatzelis, A. Sgouritsa
{"title":"Resource-Aware Cost-Sharing Methods for Scheduling Games","authors":"G. Christodoulou, Vasilis Gkatzelis, A. Sgouritsa","doi":"10.1287/opre.2023.2434","DOIUrl":null,"url":null,"abstract":"In large distributed systems, ensuring the efficient utilization of the available resources is a very challenging task. Given limited information regarding the state of the system and no centralized control over the outcome, decentralized scheduling mechanisms are unable to enforce optimal utilization. To better understand such systems, some classic papers that introduced game theoretic models used the “price of anarchy” measure to evaluate the system’s performance. The paper “Resource-Aware Cost-Sharing Methods for Scheduling Games” by Christodoulou, Gkatzelis, and Sgouritsa overcomes some of the overly pessimistic results shown in this prior work by enhancing the scheduling mechanisms with access to some additional information regarding the state of the system: a “resource-aware” mechanism knows what machines are available in the system and uses this information to carefully incentivize the users toward more efficient Nash equilibrium outcomes.","PeriodicalId":49809,"journal":{"name":"Military Operations Research","volume":"51 1","pages":""},"PeriodicalIF":0.7000,"publicationDate":"2023-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Military Operations Research","FirstCategoryId":"91","ListUrlMain":"https://doi.org/10.1287/opre.2023.2434","RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Engineering","Score":null,"Total":0}
引用次数: 0

Abstract

In large distributed systems, ensuring the efficient utilization of the available resources is a very challenging task. Given limited information regarding the state of the system and no centralized control over the outcome, decentralized scheduling mechanisms are unable to enforce optimal utilization. To better understand such systems, some classic papers that introduced game theoretic models used the “price of anarchy” measure to evaluate the system’s performance. The paper “Resource-Aware Cost-Sharing Methods for Scheduling Games” by Christodoulou, Gkatzelis, and Sgouritsa overcomes some of the overly pessimistic results shown in this prior work by enhancing the scheduling mechanisms with access to some additional information regarding the state of the system: a “resource-aware” mechanism knows what machines are available in the system and uses this information to carefully incentivize the users toward more efficient Nash equilibrium outcomes.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于资源意识的游戏调度成本分担方法
在大型分布式系统中,确保可用资源的有效利用是一项非常具有挑战性的任务。由于关于系统状态的信息有限,并且没有对结果的集中控制,分散的调度机制无法实现最佳利用率。为了更好地理解这样的系统,一些引入博弈论模型的经典论文使用“无政府状态的价格”度量来评估系统的性能。Christodoulou、Gkatzelis和Sgouritsa的论文《调度博弈的资源感知成本共享方法》克服了之前研究中过于悲观的结果,通过访问有关系统状态的一些额外信息来增强调度机制:“资源感知”机制知道系统中有哪些机器可用,并使用这些信息来谨慎地激励用户走向更有效的纳什均衡结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Military Operations Research
Military Operations Research 管理科学-运筹学与管理科学
CiteScore
1.00
自引率
0.00%
发文量
0
审稿时长
>12 weeks
期刊介绍: Military Operations Research is a peer-reviewed journal of high academic quality. The Journal publishes articles that describe operations research (OR) methodologies and theories used in key military and national security applications. Of particular interest are papers that present: Case studies showing innovative OR applications Apply OR to major policy issues Introduce interesting new problems areas Highlight education issues Document the history of military and national security OR.
期刊最新文献
Optimal Routing Under Demand Surges: The Value of Future Arrival Rates Demand Estimation Under Uncertain Consideration Sets Optimal Routing to Parallel Servers in Heavy Traffic The When and How of Delegated Search A Data-Driven Approach to Beating SAA Out of Sample
×
引用
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