arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2008.03762math.OCmath.PR
收藏

具有策略服务器的乘叫平台的近最优控制

Near Optimal Control in Ride Hailing Platforms with Strategic Servers

Sushil Mahavir Varma, Francisco Castro, Siva Theja Maguluri

摘要:

受在线市场(如乘车)中的应用程序的启发,我们研究了战略服务器如何影响系统性能。我们考虑一个离散时间的过程中,异构类型的客户和服务器到达。每个客户加入其类型的队列,而服务器可能加入不同类型的队列,这取决于系统运营商公布的价格和不便成本。然后,系统操作员,兼容性图的约束下,决定匹配。我们的目标是设计一个最优控制(定价和匹配方案),以最大限度地提高利润减去预期的等待时间。我们开发了一个通用框架,使我们能够分析广泛的战略行为。特别是,我们将服务器的行为编码在一个适当定义的\emph{cost function}中,该\emph{cost function}可以根据各种设置进行定制。利用这个一般的费用函数,我们引入了一个新的概率流体问题。概率流体模型提供了可实现净利润的上界。然后,我们研究了系统下的一个大的市场制度,其中的到达率由$η$缩放,并提出了一个概率的两个价格的政策和最大权重匹配政策,导致在最多$O(η^{1/3})$的净利润损失。此外,根据广泛的客户定价政策,我们表明,任何匹配的政策,至少有$Ω(η^{1/3})$的净损益。为了显示我们的框架的通用性,我们提出了多个扩展我们的模型和分析。最后,我们通过数值模拟比较不同的成本模型,并分析所提出的定价和匹配政策的性能的讨论。

英文摘要:

Motivated by applications in online marketplaces such as ride-hailing, we study how strategic servers impact the system performance. We consider a discrete-time process in which, heterogeneous types of customers and servers arrive. Each customer joins their type's queue, while servers might join a different type's queue depending on the prices posted by the system operator and an inconvenience cost. Then the system operator, constrained by a compatibility graph, decides the matching. The objective is to design an optimal control (pricing and matching scheme) to maximize the profit minus the expected waiting times. We develop a general framework that enables us to analyze a broad range of strategic behaviors. In particular, we encode servers' behavior in a properly defined \emph{cost function} that can be tailored to various settings. Using this general cost function, we introduce a novel probabilistic fluid problem. The probabilistic fluid model provides an upper bound on the achievable net profit. We then study the system under a large market regime in which the arrival rates are scaled by $η$ and present a probabilistic two-price policy and a max-weight matching policy which results in a net profit-loss of at most $O(η^{1/3})$. In addition, under a broad class of customer pricing policies, we show that any matching policy has net profit-loss of at least $Ω(η^{1/3})$. To show generality of our framework, we present multiple extensions to our model and analysis. We conclude the discussion by presenting numerical simulations comparing different cost models and analyzing performance of the proposed pricing and matching policies.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑