论图上博弈纳什均衡的计算(特邀演讲)

Time Pub Date : 2019-01-01 DOI:10.4230/LIPIcs.TIME.2019.3

P. Bouyer

{"title":"论图上博弈纳什均衡的计算(特邀演讲)","authors":"P. Bouyer","doi":"10.4230/LIPIcs.TIME.2019.3","DOIUrl":null,"url":null,"abstract":"In this talk, I will show how one can characterize and compute Nash equilibria in multiplayer games played on graphs. I will present in particular a construction, called the suspect game construction, which allows to reduce the computation of Nash equilibria to the computation of winning strategies in a two-player zero-sum game. 2012 ACM Subject Classification Theory of computation; Theory of computation → Solution concepts in game theory; Theory of computation → Verification by model checking","PeriodicalId":75226,"journal":{"name":"Time","volume":"53 1","pages":"3:1-3:3"},"PeriodicalIF":0.0000,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"On the Computation of Nash Equilibria in Games on Graphs (Invited Talk)\",\"authors\":\"P. Bouyer\",\"doi\":\"10.4230/LIPIcs.TIME.2019.3\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this talk, I will show how one can characterize and compute Nash equilibria in multiplayer games played on graphs. I will present in particular a construction, called the suspect game construction, which allows to reduce the computation of Nash equilibria to the computation of winning strategies in a two-player zero-sum game. 2012 ACM Subject Classification Theory of computation; Theory of computation → Solution concepts in game theory; Theory of computation → Verification by model checking\",\"PeriodicalId\":75226,\"journal\":{\"name\":\"Time\",\"volume\":\"53 1\",\"pages\":\"3:1-3:3\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Time\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4230/LIPIcs.TIME.2019.3\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Time","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4230/LIPIcs.TIME.2019.3","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

在这次演讲中，我将展示如何在图形多人游戏中描述和计算纳什均衡。我将特别介绍一种结构，称为可疑博弈结构，它允许将纳什均衡的计算减少到两人零和博弈中获胜策略的计算。2012 ACM学科分类计算理论;计算理论→博弈论中的解概念计算理论→模型校核验证

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

查看原文本刊更多论文

On the Computation of Nash Equilibria in Games on Graphs (Invited Talk)

In this talk, I will show how one can characterize and compute Nash equilibria in multiplayer games played on graphs. I will present in particular a construction, called the suspect game construction, which allows to reduce the computation of Nash equilibria to the computation of winning strategies in a two-player zero-sum game. 2012 ACM Subject Classification Theory of computation; Theory of computation → Solution concepts in game theory; Theory of computation → Verification by model checking

求助全文

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

来源期刊

Time

自引率

0.00%

发文量