In this paper, we consider a Device-to-Device (D2D) cellular network in which idle users can work as relays between cell users and the base station to improve their data rate. The relaying induces a cost for the User Equipment Relays (UER), that should be compensated by a payment from the mobile operator so that UERs accept to offer the service. The problem hence arises for the operator of matching cell users and UERs at a reasonable cost and increasing the data rate. In this context, we consider the requirements of truthfulness, budget feasibility and acceptance of online scenarios to compare ON algorithm, which considers all constraints, with other three algorithms that were not built to respect all of them, Hungarian, Threshold and Online Weighted Knapsack (OWK). As expected, results show that if more constraints are considered, less devices are matched. Moreover, we observed that the budget constraint is the one that has greatest impact on the final result. We also noticed that OWK algorithm has very appealing results; however, it is not truthful. Lastly, although ON algorithm respects all requirements, it does not scale well considering the number of matched edges.