{"title":"凹对策中的近似概念","authors":"E. Melo","doi":"10.2139/ssrn.3467056","DOIUrl":null,"url":null,"abstract":"This paper studies three different approximation concepts in the context of n-person concave games. Formally, we establish the precise relationship between the notions of e-Nash Equilibrium, $\\hate-approximate solution, and δ-near Nash equilibrium. We apply our results to the class of Lipschitz games and discrete network games respectively.","PeriodicalId":423216,"journal":{"name":"Game Theory & Bargaining Theory eJournal","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Approximation Notions in Concave Games\",\"authors\":\"E. Melo\",\"doi\":\"10.2139/ssrn.3467056\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper studies three different approximation concepts in the context of n-person concave games. Formally, we establish the precise relationship between the notions of e-Nash Equilibrium, $\\\\hate-approximate solution, and δ-near Nash equilibrium. We apply our results to the class of Lipschitz games and discrete network games respectively.\",\"PeriodicalId\":423216,\"journal\":{\"name\":\"Game Theory & Bargaining Theory eJournal\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-10-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Game Theory & Bargaining Theory eJournal\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.2139/ssrn.3467056\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Game Theory & Bargaining Theory eJournal","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2139/ssrn.3467056","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
This paper studies three different approximation concepts in the context of n-person concave games. Formally, we establish the precise relationship between the notions of e-Nash Equilibrium, $\hate-approximate solution, and δ-near Nash equilibrium. We apply our results to the class of Lipschitz games and discrete network games respectively.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
