We consider the matching problem on the line with advice complexity. We give a 1-competitive online algorithm with advice complexity $n-1,$ and show that there is no 1-competitive online algorithm reading less than $n-1$ bits of advice. Moreover, for each $0<k<n$ we present a $c(n/k)$-competitive online algorithm with advice complexity $O(k(\log N + \log n))$ where $n$ is the number of servers, $N$ is the distance of the minimal and maximal servers, and $c(n)$ is the complexity of the best online algorithm without advice.

翻译：我们研究了带建议复杂度的线上匹配问题。我们提出了一种具有$n-1$位建议复杂度的1-竞争性在线算法，并证明了不存在读取少于$n-1$位建议的1-竞争性在线算法。此外，对于每个$0<k<n$，我们提出了一种具有$O(k(\log N + \log n))$建议复杂度的$c(n/k)$-竞争性在线算法，其中$n$为服务器数量，$N$为最小与最大服务器间的距离，$c(n)$为无建议情况下最优在线算法的复杂度。