Perfect matching in bipartite hypergraphs subject to a demand graph

• Published in: Annals of operations research Vol. 321; no. 1-2; pp. 39 - 48
• Main Authors: Aronshtam, Lior, Ilani, Hagai, Shufan, Elad
• Format: Journal Article
• Language: English
• Published: New York Springer US 01.02.2023; Springer; Springer Nature B.V
• Subjects: Assignment problem; Business and Management; Combinatorics; Demand; Demand (Economics); Graph matching; Graph theory; Graphs; Matching theory; Operations research; Operations Research/Decision Theory; Original Research; Tenants; Theory of Computation; Israel; Assignment; Perfect matching; Bipartite hypergraph

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....