A Unified Approach to Online Matching with Conflict-Aware Constraints


  • Pan Xu University of Maryland
  • Yexuan Shi Beihang University
  • Hao Cheng Beihang University
  • John Dickerson University of Maryland
  • Karthik Abinav Sankararaman University of Maryland College Park
  • Aravind Srinivasan University of Maryland College Park
  • Yongxin Tong Beihang University
  • Leonidas Tsepenekas University of Maryland




Online bipartite matching and allocation models are widely used to analyze and design markets such as Internet advertising, online labor, and crowdsourcing. Traditionally, vertices on one side of the market are fixed and known a priori, while vertices on the other side arrive online and are matched by a central agent to the offline side. The issue of possible conflicts among offline agents emerges in various real scenarios when we need to match each online agent with a set of offline agents.

For example, in event-based social networks (e.g., Meetup), offline events conflict for some users since they will be unable to attend mutually-distant events at proximate times; in advertising markets, two competing firms may prefer not to be shown to one user simultaneously; and in online recommendation systems (e.g., Amazon Books), books of the same type “conflict” with each other in some sense due to the diversity requirement for each online buyer.

The conflict nature inherent among certain offline agents raises significant challenges in both modeling and online algorithm design. In this paper, we propose a unifying model, generalizing the conflict models proposed in (She et al., TKDE 2016) and (Chen et al., TKDE 16). Our model can capture not only a broad class of conflict constraints on the offline side (which is even allowed to be sensitive to each online agent), but also allows a general arrival pattern for the online side (which is allowed to change over the online phase). We propose an efficient linear programming (LP) based online algorithm and prove theoretically that it has nearly-optimal online performance. Additionally, we propose two LP-based heuristics and test them against two natural baselines on both real and synthetic datasets. Our LP-based heuristics experimentally dominate the baseline algorithms, aligning with our theoretical predictions and supporting our unified approach.




How to Cite

Xu, P., Shi, Y., Cheng, H., Dickerson, J., Sankararaman, K. A., Srinivasan, A., Tong, Y., & Tsepenekas, L. (2019). A Unified Approach to Online Matching with Conflict-Aware Constraints. Proceedings of the AAAI Conference on Artificial Intelligence, 33(01), 2221-2228. https://doi.org/10.1609/aaai.v33i01.33012221



AAAI Technical Track: Game Theory and Economic Paradigms