Graphical Event Models (GEMs) can approximate any smooth multivariate temporal point processes and can be used for capturing the dynamics of events occurring in continuous time for applications with event logs like web logs or gene expression data. In this paper, we propose a multi-task transfer learning algorithm for Timescale GEMs (TGEMs): the aim is to learn the set of k models given k corresponding datasets from k distinct but related tasks. The goal of our algorithm is to find the set of models with the maximal posterior probability. The procedure encourages the learned structures to become similar and simultaneously modifies the structures in order to avoid local minima. Our algorithm is inspired from an universal consistent algorithm for TGEM learning that retrieves both qualitative and quantitative dependencies from event logs. We show on a toy example that our algorithm could help to learn related tasks even with limited data.