Abstract:
This report addresses the problem of online metric matching. In this scenario, a group of servers is situated within a metric space, and requests continuously arrive over time in an unpredictable manner. The objective is to promptly match each incoming request with an available server. The cost of matching a request to a server is determined by the distance between them in the metric space. The ultimate goal is to minimize the expected total cost incurred while matching all the requests to the servers.