排队网络最优路由的马尔可夫博弈方法

{"title":"排队网络最优路由的马尔可夫博弈方法","authors":"E. Altman","doi":"10.1007/978-1-4612-1592-9_9","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":280771,"journal":{"name":"Game Theory and Information","volume":"36 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":"{\"title\":\"A MARKOV GAME APPROACH FOR OPTIMAL ROUTING INTO A QUEUEING NETWORK\",\"authors\":\"E. Altman\",\"doi\":\"10.1007/978-1-4612-1592-9_9\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":280771,\"journal\":{\"name\":\"Game Theory and Information\",\"volume\":\"36 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"13\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Game Theory and Information\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/978-1-4612-1592-9_9\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Game Theory and Information","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/978-1-4612-1592-9_9","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}