{"title":"动态冲突模型中最大保证收益的计算","authors":"S.A. Yevseyeva","doi":"10.1016/0041-5553(90)90023-L","DOIUrl":null,"url":null,"abstract":"<div><p>The conflict situations in question are described by repeated two-person bimatrix games. The problem is to determine the maximum guaranteed payoff to the first player. A numerical algorithm computing the solution is constructed and implemented as a program.</p></div>","PeriodicalId":101271,"journal":{"name":"USSR Computational Mathematics and Mathematical Physics","volume":"30 1","pages":"Pages 142-147"},"PeriodicalIF":0.0000,"publicationDate":"1990-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0041-5553(90)90023-L","citationCount":"0","resultStr":"{\"title\":\"Computation of the maximum guaranteed payoff in dynamic models of conflict situations\",\"authors\":\"S.A. Yevseyeva\",\"doi\":\"10.1016/0041-5553(90)90023-L\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>The conflict situations in question are described by repeated two-person bimatrix games. The problem is to determine the maximum guaranteed payoff to the first player. A numerical algorithm computing the solution is constructed and implemented as a program.</p></div>\",\"PeriodicalId\":101271,\"journal\":{\"name\":\"USSR Computational Mathematics and Mathematical Physics\",\"volume\":\"30 1\",\"pages\":\"Pages 142-147\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1990-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/0041-5553(90)90023-L\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"USSR Computational Mathematics and Mathematical Physics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/004155539090023L\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"USSR Computational Mathematics and Mathematical Physics","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/004155539090023L","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Computation of the maximum guaranteed payoff in dynamic models of conflict situations
The conflict situations in question are described by repeated two-person bimatrix games. The problem is to determine the maximum guaranteed payoff to the first player. A numerical algorithm computing the solution is constructed and implemented as a program.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
