Florian Horn, W. Thomas, N. Wallmeier, Martin Zimmermann
{"title":"请求-响应博弈的最优策略综合","authors":"Florian Horn, W. Thomas, N. Wallmeier, Martin Zimmermann","doi":"10.1051/ita/2015005","DOIUrl":null,"url":null,"abstract":"We show the existence and effective computability of optimal (even finite-state) winning strategies for request-response games in case the quality of a play is measured by the limit superior of the mean accumulated waiting times between requests and their responses.","PeriodicalId":438841,"journal":{"name":"RAIRO Theor. Informatics Appl.","volume":"49 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"16","resultStr":"{\"title\":\"Optimal strategy synthesis for request-response games\",\"authors\":\"Florian Horn, W. Thomas, N. Wallmeier, Martin Zimmermann\",\"doi\":\"10.1051/ita/2015005\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We show the existence and effective computability of optimal (even finite-state) winning strategies for request-response games in case the quality of a play is measured by the limit superior of the mean accumulated waiting times between requests and their responses.\",\"PeriodicalId\":438841,\"journal\":{\"name\":\"RAIRO Theor. Informatics Appl.\",\"volume\":\"49 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-06-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"16\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"RAIRO Theor. Informatics Appl.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1051/ita/2015005\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"RAIRO Theor. Informatics Appl.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1051/ita/2015005","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Optimal strategy synthesis for request-response games
We show the existence and effective computability of optimal (even finite-state) winning strategies for request-response games in case the quality of a play is measured by the limit superior of the mean accumulated waiting times between requests and their responses.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
