@inproceedings{wise2017,
 abstract = {Interpersonal relations facilitate information flow and give rise to positional advantage of individuals in a social network. We ask the question: How would an individual build relations with members of a dynamic social network in order to arrive at a central position in the network? We formalize this question using the dynamic network building problem. Two strategies stand out to solve this problem: The first directs the individual to exploit their social proximity by linking to nodes that are close-by, while the second tries its best to explore distant regions of the network. We evaluate and contrast these two strategies with respect to edge- and distance-based cost metrics, as well as other structural properties such as embeddedness and clustering coefficient. Experiments are performed on models of dynamic random graphs and real-world data sets. We then discuss and test ways that combine these two strategies.},
 address = {Cham},
 author = {<NAME>
and <NAME>
and <NAME>},
 booktitle = {Web Information Systems Engineering -- WISE 2017},
 editor = {Bouguettaya, Athman
and <NAME>
and Klimenko, Andrey
and <NAME>
and Zhang, Xiangliang
and Dzerzhinskiy, Fedor
and <NAME>
and Klimenko, <NAME>.
and <NAME>},
 isbn = {978-3-319-68783-4},
 pages = {75--90},
 publisher = {Springer International Publishing},
 title = {Dynamic Relationship Building: Exploitation Versus Exploration on a Social Network},
 year = {2017}
}

