Many-to-many matching: stable polyandrous polygamy (or polygamous polyandry)-Reference-Cited by-同舟云学术

Many-to-many matching: stable polyandrous polygamy (or polygamous polyandry)

Published:2000-04 Issue:1-3 Volume:101 Page:1-12
ISSN:0166-218X
Container-title:Discrete Applied Mathematics
language:en
Short-container-title:Discrete Applied Mathematics

Author:

Baı̈ou Mourad,Balinski Michel

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference8 articles.

1. M. Baı̈ou, M. Balinski, Admissions via graphs: structure and optimal mechanisms, Cahier du Laboratoire d’Économétrie de l’École Polytechnique, No. 484, 1998.

2. Of stable marriages and graphs, and strategy and polytopes;Balinski;SIAM Rev.,1997

3. Graphs and marriages;Balinski;Amer. Math. Monthly,1998

4. A tale of two mechanisms: student placement;Balinski;J. Econom. Theory,1999

5. College admissions and the stability of marriage;Gale;Amer. Math. Monthly,1962

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

1. ESMA: Towards elevating system happiness in a decentralized serverless edge computing framework;Journal of Parallel and Distributed Computing;2024-01

2. Preallocation-Based Combinatorial Auction for Efficient Fair Channel Assignments in Multi-Connectivity Networks;IEEE Transactions on Wireless Communications;2023-11

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

4. Many-to-many perfect matching;Proceedings of the 4th International Conference on Advanced Information Science and System;2022-11-25

5. Stable allocations and partially ordered sets;Discrete Optimization;2022-11