| Summary: | Thesis: S.M., Massachusetts Institute of Technology, Sloan School of Management, Operations Research Center, 2016. === This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections. === Cataloged from student-submitted PDF version of thesis. === Includes bibliographical references (pages 69-71). === An agent wants to form a connection with a predetermined set of target users over social media. Because forming a connection is known as "following" in social networks such as Twitter, we refer to this as the follow-back problem. The targets and their friends form a directed graph which we refer to as the "friends graph." The agent's goal is to get the targets to follow it, and it is allowed to interact with the targets and their friends. To understand what features impact the probability of an interaction resulting in a follow-back, we conduct an empirical analysis of several thousand interactions in Twitter. We build a model of the follow-back probabilities based upon this analysis which incorporates features such as the friend and follower count of the target and the neighborhood overlap of the target with the agent. We find optimal policies for simple network topologies such as directed acyclic graphs. For arbitrary directed graphs we develop integer programming heuristics that employ network centrality measures and a graph score we define as the follow-back score. We show that these heuristic policies perform well in simulation on a real Twitter network. === by Krishnan Rajagopalan. === S.M.
|
|---|
