{"title":"有限非合作对策的极大向量空间","authors":"V. Kreps","doi":"10.2139/ssrn.2840819","DOIUrl":null,"url":null,"abstract":"We consider finite non-cooperative N person games with fixed numbers mi, i = 1, . . . , N , of pure strategies of player i. We propose the following question: is it possible to extend the vector space of finite non-cooperative m1 ? m2 ? . . . ? mN - games in mixed strategies such that all games of a broader vector space of non- cooperative N person games on the product of unit (mi ? 1)-dimensional simpleces have Nash equilibrium points? We get a necessary and sufficient condition for the negative answer. This condition consists of a relation between the numbers of pure strategies of the players. For two-person games the condition is that the numbers of pure strategies of the both players are equal","PeriodicalId":365755,"journal":{"name":"ERN: Other Econometrics: Mathematical Methods & Programming (Topic)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"On Maximal Vector Spaces of Finite Non-Cooperative Games\",\"authors\":\"V. Kreps\",\"doi\":\"10.2139/ssrn.2840819\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider finite non-cooperative N person games with fixed numbers mi, i = 1, . . . , N , of pure strategies of player i. We propose the following question: is it possible to extend the vector space of finite non-cooperative m1 ? m2 ? . . . ? mN - games in mixed strategies such that all games of a broader vector space of non- cooperative N person games on the product of unit (mi ? 1)-dimensional simpleces have Nash equilibrium points? We get a necessary and sufficient condition for the negative answer. This condition consists of a relation between the numbers of pure strategies of the players. For two-person games the condition is that the numbers of pure strategies of the both players are equal\",\"PeriodicalId\":365755,\"journal\":{\"name\":\"ERN: Other Econometrics: Mathematical Methods & Programming (Topic)\",\"volume\":\"20 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-09-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ERN: Other Econometrics: Mathematical Methods & Programming (Topic)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.2139/ssrn.2840819\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ERN: Other Econometrics: Mathematical Methods & Programming (Topic)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2139/ssrn.2840819","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
摘要
我们考虑具有固定数mi, i = 1,…的有限非合作N人对策。, N,参与人i的纯策略。我们提出以下问题:是否有可能扩展有限非合作m1的向量空间?平方米?……? 混合策略中的mN -对策,使得一个更广的非合作N人对策的所有对策在单位(mi ?1)维单元是否有纳什平衡点?得到了负解的充分必要条件。这个条件由参与人的纯策略数量之间的关系组成。对于两人博弈,条件是双方的纯策略数量相等
On Maximal Vector Spaces of Finite Non-Cooperative Games
We consider finite non-cooperative N person games with fixed numbers mi, i = 1, . . . , N , of pure strategies of player i. We propose the following question: is it possible to extend the vector space of finite non-cooperative m1 ? m2 ? . . . ? mN - games in mixed strategies such that all games of a broader vector space of non- cooperative N person games on the product of unit (mi ? 1)-dimensional simpleces have Nash equilibrium points? We get a necessary and sufficient condition for the negative answer. This condition consists of a relation between the numbers of pure strategies of the players. For two-person games the condition is that the numbers of pure strategies of the both players are equal