{"title":"矩阵游戏源于多对多的战斗","authors":"K. Kikuta","doi":"10.1002/NAV.3800330406","DOIUrl":null,"url":null,"abstract":"The many-against-many battle, which is a variant of the Friedman's one-against-many battle, is formulated as a two-person constant-sum game. It is shown that the matrix which expresses this game has a saddle point. Some cases are presented in which the payoff matrix of the game can be reduced. Finally, some parametrically special cases are analyzed.","PeriodicalId":431817,"journal":{"name":"Naval Research Logistics Quarterly","volume":"5 5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1986-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"The matrix game derived from the many‐against‐many battle\",\"authors\":\"K. Kikuta\",\"doi\":\"10.1002/NAV.3800330406\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The many-against-many battle, which is a variant of the Friedman's one-against-many battle, is formulated as a two-person constant-sum game. It is shown that the matrix which expresses this game has a saddle point. Some cases are presented in which the payoff matrix of the game can be reduced. Finally, some parametrically special cases are analyzed.\",\"PeriodicalId\":431817,\"journal\":{\"name\":\"Naval Research Logistics Quarterly\",\"volume\":\"5 5 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1986-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Naval Research Logistics Quarterly\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1002/NAV.3800330406\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Naval Research Logistics Quarterly","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1002/NAV.3800330406","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The matrix game derived from the many‐against‐many battle
The many-against-many battle, which is a variant of the Friedman's one-against-many battle, is formulated as a two-person constant-sum game. It is shown that the matrix which expresses this game has a saddle point. Some cases are presented in which the payoff matrix of the game can be reduced. Finally, some parametrically special cases are analyzed.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
