{"title":"On the Core of Markets with Co-ownerships and Indivisibilities","authors":"Xiangzhuang Sun, Qianfeng Tang, Mingjun Xiao","doi":"10.2139/ssrn.3540210","DOIUrl":null,"url":null,"abstract":"Following Balbuzanov and Kotowski (2019a), we study the exchange of indivisible objects among agents with unit demand, where initially each object is either privately owned or is co-owned by multiple agents. We propose a new notion of core called the effective core for these problems to address the inadequacies of conventional notions of core. We say that a coalition effectively blocks an assignment if it weakly blocks it–as in the definition of the strong core–and the blocking is credible in the sense that no agent in the coalition free-rides on other agents in it. We show that the effective core is a nonempty subset of the weak core and a superset of the strong core, and all assignments in it are Pareto efficient. We also propose an algorithm to find assignments in it. Lastly, we make detailed comparison between the effective core and Balbuzanov and Kotowski’s exclusion core.","PeriodicalId":393761,"journal":{"name":"ERN: Other Game Theory & Bargaining Theory (Topic)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2020-02-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"ERN: Other Game Theory & Bargaining Theory (Topic)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2139/ssrn.3540210","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
Following Balbuzanov and Kotowski (2019a), we study the exchange of indivisible objects among agents with unit demand, where initially each object is either privately owned or is co-owned by multiple agents. We propose a new notion of core called the effective core for these problems to address the inadequacies of conventional notions of core. We say that a coalition effectively blocks an assignment if it weakly blocks it–as in the definition of the strong core–and the blocking is credible in the sense that no agent in the coalition free-rides on other agents in it. We show that the effective core is a nonempty subset of the weak core and a superset of the strong core, and all assignments in it are Pareto efficient. We also propose an algorithm to find assignments in it. Lastly, we make detailed comparison between the effective core and Balbuzanov and Kotowski’s exclusion core.