We study the online version of the Prize-Collecting Traveling Salesman Problem (PCTSP), a generalization of the Traveling Salesman Problem (TSP). In the TSP, the salesman has to visit a set of citieswhile minimizing the length of the overall tour. In the PCTSP, each city has a given weight and penalty, and the goal is to collect a given quota of the weights of the cities while minimizing the length of thetour plus the penalties of the cities not in the tour. In the online version, cities arrive over time. We give a 7/3-competitive algorithm for the problem, which compares with a lower bound of 2 on the competitive ratio of any deterministic algorithm. We also consider the special case of cities located on the real halfline, for which we prove lower and upper bounds of 1.89 and 2, respectively, on the competitive ratio ofdeterministic algorithms.