Our main goal is to provide comparative analysis of several procedures for endogenous dynamic formation of the cooperation structure in TU games. In the paper we consider two approaches to endogenous graph formation based on sequential link announcement and revision. For the evaluation of the pros and cons when adding of a new link is in question, along with the Myerson value we consider also the average tree solution and the centrality rewarding Shapley and Myerson values, recently introduced.