{"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}
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.