论文标题
两侧匹配的非反应接近最佳算法
Non-asymptotic near optimal algorithms for two sided matchings
论文作者
论文摘要
考虑了一个双面匹配系统，假定服务器的固定速率达到固定速率，而客户的到达率是通过价格控制机制调制的。我们分析了一个损失模型，在该模型中，到达后未立即提供服务的客户以及排队模型，在该模型中，客户在队列中等待，直到获得服务为止。目的是最大程度地利用匹配的服务器和客户产生的平台利润，但要受到服务限制质量的质量，例如损失系统模型中服务器的预期等待时间以及排队模型中客户队列的稳定性。对于损失系统，在某种放松的情况下，我们表明最佳政策具有爆炸结构。我们还为简单定价策略提供了近似保证。对于排队系统，我们提出了一种简单的双模式匹配策略，并表明它获得了几乎最佳的利润。
A two-sided matching system is considered, where servers are assumed to arrive at a fixed rate, while the arrival rate of customers is modulated via a price-control mechanism. We analyse a loss model, wherein customers who are not served immediately upon arrival get blocked, as well as a queueing model, wherein customers wait in a queue until they receive service. The objective is to maximize the platform profit generated from matching servers and customers, subject to quality of service constraints, such as the expected wait time of servers in the loss system model, and the stability of the customer queue in the queuing model. For the loss system, subject to a certain relaxation, we show that the optimal policy has a bang-bang structure. We also derive approximation guarantees for simple pricing policies. For the queueing system, we propose a simple bi-modal matching strategy and show that it achieves near optimal profit.
