纯纳什均衡的复杂性类导论

Anais do VIII Encontro de Teoria da Computação (ETC 2023) Pub Date : 2023-08-06 DOI:10.5753/etc.2023.229527

Victor Hugo Wirz, Pedro Nuno Moura

{"title":"纯纳什均衡的复杂性类导论","authors":"Victor Hugo Wirz, Pedro Nuno Moura","doi":"10.5753/etc.2023.229527","DOIUrl":null,"url":null,"abstract":"Taxonomy of problems in Computer Science has been typically done with formulations as decision problems. This approach is inadequate for many search problems of interest when the structure of the instance in itself guarantees the existence of a positive certificate. In this paper, we provide an introduction to the class of problems PLS and its connections with finding Pure Nash Equilibrium in Congestion Games.","PeriodicalId":165974,"journal":{"name":"Anais do VIII Encontro de Teoria da Computação (ETC 2023)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An Introduction to the Complexity Class of Pure Nash Equilibrium\",\"authors\":\"Victor Hugo Wirz, Pedro Nuno Moura\",\"doi\":\"10.5753/etc.2023.229527\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Taxonomy of problems in Computer Science has been typically done with formulations as decision problems. This approach is inadequate for many search problems of interest when the structure of the instance in itself guarantees the existence of a positive certificate. In this paper, we provide an introduction to the class of problems PLS and its connections with finding Pure Nash Equilibrium in Congestion Games.\",\"PeriodicalId\":165974,\"journal\":{\"name\":\"Anais do VIII Encontro de Teoria da Computação (ETC 2023)\",\"volume\":\"4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-08-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Anais do VIII Encontro de Teoria da Computação (ETC 2023)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.5753/etc.2023.229527\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Anais do VIII Encontro de Teoria da Computação (ETC 2023)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5753/etc.2023.229527","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

计算机科学中的问题分类通常是用公式作为决策问题来完成的。当实例本身的结构保证存在一个肯定的证书时，这种方法不适用于许多感兴趣的搜索问题。在本文中，我们介绍了一类问题PLS及其与在拥挤对策中寻找纯纳什均衡的联系。

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

查看原文本刊更多论文

An Introduction to the Complexity Class of Pure Nash Equilibrium

Taxonomy of problems in Computer Science has been typically done with formulations as decision problems. This approach is inadequate for many search problems of interest when the structure of the instance in itself guarantees the existence of a positive certificate. In this paper, we provide an introduction to the class of problems PLS and its connections with finding Pure Nash Equilibrium in Congestion Games.

求助全文

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

来源期刊

Anais do VIII Encontro de Teoria da Computação (ETC 2023)

自引率

0.00%

发文量