Impatience in matching systems makes optimal pairing very hard

Impatience Makes Matching NP-Hard

Computational ComplexityData Structures and Algorithms

Summary

Matching customers with suppliers quickly is important in many online systems, but when people get impatient and leave if not matched fast enough, the problem of maximizing matches becomes very hard to solve. The authors show that even when everyone is equally impatient, finding nearly the best long-term pairing plan is computationally impossible unless P equals NP. However, if one side of the matching is always patient, then they provide an efficient way to maximize matches. This highlights a big difference in how easily these matching problems can be solved depending on how patient the agents are.

What this means in practice

A theory result. No direct application yet.

Authors

Chen Yan, Sushil Mahavir Varma

Abstract

Motivated by emerging applications such as online marketplaces and quantum switches, we study a dynamic bipartite matching model with impatient agents, where the two sides represent customers and suppliers. Agents of each type arrive according to an independent Poisson process, and the platform decides which pairs of agents to match. The agents are possibly impatient and may leave the system if not matched before their patience expires. The platform aims to maximize throughput, i.e., the number of matches per unit time. In this paper, we reveal an interesting phase transition in the computational hardness of throughput maximization. In particular, we show that approximating the optimal long-run throughput within a sufficiently small fixed relative error is NP-hard, even when all agents have rate-one exponential patience. This result implies a computational barrier to constructing near-optimal, efficiently executable matching policies that induce a matching process with fast mixing. On the other hand, when all agents on at least one side have infinite patience, we provide a simple polynomial-time algorithm that maximizes the throughput.