IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v321y2023i1d10.1007_s10479-022-05073-9.html
   My bibliography  Save this article

Perfect matching in bipartite hypergraphs subject to a demand graph

Author

Listed:
  • Lior Aronshtam

    (SCE – Shamoon College of Engineering)

  • Hagai Ilani

    (SCE – Shamoon College of Engineering)

  • Elad Shufan

    (SCE – Shamoon College of Engineering)

Abstract

Motivated by the problem of assigning plots to tenants, we present a version of the bipartite hypergraph matching problem. This version deals with a hypergraph with a constraint on its hyperedges, defined by a demand graph. We study the complexity of the matching problem for different demand graphs. The matching problem for 3-uniform hypergraphs is polynomially solvable if the set of perfect matchings of the demand graph can be polynomially generated. On the other hand, when the number of disjoint even cycles in the demand graph is $$\varvec{\Omega (n^{1/k})}$$ Ω ( n 1 / k ) , for some constant $$\varvec{k}$$ k , the matching problem is NP-complete. For non-uniform hypergraphs, we show that the problem is NP-complete, even for very simple demand graphs.

Suggested Citation

  • Lior Aronshtam & Hagai Ilani & Elad Shufan, 2023. "Perfect matching in bipartite hypergraphs subject to a demand graph," Annals of Operations Research, Springer, vol. 321(1), pages 39-48, February.
    • Handle: RePEc:spr:annopr:v:321:y:2023:i:1:d:10.1007_s10479-022-05073-9
    DOI: 10.1007/s10479-022-05073-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-022-05073-9
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10479-022-05073-9?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Parag A. Pathak & Alvin E. Roth, 2013. "Matching with Couples: Stability and Incentives in Large Markets," The Quarterly Journal of Economics, President and Fellows of Harvard College, vol. 128(4), pages 1585-1632.
    2. H. W. Kuhn, 1955. "The Hungarian method for the assignment problem," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 2(1‐2), pages 83-97, March.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Chao Huang, 2021. "Stable matching: an integer programming approach," Papers 2103.03418, arXiv.org, revised Apr 2022.
    2. Jiang, Zhishan & Tian, Guoqiang, 2013. "Matching with Couples: Stability and Algorithm," MPRA Paper 57936, University Library of Munich, Germany, revised Jul 2014.
    3. András Frank, 2005. "On Kuhn's Hungarian Method—A tribute from Hungary," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(1), pages 2-5, February.
    4. Amit Kumar & Anila Gupta, 2013. "Mehar’s methods for fuzzy assignment problems with restrictions," Fuzzy Information and Engineering, Springer, vol. 5(1), pages 27-44, March.
    5. Surender Baswana & Partha Pratim Chakrabarti & Sharat Chandran & Yashodhan Kanoria & Utkarsh Patange, 2019. "Centralized Admissions for Engineering Colleges in India," Interfaces, INFORMS, vol. 49(5), pages 338-354, September.
    6. Parvin Ahmadi & Iman Gholampour & Mahmoud Tabandeh, 2018. "Cluster-based sparse topical coding for topic mining and document clustering," Advances in Data Analysis and Classification, Springer;German Classification Society - Gesellschaft für Klassifikation (GfKl);Japanese Classification Society (JCS);Classification and Data Analysis Group of the Italian Statistical Society (CLADAG);International Federation of Classification Societies (IFCS), vol. 12(3), pages 537-558, September.
    7. Tobias Reischmann & Thilo Klein & Sven Giegerich, 2021. "A deferred acceptance mechanism for decentralized, fast, and fair childcare assignment," The Journal of Mechanism and Institution Design, Society for the Promotion of Mechanism and Institution Design, University of York, vol. 6(1), pages 59-100, December.
    8. Dur, Umut Mert & Wiseman, Thomas, 2019. "School choice with neighbors," Journal of Mathematical Economics, Elsevier, vol. 83(C), pages 101-109.
    9. Mustafa Oguz Afacan & Nejat Anbarci & Ozgur Kıbrıs, 2022. "Arbiter Assignment," Working Papers 2022_02, Durham University Business School.
    10. Chenchen Ma & Jing Ouyang & Gongjun Xu, 2023. "Learning Latent and Hierarchical Structures in Cognitive Diagnosis Models," Psychometrika, Springer;The Psychometric Society, vol. 88(1), pages 175-207, March.
    11. Tran Hoang Hai, 2020. "Estimation of volatility causality in structural autoregressions with heteroskedasticity using independent component analysis," Statistical Papers, Springer, vol. 61(1), pages 1-16, February.
    12. Umut Dur & Robert G. Hammond & Thayer Morrill, 2019. "The Secure Boston Mechanism: theory and experiments," Experimental Economics, Springer;Economic Science Association, vol. 22(4), pages 918-953, December.
    13. Hatfield, John William & Kominers, Scott Duke, 2017. "Contract design and stability in many-to-many matching," Games and Economic Behavior, Elsevier, vol. 101(C), pages 78-97.
    14. Caplin, Andrew & Leahy, John, 2020. "Comparative statics in markets for indivisible goods," Journal of Mathematical Economics, Elsevier, vol. 90(C), pages 80-94.
    15. Biró, Péter & Gudmundsson, Jens, 2021. "Complexity of finding Pareto-efficient allocations of highest welfare," European Journal of Operational Research, Elsevier, vol. 291(2), pages 614-628.
    16. Péter Biró & Flip Klijn & Xenia Klimentova & Ana Viana, 2021. "Shapley-Scarf Housing Markets: Respecting Improvement, Integer Programming, and Kidney Exchange," Working Papers 1235, Barcelona School of Economics.
    17. Michal Brylinski, 2014. "eMatchSite: Sequence Order-Independent Structure Alignments of Ligand Binding Pockets in Protein Models," PLOS Computational Biology, Public Library of Science, vol. 10(9), pages 1-15, September.
    18. Di Feng & Yun Liu, 2022. "On the Asymptotic Performance of Affirmative Actions in School Choice," Papers 2202.03927, arXiv.org, revised Dec 2022.
    19. Hafalir, Isa E. & Kojima, Fuhito & Yenmez, M. Bumin, 2022. "Interdistrict school choice: A theory of student assignment," Journal of Economic Theory, Elsevier, vol. 201(C).
    20. Chiwei Yan & Helin Zhu & Nikita Korolko & Dawn Woodard, 2020. "Dynamic pricing and matching in ride‐hailing platforms," Naval Research Logistics (NRL), John Wiley & Sons, vol. 67(8), pages 705-724, December.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:321:y:2023:i:1:d:10.1007_s10479-022-05073-9. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.