Algorithms for Optimal Diverse Matching

09/07/2019
by   Ahmadi, et al.
0

Bipartite b-matching, where agents on one side of a market are matched to one or more agents or items on the other, is a classical model that is used in myriad application areas such as healthcare, advertising, education, and general resource allocation. Traditionally, the primary goal of such models is to maximize a linear function of the constituent matches (e.g., linear social welfare maximization) subject to some constraints. Recent work has studied a new goal of balancing whole-match diversity and economic efficiency, where the objective is instead a monotone submodular function over the matching. These more general models are largely NP-hard. In this work, we develop a combinatorial algorithm that constructs provably-optimal diverse b-matchings in pseudo-polynomial time. Then, we show how to extend our algorithm to solve new variations of the diverse b-matching problem. We then compare directly, on real-world datasets, against the state-of-the-art, quadratic-programming-based approach to solving diverse b-matching problems and show that our method outperforms it in both speed and (anytime) solution quality.

READ FULL TEXT

page 1

page 3

research
02/23/2017

Diverse Weighted Bipartite b-Matching

Bipartite matching, where agents on one side of a market are matched to ...
research
11/13/2018

Balancing Relevance and Diversity in Online Bipartite Matching via Submodularity

In bipartite matching problems, vertices on one side of a bipartite grap...
research
11/30/2022

Resource Sharing Through Multi-Round Matchings

Applications such as employees sharing office spaces over a workweek can...
research
12/31/2012

Maximizing a Nonnegative, Monotone, Submodular Function Constrained to Matchings

Submodular functions have many applications. Matchings have many applica...
research
09/12/2022

Resource Allocation to Agents with Restrictions: Maximizing Likelihood with Minimum Compromise

Many scenarios where agents with restrictions compete for resources can ...
research
10/22/2020

Improving Policy-Constrained Kidney Exchange via Pre-Screening

In barter exchanges, participants swap goods with one another without ex...
research
05/09/2020

Learning to Accelerate Heuristic Searching for Large-Scale Maximum Weighted b-Matching Problems in Online Advertising

Bipartite b-matching is fundamental in algorithm design, and has been wi...

Please sign up or login with your details

Forgot password? Click here to reset