Title
Non-asymptotic near optimal algorithms for two sided matchings
Abstract
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 bimodal matching strategy and show that it achieves near optimal profit.
Year
DOI
Venue
2022
10.23919/WiOpt56218.2022.9930577
2022 20th International Symposium on Modeling and Optimization in Mobile, Ad hoc, and Wireless Networks (WiOpt)
Keywords
DocType
ISBN
loss system model,customer queue,queuing model,optimal policy,simple pricing policies,queueing system,simple bimodal matching strategy,optimal profit,optimal algorithms,sided matchings,matching system,fixed rate,arrival rate,price-control mechanism,loss model,queueing model,service constraints,expected wait time,nonasymptotic near optimal algorithms
Conference
978-1-6654-6076-7
Citations 
PageRank 
References 
0
0.34
15
Authors
2
Name
Order
Citations
PageRank
Rahul Vaze146345.64
Jayakrishnan Nair201.01