线路上的顺序路由游戏:发送还是中继?

Majed Haddad, E. Altman, Julien Gaillard
{"title":"线路上的顺序路由游戏:发送还是中继?","authors":"Majed Haddad, E. Altman, Julien Gaillard","doi":"10.1109/ICCITECHNOL.2012.6285812","DOIUrl":null,"url":null,"abstract":"In this paper, we study a sequential dynamic routing game on a line where the decision of a user is spatio-temporal control. Each user ships its demand over time on a shared resource. We address the case where only one user arrives at each time epoch. The state of a player evolves according to whether he decides to transmit or not. We provide explicit expressions of the equilibrium of such systems and compare them to the global optimum case. In particular, we compute the price of anarchy of such schemes and identify a Braess-type paradox in the context of sequential routing game.","PeriodicalId":435718,"journal":{"name":"2012 International Conference on Communications and Information Technology (ICCIT)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Sequential routing game on the line: Transmit or relay?\",\"authors\":\"Majed Haddad, E. Altman, Julien Gaillard\",\"doi\":\"10.1109/ICCITECHNOL.2012.6285812\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we study a sequential dynamic routing game on a line where the decision of a user is spatio-temporal control. Each user ships its demand over time on a shared resource. We address the case where only one user arrives at each time epoch. The state of a player evolves according to whether he decides to transmit or not. We provide explicit expressions of the equilibrium of such systems and compare them to the global optimum case. In particular, we compute the price of anarchy of such schemes and identify a Braess-type paradox in the context of sequential routing game.\",\"PeriodicalId\":435718,\"journal\":{\"name\":\"2012 International Conference on Communications and Information Technology (ICCIT)\",\"volume\":\"37 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-06-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 International Conference on Communications and Information Technology (ICCIT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCITECHNOL.2012.6285812\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 International Conference on Communications and Information Technology (ICCIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCITECHNOL.2012.6285812","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

本文研究了一个用户决策为时空控制的线路上的顺序动态路由博弈问题。随着时间的推移,每个用户在共享资源上发送其需求。我们处理每个时间元只有一个用户到达的情况。球员的状态根据他是否决定传输而变化。我们给出了这种系统平衡的显式表达式,并将其与全局最优情况进行了比较。特别地,我们计算了这些方案的无政府状态的代价,并在顺序路由博弈的背景下识别了一个braess型悖论。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Sequential routing game on the line: Transmit or relay?
In this paper, we study a sequential dynamic routing game on a line where the decision of a user is spatio-temporal control. Each user ships its demand over time on a shared resource. We address the case where only one user arrives at each time epoch. The state of a player evolves according to whether he decides to transmit or not. We provide explicit expressions of the equilibrium of such systems and compare them to the global optimum case. In particular, we compute the price of anarchy of such schemes and identify a Braess-type paradox in the context of sequential routing game.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术文献互助群
群 号:481959085
Book学术官方微信