Online Matching in Geometric Random Graphs
share
In online advertisement, ad campaigns are sequentially displayed to users. Both users and campaigns have inherent features, and the former is eligible to the latter if they are “similar enough”. We model these interactions as a bipartite geometric random graph: the features of the 2N vertices (N users and N campaigns) are drawn independently in a metric space and an edge is present between a campaign and a user node if the distance between their features is smaller than c/N, where c>0 is the parameter of the model. Our contributions are two-fold. In the one-dimensional case, with uniform distribution over the segment [0,1], we derive the size of the optimal offline matching in these bipartite random geometric graphs, and we build an algorithm achieving it (as a benchmark), and analyze precisely its performance. We then turn to the online setting where one side of the graph is known at the beginning while the other part is revealed sequentially. We study the number of matches of the online algorithm closest, which matches any incoming point to its closest available neighbor. We show that its performances can be compared to its fluid limit, completely described as the solution of an explicit PDE. From the latter, we can compute the competitive ratio of closest.
READ FULL TEXT