Matching while Learning
@article{Johari2017MatchingWL,
title={Matching while Learning},
author={R. Johari and Vijay Kamble and Yashodhan Kanoria},
journal={Proceedings of the 2017 ACM Conference on Economics and Computation},
year={2017}
}We consider the problem faced by a service platform that needs to match supply with demand but also to learn attributes of new arrivals in order to match them better in the future. We introduce a benchmark model with heterogeneous workers and jobs that arrive over time. Job types are known to the platform, but worker types are unknown and must be learned by observing match outcomes. Workers depart after performing a certain number of jobs. The payoff from a match depends on the pair of types… CONTINUE READING
Paper Mentions
23 Citations
Learning Proportionally Fair Allocations with Low Regret
- Computer Science
- Proc. ACM Meas. Anal. Comput. Syst.
- 2018
- 1
Dominate or Delete: Decentralized Competing Bandits with Uniform Valuation
- Computer Science, Mathematics
- ArXiv
- 2020
- 2
- PDF
Integrating Online Learning and Adaptive Control in Queueing Systems with Uncertain Payoffs
- Computer Science
- 2018 Information Theory and Applications Workshop (ITA)
- 2018
- 3
- Highly Influenced
- PDF
References
SHOWING 1-2 OF 2 REFERENCES
Asymptotically efficient adaptive allocation schemes for controlled iid processes: finite parameter space. strong distinction, in at most about 7 jobs on average, which is reasonably quick
- Automatic Control, IEEE Transactions on,
- 1989
Asymptotically ecient adaptive allocation schemes for controlled iid processes: nite parameter space
- Automatic Control, IEEE Transactions on 34, 3 (1989), 258–267.
- 1989