{"title":"团体反提案网络","authors":"R. Nieva","doi":"10.2139/ssrn.1259656","DOIUrl":null,"url":null,"abstract":"We study two n-player sequential network formation games with externalities. Link formation is tied to simultaneous transfer selection in a Nash demand like game in each period. Players in groups can counterpropose. We give necessary and sufficient conditions for efficiency in terms of cyclical monotonicity. The n-player group version always yields efficiency.","PeriodicalId":343564,"journal":{"name":"Economics of Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Networks with Group Counterproposals\",\"authors\":\"R. Nieva\",\"doi\":\"10.2139/ssrn.1259656\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We study two n-player sequential network formation games with externalities. Link formation is tied to simultaneous transfer selection in a Nash demand like game in each period. Players in groups can counterpropose. We give necessary and sufficient conditions for efficiency in terms of cyclical monotonicity. The n-player group version always yields efficiency.\",\"PeriodicalId\":343564,\"journal\":{\"name\":\"Economics of Networks\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Economics of Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.2139/ssrn.1259656\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Economics of Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2139/ssrn.1259656","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
We study two n-player sequential network formation games with externalities. Link formation is tied to simultaneous transfer selection in a Nash demand like game in each period. Players in groups can counterpropose. We give necessary and sufficient conditions for efficiency in terms of cyclical monotonicity. The n-player group version always yields efficiency.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
