We study a network creation model where players are vertices who decide upon their (undirected, unweighted) edges. The utility of a player is increasing in the centrality of her network position (i.e. closeness and betweenness centrality) and decreasing in her degree. We characterize properties of the stable networks, e.g., finding that stable networks for various parameters do not contain large cliques or small cycles. Moreover, we provide a full characterization of the efficient networks (networks that maximize the sum of utilities). The discrepancy between stable networks and efficient networks turns out to be substantial.