关于用线性规划匹配市场的点阵结构的注释

IF 1.1 Q3 MATHEMATICS, INTERDISCIPLINARY APPLICATIONS

Journal of Dynamics and Games Pub Date : 2021-01-01 DOI:10.3934/jdg.2021001

P. Neme, San Luis Argentina Av. Italia, J. Oviedo

{"title":"关于用线性规划匹配市场的点阵结构的注释","authors":"P. Neme, San Luis Argentina Av. Italia, J. Oviedo","doi":"10.3934/jdg.2021001","DOIUrl":null,"url":null,"abstract":"Given two stable matchings in a many-to-one matching market with \\begin{document}$ q $\\end{document} -responsive preferences, by manipulating the objective function of the linear program that characterizes the stable matching set, we compute the least upper bound and greatest lower bound between them.","PeriodicalId":42722,"journal":{"name":"Journal of Dynamics and Games","volume":"1 1","pages":""},"PeriodicalIF":1.1000,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A note on the lattice structure for matching markets via linear programming\",\"authors\":\"P. Neme, San Luis Argentina Av. Italia, J. Oviedo\",\"doi\":\"10.3934/jdg.2021001\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Given two stable matchings in a many-to-one matching market with \\\\begin{document}$ q $\\\\end{document} -responsive preferences, by manipulating the objective function of the linear program that characterizes the stable matching set, we compute the least upper bound and greatest lower bound between them.\",\"PeriodicalId\":42722,\"journal\":{\"name\":\"Journal of Dynamics and Games\",\"volume\":\"1 1\",\"pages\":\"\"},\"PeriodicalIF\":1.1000,\"publicationDate\":\"2021-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Dynamics and Games\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.3934/jdg.2021001\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"MATHEMATICS, INTERDISCIPLINARY APPLICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Dynamics and Games","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3934/jdg.2021001","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}

引用次数: 1

摘要

Given two stable matchings in a many-to-one matching market with \begin{document}$ q $\end{document} -responsive preferences, by manipulating the objective function of the linear program that characterizes the stable matching set, we compute the least upper bound and greatest lower bound between them.

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A note on the lattice structure for matching markets via linear programming

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Journal of Dynamics and Games MATHEMATICS, INTERDISCIPLINARY APPLICATIONS-

CiteScore

2.00

自引率

0.00%

发文量

期刊介绍： The Journal of Dynamics and Games (JDG) is a pure and applied mathematical journal that publishes high quality peer-review and expository papers in all research areas of expertise of its editors. The main focus of JDG is in the interface of Dynamical Systems and Game Theory.