基于子博弈类型的和博弈新近似策略

2006 International Conference on Computer Engineering and Systems Pub Date : 2006-11-01 DOI:10.3233/ICG-2006-29403

M. M. Zaky, Cherif R. S. Andraos, S. A. Ghoneim

{"title":"基于子博弈类型的和博弈新近似策略","authors":"M. M. Zaky, Cherif R. S. Andraos, S. A. Ghoneim","doi":"10.3233/ICG-2006-29403","DOIUrl":null,"url":null,"abstract":"In this work, we investigate the potential of combining artificial intelligence (AI) tree-search algorithms with the algorithms of combinatorial game theory to provide more efficient strategies for playing sum games based on subgame types. Two new approximate strategies are developed and tested using a specified game model. Both strategies achieve higher performance than approximate strategies previously proposed in literature without being computationally more expensive","PeriodicalId":261853,"journal":{"name":"2006 International Conference on Computer Engineering and Systems","volume":"21 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"New Approximate Strategies for Playing Sum Games Based on Subgame Types\",\"authors\":\"M. M. Zaky, Cherif R. S. Andraos, S. A. Ghoneim\",\"doi\":\"10.3233/ICG-2006-29403\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this work, we investigate the potential of combining artificial intelligence (AI) tree-search algorithms with the algorithms of combinatorial game theory to provide more efficient strategies for playing sum games based on subgame types. Two new approximate strategies are developed and tested using a specified game model. Both strategies achieve higher performance than approximate strategies previously proposed in literature without being computationally more expensive\",\"PeriodicalId\":261853,\"journal\":{\"name\":\"2006 International Conference on Computer Engineering and Systems\",\"volume\":\"21 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 International Conference on Computer Engineering and Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.3233/ICG-2006-29403\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 International Conference on Computer Engineering and Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3233/ICG-2006-29403","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

在这项工作中，我们研究了将人工智能(AI)树搜索算法与组合博弈论算法相结合的潜力，以提供基于子博弈类型的更有效的和博弈策略。提出了两种新的近似策略，并使用特定的博弈模型进行了测试。这两种策略都比先前文献中提出的近似策略具有更高的性能，而且计算成本更大

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

New Approximate Strategies for Playing Sum Games Based on Subgame Types

In this work, we investigate the potential of combining artificial intelligence (AI) tree-search algorithms with the algorithms of combinatorial game theory to provide more efficient strategies for playing sum games based on subgame types. Two new approximate strategies are developed and tested using a specified game model. Both strategies achieve higher performance than approximate strategies previously proposed in literature without being computationally more expensive

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2006 International Conference on Computer Engineering and Systems

自引率

0.00%

发文量