Towards Capacity-Aware Broker Matching: From Recommendation to Assignment
Shuyue Wei, Yongxin Tong, Zimu Zhou, Qiaoyang Liu, Lulu Zhang, Yuxiang Zeng, Jieping Ye
摘要
Online real estate platforms are gaining increasing popularity, where a central issue is to match brokers with clients for potential housing transactions. Mainstream platforms match brokers via top-k recommendation. Yet we observe through extensive data analysis that such top-k recommendation tends to overload the top brokers, which notably degrades their service quality. In this paper, we propose to avoid such overloading in broker matching via the paradigm shift from recommendation to assignment. To this end, we design learned assignment with contextual bandits (LACB), a data-driven capacity-aware assignment scheme for broker matching which estimates broker-specific workload capacity in an online fashion and assigns brokers to clients from a global perspective to maximize the overall service quality. Extensive evaluations on synthetic and real-world datasets from an industrial online real estate platform validate the efficiency and effectiveness of our solution.
• Challenge 1: how to estimate broker-specific workload capacity in an online fashion? We observe that the workload capacity differs across brokers (see Sec. II), making personalized estimation necessary. However, it is impractical to collect data on a broker's service quality under all possible workloads in advance, which makes online estimation of workload capacity preferable. Prior workload capacity estimation schemes [8], [9] fail to
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
它引用的顶会 Paper6
- Neural Contextual Bandits with UCB-based ExplorationDongruo Zhou, Lihong Li, Quanquan GuICML 2020 · 被引用 329 次
- Predictive Task Assignment in Spatial Crowdsourcing: A Data-driven ApproachYan Zhao, Kai Zheng, Yue Cui, Han Su 等ICDE 2020 · 被引用 86 次
- Fairness-aware Task Assignment in Spatial Crowdsourcing: Game-Theoretic ApproachesYan Zhao, Kai Zheng, Jiannan Guo, Bin Yang 等ICDE 2021 · 被引用 81 次
- Differentially Private Online Task Assignment in Spatial Crowdsourcing: A Tree-based ApproachQian Tao, Yongxin Tong, Zimu Zhou, Yexuan Shi 等ICDE 2020 · 被引用 77 次
- Optimizing Bipartite Matching in Real-World Applications by Incremental Cost ComputationTenindra Abeywickrama, Victor Liang, Kian-Lee TanVLDB 2021 · 被引用 14 次
相关 Paper
- Online Capacitated General Matching with KnapsackRuoyu Wu, Wei Bao, Ben Liang, Hequn WangAAAI 2026
- Online Task Assignment Problems with Reusable ResourcesHanna Sumita, Shinji Ito, Kei Takemura, Daisuke Hatano 等AAAI 2022 · 被引用 10 次
- A Parametric Contextual Online Learning Theory of BrokerageFrançois Bachoc, Tommaso Cesari, Roberto ColomboniICML 2025
- Parameter-Dependent Competitive Analysis for Online Capacitated Coverage Maximization through Boostings and AttenuationsPan XuICML 2024
- Algorithmic Disruptions to Expertise: The Impact of the Home Valuation Tool Zestimate on Real Estate Professionals’ WorkSaara Luovanranta, Mohammad Hossein Jarrahi, Thomas OlssonCSCW 2026
