{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:25:32Z","timestamp":1750220732060,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,8,27]],"date-time":"2019-08-27T00:00:00Z","timestamp":1566864000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,8,27]]},"DOI":"10.1145\/3341161.3342874","type":"proceedings-article","created":{"date-parts":[[2020,1,15]],"date-time":"2020-01-15T21:07:04Z","timestamp":1579122424000},"page":"81-88","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Becoming gatekeepers together with allies"],"prefix":"10.1145","author":[{"given":"Yang","family":"Chen","sequence":"first","affiliation":[{"name":"The University of Auckland, Auckland, New Zealand"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiamou","family":"Liu","sequence":"additional","affiliation":[{"name":"The University of Auckland, Auckland, New Zealand"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,1,15]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"2597","volume-title":"How to build your network? a structural analysis,\" in Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence","author":"Moskvina A.","year":"2016","unstructured":"A. Moskvina and J. Liu , \" How to build your network? a structural analysis,\" in Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence . AAAI Press , 2016 , pp. 2597 -- 2603 . A. Moskvina and J. Liu, \"How to build your network? a structural analysis,\" in Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence. AAAI Press, 2016, pp. 2597--2603."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2018\/544"},{"key":"e_1_3_2_1_3_1","first-page":"75","volume-title":"Dynamic relationship building: exploitation versus exploration on a social network,\" in International Conference on Web Information Systems Engineering","author":"Yan B.","year":"2017","unstructured":"B. Yan , Y. Chen , and J. Liu , \" Dynamic relationship building: exploitation versus exploration on a social network,\" in International Conference on Web Information Systems Engineering . Springer , 2017 , pp. 75 -- 90 . B. Yan, Y. Chen, and J. Liu, \"Dynamic relationship building: exploitation versus exploration on a social network,\" in International Conference on Web Information Systems Engineering. Springer, 2017, pp. 75--90."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.67.026112"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s13278-016-0413-2"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.28945\/2270"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2016.06.007"},{"key":"e_1_3_2_1_8_1","first-page":"39","volume-title":"Integrating networks of equipotent nodes,\" in International Conference on Computational Social Networks","author":"Moskvina A.","year":"2016","unstructured":"A. Moskvina and J. Liu , \" Integrating networks of equipotent nodes,\" in International Conference on Computational Social Networks . Springer , 2016 , pp. 39 -- 50 . A. Moskvina and J. Liu, \"Integrating networks of equipotent nodes,\" in International Conference on Computational Social Networks. Springer, 2016, pp. 39--50."},{"key":"e_1_3_2_1_9_1","first-page":"223","volume-title":"IEEE","author":"Moskvina A.","year":"2016","unstructured":"A. Moskvina and J. Liu , \" Togetherness: an algorithmic approach to network integration,\" in 2016 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM) . IEEE , 2016 , pp. 223 -- 230 . A. Moskvina and J. Liu, \"Togetherness: an algorithmic approach to network integration,\" in 2016 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM). IEEE, 2016, pp. 223--230."},{"key":"e_1_3_2_1_10_1","first-page":"193","volume-title":"Balancing the pain and gain of hobnobbing: Utility-based network building over atributed social networks,\" in Proceedings of 17th International Conference on Autonomous Agents and MultiAgent Systems","author":"Cai Y.","year":"2018","unstructured":"Y. Cai , H. Zheng , J. Liu , B. Yan , H. Su , and Y. Liu , \" Balancing the pain and gain of hobnobbing: Utility-based network building over atributed social networks,\" in Proceedings of 17th International Conference on Autonomous Agents and MultiAgent Systems , 2018 , pp. 193 -- 201 . Y. Cai, H. Zheng, J. Liu, B. Yan, H. Su, and Y. Liu, \"Balancing the pain and gain of hobnobbing: Utility-based network building over atributed social networks,\" in Proceedings of 17th International Conference on Autonomous Agents and MultiAgent Systems, 2018, pp. 193--201."},{"key":"e_1_3_2_1_11_1","first-page":"1044","volume-title":"Establishing connections in a social network,\" in Pacific Rim International Conference on Artificial Intelligence","author":"Tang Y.","year":"2018","unstructured":"Y. Tang , J. Liu , W. Chen , and Z. Zhang , \" Establishing connections in a social network,\" in Pacific Rim International Conference on Artificial Intelligence . Springer , 2018 , pp. 1044 -- 1057 . Y. Tang, J. Liu, W. Chen, and Z. Zhang, \"Establishing connections in a social network,\" in Pacific Rim International Conference on Artificial Intelligence. Springer, 2018, pp. 1044--1057."},{"key":"e_1_3_2_1_12_1","volume-title":"Workshop Summary and Papers","author":"Borgatti S. P.","year":"2003","unstructured":"S. P. Borgatti , \"The key player problem,\" in Dynamic Social Network Modeling and Analysis : Workshop Summary and Papers . National Academies Press , 2003 , p. 241. S. P. Borgatti, \"The key player problem,\" in Dynamic Social Network Modeling and Analysis: Workshop Summary and Papers. National Academies Press, 2003, p. 241."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0023016"},{"key":"e_1_3_2_1_14_1","first-page":"85","article-title":"Reducibility among combinatorial problems,\" in Complexity of computer computations","author":"Karp R. M.","year":"1972","unstructured":"R. M. Karp , \" Reducibility among combinatorial problems,\" in Complexity of computer computations . Springer , 1972 , pp. 85 -- 103 . R. M. Karp, \"Reducibility among combinatorial problems,\" in Complexity of computer computations. Springer, 1972, pp. 85--103.","journal-title":"Springer"},{"key":"e_1_3_2_1_15_1","first-page":"321","article-title":"Distance domination in graphs","volume":"209","author":"Henning M. A.","year":"1998","unstructured":"M. A. Henning , \" Distance domination in graphs ,\" Pure and Applied Mathematics , vol. 209 , pp. 321 -- 350 , 1998 . M. A. Henning, \"Distance domination in graphs,\" Pure and Applied Mathematics, vol. 209, pp. 321--350, 1998.","journal-title":"Pure and Applied Mathematics"},{"key":"e_1_3_2_1_16_1","article-title":"The connected domination number of a graph","author":"Sampathkumar E.","year":"1979","unstructured":"E. Sampathkumar and H. Walikar , \" The connected domination number of a graph ,\" J. Math. Phys , 1979 . E. Sampathkumar and H. Walikar, \"The connected domination number of a graph,\" J. Math. Phys, 1979.","journal-title":"J. Math. Phys"},{"key":"e_1_3_2_1_17_1","first-page":"7","article-title":"On calculating connected dominating set for efficient routing in ad hoc wireless networks,\" in Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications","author":"Wu J.","year":"1999","unstructured":"J. Wu and H. Li , \" On calculating connected dominating set for efficient routing in ad hoc wireless networks,\" in Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications . ACM , 1999 , pp. 7 -- 14 . J. Wu and H. Li, \"On calculating connected dominating set for efficient routing in ad hoc wireless networks,\" in Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications. ACM, 1999, pp. 7--14.","journal-title":"ACM"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230100304"},{"volume-title":"k-tuple domination in graphs,\" Information Processing Letters","author":"Liao C.-S.","key":"e_1_3_2_1_19_1","unstructured":"C.-S. Liao and G. J. Chang , \" k-tuple domination in graphs,\" Information Processing Letters , vol. 87 , no. 1, pp. 45--50, 2003. C.-S. Liao and G. J. Chang, \"k-tuple domination in graphs,\" Information Processing Letters, vol. 87, no. 1, pp. 45--50, 2003."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2012.11.035"},{"key":"e_1_3_2_1_21_1","first-page":"330","volume-title":"Mixed dominating set: A parameterized perspective,\" in International Workshop on Graph-Theoretic Concepts in Computer Science","author":"Jain P.","year":"2017","unstructured":"P. Jain , M. Jayakrishnan , F. Panolan , and A. Sahu , \" Mixed dominating set: A parameterized perspective,\" in International Workshop on Graph-Theoretic Concepts in Computer Science . Springer , 2017 , pp. 330 -- 343 . P. Jain, M. Jayakrishnan, F. Panolan, and A. Sahu, \"Mixed dominating set: A parameterized perspective,\" in International Workshop on Graph-Theoretic Concepts in Computer Science. Springer, 2017, pp. 330--343."},{"key":"e_1_3_2_1_22_1","first-page":"276","article-title":"The projection games conjecture and the np-hardness of ln n-approximating set-cover","author":"Moshkovitz D.","year":"2012","unstructured":"D. Moshkovitz , \" The projection games conjecture and the np-hardness of ln n-approximating set-cover .\" in APPROX-RANDOM. Springer , 2012 , pp. 276 -- 287 . D. Moshkovitz, \"The projection games conjecture and the np-hardness of ln n-approximating set-cover.\" in APPROX-RANDOM. Springer, 2012, pp. 276--287.","journal-title":"APPROX-RANDOM. Springer"},{"key":"e_1_3_2_1_23_1","first-page":"477","volume-title":"A dynamic algorithm for reachability games played on trees,\" in International Symposium on Mathematical Foundations of Computer Science","author":"Khoussainov B.","year":"2009","unstructured":"B. Khoussainov , J. Liu , and I. Khaliq , \" A dynamic algorithm for reachability games played on trees,\" in International Symposium on Mathematical Foundations of Computer Science . Springer , 2009 , pp. 477 -- 488 . B. Khoussainov, J. Liu, and I. Khaliq, \"A dynamic algorithm for reachability games played on trees,\" in International Symposium on Mathematical Foundations of Computer Science. Springer, 2009, pp. 477--488."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1423812112"},{"key":"e_1_3_2_1_25_1","volume-title":"Robust optimization for tree-structured stochastic network design,\" arXiv preprint arXiv:1612.00104","author":"Wu X.","year":"2016","unstructured":"X. Wu , A. Kumar , D. Sheldon , and S. Zilberstein , \" Robust optimization for tree-structured stochastic network design,\" arXiv preprint arXiv:1612.00104 , 2016 . X. Wu, A. Kumar, D. Sheldon, and S. Zilberstein, \"Robust optimization for tree-structured stochastic network design,\" arXiv preprint arXiv:1612.00104, 2016."},{"key":"e_1_3_2_1_26_1","first-page":"257","volume-title":"ACM","author":"Kumar R.","year":"2006","unstructured":"R. Kumar , K. Punera , and A. Tomkins , \" Hierarchical topic segmentation of websites,\" in Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining . ACM , 2006 , pp. 257 -- 266 . R. Kumar, K. Punera, and A. Tomkins, \"Hierarchical topic segmentation of websites,\" in Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, 2006, pp. 257--266."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(75)90011-3"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1997.0917"},{"key":"e_1_3_2_1_29_1","first-page":"17","article-title":"On the evolution of random graphs","volume":"5","author":"Erd\u00f6s P.","year":"1960","unstructured":"P. Erd\u00f6s and A. R\u00e9nyi , \" On the evolution of random graphs ,\" Publ. Math. Inst. Hung. Acad. Sci , vol. 5 , pp. 17 -- 61 , 1960 . P. Erd\u00f6s and A. R\u00e9nyi, \"On the evolution of random graphs,\" Publ. Math. Inst. Hung. Acad. Sci, vol. 5, pp. 17--61, 1960.","journal-title":"Publ. Math. Inst. Hung. Acad. Sci"},{"key":"e_1_3_2_1_31_1","first-page":"1361","volume-title":"ACM","author":"Leskovec J.","year":"2010","unstructured":"J. Leskovec , D. Huttenlocher , and J. Kleinberg , \" Signed networks in social media,\" in Proceedings of the SIGCHI conference on human factors in computing systems . ACM , 2010 , pp. 1361 -- 1370 . J. Leskovec, D. Huttenlocher, and J. Kleinberg, \"Signed networks in social media,\" in Proceedings of the SIGCHI conference on human factors in computing systems. ACM, 2010, pp. 1361--1370."},{"key":"e_1_3_2_1_32_1","first-page":"221","volume-title":"2016 IEEE 16th International Conference on. IEEE","author":"Kumar S.","year":"2016","unstructured":"S. Kumar , F. Spezzano , V. Subrahmanian , and C. Faloutsos , \" Edge weight prediction in weighted signed networks,\" in Data Mining (ICDM) , 2016 IEEE 16th International Conference on. IEEE , 2016 , pp. 221 -- 230 . S. Kumar, F. Spezzano, V. Subrahmanian, and C. Faloutsos, \"Edge weight prediction in weighted signed networks,\" in Data Mining (ICDM), 2016 IEEE 16th International Conference on. IEEE, 2016, pp. 221--230."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1081870.1081893"}],"event":{"name":"ASONAM '19: International Conference on Advances in Social Networks Analysis and Mining","sponsor":["SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","IEEE CS"],"location":"Vancouver British Columbia Canada","acronym":"ASONAM '19"},"container-title":["Proceedings of the 2019 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3341161.3342874","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3341161.3342874","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:38:25Z","timestamp":1750199905000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3341161.3342874"}},"subtitle":["collaborative brokerage over social networks"],"short-title":[],"issued":{"date-parts":[[2019,8,27]]},"references-count":32,"alternative-id":["10.1145\/3341161.3342874","10.1145\/3341161"],"URL":"https:\/\/doi.org\/10.1145\/3341161.3342874","relation":{},"subject":[],"published":{"date-parts":[[2019,8,27]]},"assertion":[{"value":"2020-01-15","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}