Matching while Learning

  title={Matching while Learning},
  author={R. Johari and Vijay Kamble and Yashodhan Kanoria},
  journal={Proceedings of the 2017 ACM Conference on Economics and Computation},
  • R. Johari, Vijay Kamble, Yashodhan Kanoria
  • Published 2017
  • Computer Science, Mathematics
  • Proceedings of the 2017 ACM Conference on Economics and Computation
  • 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
    23 Citations

    Figures, Tables, and Topics from this paper

    Matching Impatient and Heterogeneous Demand and Supply
    • PDF
    Bandit Learning in Decentralized Matching Markets
    • 1
    • PDF
    Learning Proportionally Fair Allocations with Low Regret
    • 1
    Dominate or Delete: Decentralized Competing Bandits with Uniform Valuation
    • 2
    • PDF
    Competing Bandits in Matching Markets
    • 15
    • PDF
    Integrating Online Learning and Adaptive Control in Queueing Systems with Uncertain Payoffs
    • 3
    • Highly Influenced
    • PDF
    Contextual Blocking Bandits
    • PDF
    Optimal dynamic information provision in traffic routing
    • 5
    • PDF


    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 ecient adaptive allocation schemes for controlled iid processes: €nite parameter space
    • Automatic Control, IEEE Transactions on 34, 3 (1989), 258–267.
    • 1989