{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:28:23Z","timestamp":1742912903096,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030579791"},{"type":"electronic","value":"9783030579807"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-57980-7_14","type":"book-chapter","created":{"date-parts":[[2020,9,7]],"date-time":"2020-09-07T23:04:10Z","timestamp":1599519850000},"page":"211-225","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Targeted Intervention in Random Graphs"],"prefix":"10.1007","author":[{"given":"William","family":"Brown","sequence":"first","affiliation":[]},{"given":"Utkarsh","family":"Patange","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,9,8]]},"reference":[{"issue":"177","key":"14_CR1","first-page":"1","volume":"18","author":"E Abbe","year":"2018","unstructured":"Abbe, E.: Community detection and stochastic block models: recent developments. J. Mach. Learn. Res. 18(177), 1\u201386 (2018)","journal-title":"J. Mach. Learn. Res."},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Aiello, W., Chung, F., Lu, L.: A random graph model for massive graphs. In: Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, STOC 2000, pp. 171\u2013180. Association for Computing Machinery, New York (2000)","DOI":"10.1145\/335305.335326"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Akbarpour, M., Malladi, S., Saberi, A.: Diffusion, seeding, and the value of network information. In: Proceedings of the 2018 ACM Conference on Economics and Computation, EC 2018, p. 641. ACM, New York (2018)","DOI":"10.1145\/3219166.3219225"},{"key":"14_CR4","unstructured":"Avella-Medina, M., Parise, F., Schaub, M.T., Segarra, S.: Centrality measures for graphons. CoRR abs\/1707.09350 (2017). http:\/\/arxiv.org\/abs\/1707.09350"},{"key":"14_CR5","unstructured":"Avella-Medina, M., Parise, F., Schaub, M.T., Segarra, S.: Centrality measures for graphons (2017). http:\/\/arxiv.org\/abs\/1707.09350"},{"issue":"6144","key":"14_CR6","doi-asserted-by":"publisher","first-page":"1236498","DOI":"10.1126\/science.1236498","volume":"341","author":"A Banerjee","year":"2013","unstructured":"Banerjee, A., Chandrasekhar, A.G., Duflo, E., Jackson, M.O.: The diffusion of microfinance. Science 341(6144), 1236498 (2013). https:\/\/doi.org\/10.1126\/science.1236498","journal-title":"Science"},{"issue":"6","key":"14_CR7","doi-asserted-by":"publisher","first-page":"2453","DOI":"10.1093\/restud\/rdz008","volume":"86","author":"A Banerjee","year":"2019","unstructured":"Banerjee, A., Chandrasekhar, A.G., Duflo, E., Jackson, M.O.: Using gossips to spread information: theory and evidence from two randomized controlled trials. Rev. Econ. Stud. 86(6), 2453\u20132490 (2019)","journal-title":"Rev. Econ. Stud."},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Banerjee, A., G a, A., Duflo, E., Jackson, M.: Gossip: identifying central individuals in a social network, July 2014","DOI":"10.3386\/w20422"},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Breza, E., Chandrasekhar, A.G., McCormick, T.H., Pan, M.: Using aggregated relational data to feasibly identify network structure without network data (2017)","DOI":"10.3386\/w23491"},{"key":"14_CR10","unstructured":"Brown, W., Patange, U.: Targeted intervention in random graphs (2020). http:\/\/arxiv.org\/abs\/2007.06445"},{"issue":"4","key":"14_CR11","doi-asserted-by":"publisher","first-page":"883","DOI":"10.1287\/opre.1120.1066","volume":"60","author":"O Candogan","year":"2012","unstructured":"Candogan, O., Bimpikis, K., Ozdaglar, A.: Optimal pricing in networks with externalities. Oper. Res. 60(4), 883\u2013905 (2012)","journal-title":"Oper. Res."},{"key":"14_CR12","unstructured":"Canonne, C.L.: A short note on learning discrete distributions (2020)"},{"issue":"2","key":"14_CR13","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/PL00012580","volume":"6","author":"F Chung","year":"2002","unstructured":"Chung, F., Lu, L.: Connected components in random graphs with given expected degree sequences. Ann. Comb. 6(2), 125\u2013145 (2002)","journal-title":"Ann. Comb."},{"issue":"1","key":"14_CR14","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s000260300002","volume":"7","author":"F Chung","year":"2003","unstructured":"Chung, F., Lu, L., Vu, V.: Eigenvalues of random power law graphs. Ann. Comb. 7(1), 21\u201333 (2003)","journal-title":"Ann. Comb."},{"key":"14_CR15","doi-asserted-by":"publisher","first-page":"P215","DOI":"10.37236\/702","volume":"18","author":"F Chung","year":"2011","unstructured":"Chung, F., Radcliffe, M.: On the spectra of general random graphs. Electr. J. Comb. 18, P215 (2011)","journal-title":"Electr. J. Comb."},{"key":"14_CR16","unstructured":"Dasaratha, K.: Distributions of centrality on networks. Papers, September 2017. arXiv.org"},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"Dasgupta, A., Kumar, R., Sarlos, T.: On estimating the average degree. In: Proceedings of the 23rd International Conference on World Wide Web, WWW 2014, pp. 795\u2013806. Association for Computing Machinery, New York (2014)","DOI":"10.1145\/2566486.2568019"},{"key":"14_CR18","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/j.geb.2017.07.004","volume":"105","author":"G Demange","year":"2017","unstructured":"Demange, G.: Optimal targeting strategies in a network under complementarities. Games Econ. Behav. 105, 84\u2013103 (2017)","journal-title":"Games Econ. Behav."},{"key":"14_CR19","doi-asserted-by":"crossref","unstructured":"Eckles, D., Esfandiari, H., Mossel, E., Rahimian, M.A.: Seeding with costly network information (2019)","DOI":"10.2139\/ssrn.3386417"},{"key":"14_CR20","doi-asserted-by":"crossref","unstructured":"Galeotti, A., Golub, B., Goyal, S.: Targeting interventions in networks (2017)","DOI":"10.2139\/ssrn.3054353"},{"issue":"12","key":"14_CR21","doi-asserted-by":"publisher","first-page":"7821","DOI":"10.1073\/pnas.122653799","volume":"99","author":"M Girvan","year":"2002","unstructured":"Girvan, M., Newman, M.E.J.: Community structure in social and biological networks. Proc. Nat. Acad. Sci. 99(12), 7821\u20137826 (2002). https:\/\/doi.org\/10.1073\/pnas.122653799","journal-title":"Proc. Nat. Acad. Sci."},{"issue":"4","key":"14_CR22","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1002\/rsa.20203","volume":"32","author":"O Goldreich","year":"2008","unstructured":"Goldreich, O., Ron, D.: Approximating average parameters of graphs. Random Struct. Algorithms 32(4), 473\u2013493 (2008)","journal-title":"Random Struct. Algorithms"},{"key":"14_CR23","doi-asserted-by":"crossref","unstructured":"Huang, J., Mani, A., Wang, Z.: The value of price discrimination in large random networks. In: Proceedings of the 2019 ACM Conference on Economics and Computation (2019)","DOI":"10.1145\/3328526.3329617"},{"key":"14_CR24","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Faloutsos, C.: Sampling from large graphs. In: Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2006, pp. 631\u2013636. Association for Computing Machinery, New York (2006)","DOI":"10.1145\/1150402.1150479"},{"key":"14_CR25","doi-asserted-by":"crossref","unstructured":"Parise, F., Ozdaglar, A.: Graphon games: a statistical framework for network games and interventions (2018)","DOI":"10.2139\/ssrn.3437293"},{"key":"14_CR26","doi-asserted-by":"crossref","unstructured":"Ruggeri, N., Bacco, C.D.: Sampling on networks: estimating eigenvector centrality on incomplete graphs (2019)","DOI":"10.1007\/978-3-030-36687-2_8"},{"key":"14_CR27","doi-asserted-by":"crossref","unstructured":"Schaub, M.T., Segarra, S., Tsitsiklis, J.N.: Blind identification of stochastic block models from dynamical observations (2019)","DOI":"10.1137\/19M1263340"},{"key":"14_CR28","unstructured":"Tabouy, T., Barbillon, P., Chiquet, J.: Variational inference for stochastic block models from sampled data (2017)"},{"key":"14_CR29","unstructured":"Yun, S.Y., Proutiere, A.: Optimal sampling and clustering in the stochastic block model. In: Wallach, H., Larochelle, H., Beygelzimer, A., d\u2019Alch\u00e9-Buc, F., Fox, E., Garnett, R. (eds.) Advances in Neural Information Processing Systems, vol. 32, pp. 13422\u201313430. Curran Associates, Inc. (2019)"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-57980-7_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,24]],"date-time":"2021-04-24T05:03:11Z","timestamp":1619240591000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-57980-7_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030579791","9783030579807"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-57980-7_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"8 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAGT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Algorithmic Game Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Augsburg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sagt2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.uni-augsburg.de\/de\/fakultaet\/mntf\/math\/prof\/opt\/team\/harks\/sagt2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easy Chair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"53","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"21","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"40% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"8","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}