A New Approach to the Pareto Stable Matching Problem-Reference-Cited by-同舟云学术

A New Approach to the Pareto Stable Matching Problem

Published:2014-08 Issue:3 Volume:39 Page:851-862
ISSN:0364-765X
Container-title:Mathematics of Operations Research
language:en
Short-container-title:Mathematics of OR

Author:

Kamiyama Naoyuki

Publisher

Institute for Operations Research and the Management Sciences (INFORMS)

Subject

Management Science and Operations Research,Computer Science Applications,General Mathematics

Link

https://pubsonline.informs.org/doi/pdf/10.1287/moor.2013.0627

Reference19 articles.

1. School Choice: A Mechanism Design Approach

2. Strategy-proofness versus Efficiency in Matching with Indifferences: Redesigning the NYC High School Match

3. Chen N (2012) On computing Pareto stable assignments. Dürr C, Wilke T, eds.The 29th International Symposium on Theoretical Aspects of Computer Science, STACS'12(Dagstuhl Publishing, Saarbrucken/Wadern, Germany), 384–395.

4. Chen N, Ghosh A (2011) A market clearing solution for social lending. Walsh T, ed.The 22nd International Joint Conference on Artificial Inelligence, IJCAI'11(AAAI Press, Palo Alto, CA), 152–157.

5. What's the Matter with Tie-Breaking? Improving Efficiency in School Choice

Cited by 11 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Review of the Theory of Stable Matchings and Contract Systems;Computational Mathematics and Mathematical Physics;2023-03

2. Review of the Theory of Stable Matchings and Contract Systems;Журнал вычислительной математики и математической физики;2023-03-01

3. Pareto efficient matchings with pairwise preferences;Theoretical Computer Science;2023-02

4. A systematic model of stable seller–buyer matching with true preference induction in E-commerce platform;Kybernetes;2022-09-22

5. Real-time customized bus routes design with optimal passenger and vehicle matching based on column generation algorithm;Physica A: Statistical Mechanics and its Applications;2021-06