Adaptive matching for expert systems with uncertain task types
From MaRDI portal
(Redirected from Publication:5144772)
Abstract: A matching in a two-sided market often incurs an externality: a matched resource may become unavailable to the other side of the market, at least for a while. This is especially an issue in online platforms involving human experts as the expert resources are often scarce. The efficient utilization of experts in these platforms is made challenging by the fact that the information available about the parties involved is usually limited. To address this challenge, we develop a model of a task-expert matching system where a task is matched to an expert using not only the prior information about the task but also the feedback obtained from the past matches. In our model the tasks arrive online while the experts are fixed and constrained by a finite service capacity. For this model, we characterize the maximum task resolution throughput a platform can achieve. We show that the natural greedy approaches where each expert is assigned a task most suitable to her skill is suboptimal, as it does not internalize the above externality. We develop a throughput optimal backpressure algorithm which does so by accounting for the `congestion' among different task types. Finally, we validate our model and confirm our theoretical findings with data-driven simulations via logs of Math.StackExchange, a StackOverflow forum dedicated to mathematics.
Recommendations
Cites work
- Applied Probability and Queues
- Asymptotically efficient adaptive allocation rules
- Budget-Optimal Task Allocation for Reliable Crowdsourcing Systems
- Dynamic control of N-systems with many servers: asymptotic optimality of a static priority policy in heavy traffic
- Dynamic scheduling of a system with two parallel servers in heavy traffic with resource pooling: Asymptotic optimality of a threshold policy
- Ergodicity of stochastic processes describing the operation of open queueing networks
- Finite-time analysis of the multiarmed bandit problem
- Heavy traffic analysis of a system with parallel servers: Asymptotic optimality of discrete-review policies
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 1947316 (Why is no real title available?)
- Multi-armed bandit allocation indices. With a foreword by Peter Whittle.
- On pooling in queueing networks
- On positive Harris recurrence of multiclass queueing networks: A unified approach via fluid limit models
- Online stochastic matching with unequal probabilities
- Regret analysis of stochastic and nonstochastic multi-armed bandit problems
- Resource Allocation and Cross-Layer Control in Wireless Networks
- Scheduling Flexible Servers with Convex Delay Costs: Heavy-Traffic Optimality of the Generalized cμ-Rule
- Spectral methods meet EM: a provably optimal algorithm for crowdsourcing
- Stability of Data Networks: Stationary and Bursty Models
- Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks
- Structural properties of proportional fairness: stability and insensitivity
- Using mixture models for collaborative filtering
Cited in
(3)
This page was built for publication: Adaptive matching for expert systems with uncertain task types
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5144772)
