{"title":"回合制随机对策","authors":"A. Kucera","doi":"10.1017/CBO9780511973468.006","DOIUrl":null,"url":null,"abstract":"We give a taxonomy of winning objectives in stochastic\nturn-based games, discuss their basic properties, and present\nan overview of the existing results. A special attention is\ndevoted to games with infinitely many vertices.","PeriodicalId":431931,"journal":{"name":"Lectures in Game Theory for Computer Scientists","volume":"106 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"17","resultStr":"{\"title\":\"Turn-based stochastic games\",\"authors\":\"A. Kucera\",\"doi\":\"10.1017/CBO9780511973468.006\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We give a taxonomy of winning objectives in stochastic\\nturn-based games, discuss their basic properties, and present\\nan overview of the existing results. A special attention is\\ndevoted to games with infinitely many vertices.\",\"PeriodicalId\":431931,\"journal\":{\"name\":\"Lectures in Game Theory for Computer Scientists\",\"volume\":\"106 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"17\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Lectures in Game Theory for Computer Scientists\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1017/CBO9780511973468.006\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Lectures in Game Theory for Computer Scientists","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1017/CBO9780511973468.006","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
We give a taxonomy of winning objectives in stochastic
turn-based games, discuss their basic properties, and present
an overview of the existing results. A special attention is
devoted to games with infinitely many vertices.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
