{"title":"双矩阵对策的有效分解(扩展摘要)","authors":"Xiang Jiang, A. Pauly","doi":"10.4204/EPTCS.146.10","DOIUrl":null,"url":null,"abstract":"Exploiting the algebraic structure of the set of bimatrix games, a divide-and-conquer algorithm for finding Nash equilibria is proposed. The algorithm is fixed-parameter tractable with the size of the largest irreducible component of a game as parameter. An implementation of the algorithm is shown to yield a significant performance increase on inputs with small parameters.","PeriodicalId":53035,"journal":{"name":"Hkhmt m`Sr","volume":"39 1","pages":"75-81"},"PeriodicalIF":0.0000,"publicationDate":"2014-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Efficient Decomposition of Bimatrix Games (Extended Abstract)\",\"authors\":\"Xiang Jiang, A. Pauly\",\"doi\":\"10.4204/EPTCS.146.10\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Exploiting the algebraic structure of the set of bimatrix games, a divide-and-conquer algorithm for finding Nash equilibria is proposed. The algorithm is fixed-parameter tractable with the size of the largest irreducible component of a game as parameter. An implementation of the algorithm is shown to yield a significant performance increase on inputs with small parameters.\",\"PeriodicalId\":53035,\"journal\":{\"name\":\"Hkhmt m`Sr\",\"volume\":\"39 1\",\"pages\":\"75-81\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Hkhmt m`Sr\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4204/EPTCS.146.10\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Hkhmt m`Sr","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4204/EPTCS.146.10","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Efficient Decomposition of Bimatrix Games (Extended Abstract)
Exploiting the algebraic structure of the set of bimatrix games, a divide-and-conquer algorithm for finding Nash equilibria is proposed. The algorithm is fixed-parameter tractable with the size of the largest irreducible component of a game as parameter. An implementation of the algorithm is shown to yield a significant performance increase on inputs with small parameters.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
