{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T22:06:23Z","timestamp":1794434783915,"version":"4.9.1"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642353109","type":"print"},{"value":"9783642353116","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-35311-6_36","type":"book-chapter","created":{"date-parts":[[2012,12,4]],"date-time":"2012-12-04T02:32:28Z","timestamp":1354588348000},"page":"482-488","source":"Crossref","is-referenced-by-count":3,"title":["Computing a Profit-Maximizing Sequence of Offers to Agents in a Social Network"],"prefix":"10.1007","author":[{"given":"Sayan","family":"Bhattacharya","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dmytro","family":"Korzhyk","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vincent","family":"Conitzer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"36_CR1","doi-asserted-by":"crossref","unstructured":"Ailon, N., Charikar, M., Newman, A.: Aggregating inconsistent information: ranking and clustering. In: STOC, pp. 684\u2013693 (2005)","DOI":"10.1145\/1060590.1060692"},{"issue":"1","key":"36_CR2","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1137\/050623905","volume":"20","author":"N. Alon","year":"2006","unstructured":"Alon, N.: Ranking tournaments. SIAM J. Discrete Math.\u00a020(1), 137\u2013142 (2006)","journal-title":"SIAM J. Discrete Math."},{"key":"36_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/978-3-642-10841-9_11","volume-title":"Internet and Network Economics","author":"D. Arthur","year":"2009","unstructured":"Arthur, D., Motwani, R., Sharma, A., Xu, Y.: Pricing Strategies for Viral Marketing on Social Networks. In: Leonardi, S. (ed.) WINE 2009. LNCS, vol.\u00a05929, pp. 101\u2013112. Springer, Heidelberg (2009)"},{"key":"36_CR4","doi-asserted-by":"crossref","unstructured":"Babaei, M., Mirzasoleiman, B., Safari, M., Jalili, M.: Revenue maximization in social networks through discounting. Working Paper (2012)","DOI":"10.1007\/s13278-012-0085-5"},{"issue":"1","key":"36_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/S0963548306007887","volume":"16","author":"P. Charbit","year":"2007","unstructured":"Charbit, P., Thomass\u00e9, S., Yeo, A.: The minimum feedback arc set problem is NP-hard for tournaments. Combinatorics, Probability & Computing\u00a016(1), 1\u20134 (2007)","journal-title":"Combinatorics, Probability & Computing"},{"key":"36_CR6","unstructured":"Conitzer, V.: Computing Slater rankings using similarities among candidates. In: AAAI (2006)"},{"key":"36_CR7","doi-asserted-by":"crossref","unstructured":"Domingos, P., Richardson, M.: Mining the network value of customers. In: KDD, pp. 57\u201366 (2001)","DOI":"10.1145\/502512.502525"},{"key":"36_CR8","doi-asserted-by":"crossref","unstructured":"Guruswami, V., Manokaran, R., Raghavendra, P.: Beating the random ordering is hard: Inapproximability of maximum acyclic subgraph. In: FOCS, pp. 573\u2013582 (2008)","DOI":"10.1109\/FOCS.2008.51"},{"key":"36_CR9","doi-asserted-by":"crossref","unstructured":"Haghpanah, N., Immorlica, N., Mirrokni, V.S., Munagala, K.: Optimal auctions with positive network externalities. In: ACM EC, pp. 11\u201320 (2011)","DOI":"10.1145\/1993574.1993577"},{"key":"36_CR10","doi-asserted-by":"crossref","unstructured":"Hartline, J.D., Mirrokni, V.S., Sundararajan, M.: Optimal marketing strategies over social networks. In: WWW, pp. 189\u2013198 (2008)","DOI":"10.1145\/1367497.1367524"},{"key":"36_CR11","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J.M., Tardos, \u00c9.: Maximizing the spread of influence through a social network. In: KDD, pp. 137\u2013146 (2003)","DOI":"10.1145\/956755.956769"}],"container-title":["Lecture Notes in Computer Science","Internet and Network Economics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-35311-6_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,9]],"date-time":"2019-05-09T11:12:35Z","timestamp":1557400355000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-35311-6_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642353109","9783642353116"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-35311-6_36","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-642-35311-6","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}