Adaptive Matching for Expert Systems with Uncertain Task Types

Abstract : Online two-sided matching markets such as Q&A forums (e.g. StackOverflow, Quora) and online labour platforms (e.g. Upwork) critically rely on the ability to propose adequate matches based on imperfect knowledge of the two parties to be matched. This prompts the following question: Which matching recommendation algorithms can, in the presence of such uncertainty, lead to efficient platform operation? To answer this question, we develop a model of a task / server matching system. For this model, we give a necessary and sufficient condition for an incoming stream of tasks to be manageable by the system. We further identify a so-called back-pressure policy under which the throughput that the system can handle is optimized. We show that this policy achieves strictly larger throughput than a natural greedy policy. Finally, we validate our model and confirm our theoretical findings with experiments based on logs of Math.StackExchange, a StackOverflow forum dedicated to mathematics.
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01622739
Contributor : Lennart Gulikers <>
Submitted on : Tuesday, October 24, 2017 - 4:09:41 PM
Last modification on : Tuesday, February 5, 2019 - 2:38:01 PM

Links full text

Identifiers

  • HAL Id : hal-01622739, version 1
  • ARXIV : 1703.00674

Citation

Virag Shah, Lennart Gulikers, Laurent Massoulié, Milan Vojnovic. Adaptive Matching for Expert Systems with Uncertain Task Types. Allerton 2017 - 55th Annual Allerton Conference on Communication, Control, and Computing, Oct 2017, Monticello, IL, United States. ⟨hal-01622739⟩

Share

Metrics

Record views

202