{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T07:05:18Z","timestamp":1761807918134},"reference-count":16,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,6]]},"DOI":"10.1109\/icc.2014.6883935","type":"proceedings-article","created":{"date-parts":[[2014,9,3]],"date-time":"2014-09-03T14:10:33Z","timestamp":1409753433000},"page":"3932-3937","source":"Crossref","is-referenced-by-count":1,"title":["Maximizing influence propagation for new agents in Competitive Environments"],"prefix":"10.1109","author":[{"given":"Xiang","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dejun","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guoliang","family":"Xue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"year":"2003","author":"schrijver","journal-title":"Combinatorial Optimization Polyhedra and Efficiency","key":"15"},{"key":"16","doi-asserted-by":"crossref","DOI":"10.5040\/9798400607264","author":"tuten","year":"2008","journal-title":"Advertising 2 0 Social Media Marketing in A Web 2 0 World"},{"doi-asserted-by":"publisher","key":"13","DOI":"10.1145\/1281192.1281239"},{"year":"2008","author":"norris","journal-title":"Markov Chains ser Cambridge Series in Statistical and Probabilistic Mathematics","key":"14"},{"doi-asserted-by":"publisher","key":"11","DOI":"10.1086\/226707"},{"doi-asserted-by":"publisher","key":"12","DOI":"10.1145\/956750.956769"},{"doi-asserted-by":"publisher","key":"3","DOI":"10.1145\/1835804.1835934"},{"doi-asserted-by":"publisher","key":"2","DOI":"10.1145\/1282100.1282167"},{"doi-asserted-by":"publisher","key":"1","DOI":"10.1007\/978-3-540-77105-0_31"},{"doi-asserted-by":"publisher","key":"10","DOI":"10.1145\/1963192.1963217"},{"key":"7","article-title":"Maximizing non-monotone submodular functoins","author":"feige","year":"2007","journal-title":"Proc of the 48th Annual IEEE Symposium on Foundations of Computer Science"},{"doi-asserted-by":"publisher","key":"6","DOI":"10.1007\/978-3-642-25280-8_13"},{"doi-asserted-by":"publisher","key":"5","DOI":"10.1109\/ICDM.2010.118"},{"doi-asserted-by":"publisher","key":"4","DOI":"10.1145\/1557019.1557047"},{"doi-asserted-by":"publisher","key":"9","DOI":"10.1109\/ICDM.2011.132"},{"year":"1979","author":"garey","journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness Ser A Series of Books in the Mathematical Sciences","key":"8"}],"event":{"name":"ICC 2014 - 2014 IEEE International Conference on Communications","start":{"date-parts":[[2014,6,10]]},"location":"Sydney, NSW","end":{"date-parts":[[2014,6,14]]}},"container-title":["2014 IEEE International Conference on Communications (ICC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6878057\/6883277\/06883935.pdf?arnumber=6883935","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,2]],"date-time":"2024-06-02T06:16:07Z","timestamp":1717308967000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6883935\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/icc.2014.6883935","relation":{},"subject":[],"published":{"date-parts":[[2014,6]]}}}