{"title":"匿名双面经济中的效率与最大化","authors":"Nabil Afodjo , Roland Pongou","doi":"10.1016/j.geb.2024.04.003","DOIUrl":null,"url":null,"abstract":"<div><p>We study efficiency and maximality in anonymous two-sided economies, where each agent only cares about trading with a desired number of partners from the opposite side. For both homogeneous and heterogeneous economies, we provide a necessary and sufficient condition that ensures the efficiency of all pairwise stable matchings. In addition, we provide a sufficient condition for maximality in heterogeneous economies. These conditions have implications for the design of anonymous markets that function optimally without the continuous intervention of a social planner.</p></div>","PeriodicalId":48291,"journal":{"name":"Games and Economic Behavior","volume":"146 ","pages":"Pages 184-195"},"PeriodicalIF":1.0000,"publicationDate":"2024-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Efficiency and maximality in anonymous two-sided economies\",\"authors\":\"Nabil Afodjo , Roland Pongou\",\"doi\":\"10.1016/j.geb.2024.04.003\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>We study efficiency and maximality in anonymous two-sided economies, where each agent only cares about trading with a desired number of partners from the opposite side. For both homogeneous and heterogeneous economies, we provide a necessary and sufficient condition that ensures the efficiency of all pairwise stable matchings. In addition, we provide a sufficient condition for maximality in heterogeneous economies. These conditions have implications for the design of anonymous markets that function optimally without the continuous intervention of a social planner.</p></div>\",\"PeriodicalId\":48291,\"journal\":{\"name\":\"Games and Economic Behavior\",\"volume\":\"146 \",\"pages\":\"Pages 184-195\"},\"PeriodicalIF\":1.0000,\"publicationDate\":\"2024-05-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Games and Economic Behavior\",\"FirstCategoryId\":\"96\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0899825624000526\",\"RegionNum\":3,\"RegionCategory\":\"经济学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"ECONOMICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Games and Economic Behavior","FirstCategoryId":"96","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0899825624000526","RegionNum":3,"RegionCategory":"经济学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"ECONOMICS","Score":null,"Total":0}
Efficiency and maximality in anonymous two-sided economies
We study efficiency and maximality in anonymous two-sided economies, where each agent only cares about trading with a desired number of partners from the opposite side. For both homogeneous and heterogeneous economies, we provide a necessary and sufficient condition that ensures the efficiency of all pairwise stable matchings. In addition, we provide a sufficient condition for maximality in heterogeneous economies. These conditions have implications for the design of anonymous markets that function optimally without the continuous intervention of a social planner.
期刊介绍：
Games and Economic Behavior facilitates cross-fertilization between theories and applications of game theoretic reasoning. It consistently attracts the best quality and most creative papers in interdisciplinary studies within the social, biological, and mathematical sciences. Most readers recognize it as the leading journal in game theory. Research Areas Include: • Game theory • Economics • Political science • Biology • Computer science • Mathematics • Psychology
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
