Binary Operations for the Lattice Structure in a Many-to-Many MatchingModel

作     者：Paola Belén Manasero 

作者机构：Instituto de Matemática Aplicada San LuisUniversidad Nacional de San Luis and CONICETAv.Ejército de los andes 950D5700HHW San LuisArgentina 

出 版 物：《Journal of the Operations Research Society of China》 (中国运筹学会会刊（英文）)

年 卷 期：2021年第9卷第1期

页      面：207-228页

核心收录：

学科分类：1201[管理学-管理科学与工程(可授管理学、工学学位)] 07[理学] 070102[理学-计算数学] 0701[理学-数学] 

基　　金：This research was supported by the Universidad Nacional de San Luis(No.31012) by the Consejo Nacional de Investigaciones Científicas y Técnicas(No.PIP 112-201501-00464). 

主　　题：Many-to-many matching model Binary operations Lattice structure 

摘      要：The lattice structure of the set of stable matchings in many-to-many matching model is well known in literature.If preferences of the agents are substitutable,this result can be obtained by fixed-point methods,for that purpose an algorithm for finding a fixed-point matching is defined.Since the fixed-point set equals the set of stable matchings,the latter has a lattice structure too.In this paper,we consider a many-to-many matching market where the preferences of firms satisfy substitutability and the law of aggregate demand,and workers have responsive preferences.In this many-to-many matching market,we explicitly compute for any pair of stable matchings the least upper bound and the greatest lower bound,without using fixed-point methods.