{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T15:19:29Z","timestamp":1775229569310,"version":"3.50.1"},"reference-count":46,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2024,4,1]],"date-time":"2024-04-01T00:00:00Z","timestamp":1711929600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,4,1]],"date-time":"2024-04-01T00:00:00Z","timestamp":1711929600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,4,1]],"date-time":"2024-04-01T00:00:00Z","timestamp":1711929600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61972272"],"award-info":[{"award-number":["61972272"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62072321"],"award-info":[{"award-number":["62072321"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100010023","name":"Natural Science Foundation of the Jiangsu Higher Education Institutions of China","doi-asserted-by":"publisher","award":["21KJA520008"],"award-info":[{"award-number":["21KJA520008"]}],"id":[{"id":"10.13039\/501100010023","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100010023","name":"Natural Science Foundation of the Jiangsu Higher Education Institutions of China","doi-asserted-by":"publisher","award":["22KJA520007"],"award-info":[{"award-number":["22KJA520007"]}],"id":[{"id":"10.13039\/501100010023","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Qinlan Project of Jiangsu Province"},{"name":"Six Talent Peak Project of Jiangsu Province","award":["XYDXX-084"],"award-info":[{"award-number":["XYDXX-084"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput. Soc. Syst."],"published-print":{"date-parts":[[2024,4]]},"DOI":"10.1109\/tcss.2023.3285605","type":"journal-article","created":{"date-parts":[[2023,6,23]],"date-time":"2023-06-23T17:32:40Z","timestamp":1687541560000},"page":"2147-2159","source":"Crossref","is-referenced-by-count":10,"title":["Fairness-Aware Competitive Bidding Influence Maximization in Social Networks"],"prefix":"10.1109","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-5022-9413","authenticated-orcid":false,"given":"Congcong","family":"Zhang","sequence":"first","affiliation":[{"name":"School of Computer Science and Technology, Soochow University, Suzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0721-7424","authenticated-orcid":false,"given":"Jingya","family":"Zhou","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Soochow University, Suzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0766-9906","authenticated-orcid":false,"given":"Jin","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Soochow University, Suzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7055-5891","authenticated-orcid":false,"given":"Jianxi","family":"Fan","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Soochow University, Suzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yingdan","family":"Shi","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Soochow University, Suzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2020.3045783"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/3409108"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TCSS.2020.3032559"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s11280-018-0651-5"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TCSS.2020.3037040"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2022.01.093"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.26599\/TST.2022.9010050"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25280-8_13"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/3155133.3155157"},{"key":"ref10","first-page":"211","article-title":"Maximal information propagation with budgets","volume-title":"Proc. 24th Eur. Conf. Artif. Intell.","volume":"325","author":"Shi"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2023.103278"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/1282100.1282167"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2020.2966593"},{"key":"ref14","first-page":"11472","article-title":"Online competitive influence maximization","volume-title":"Proc. Int. Conf. Artif. Intell. Stat.","volume":"151","author":"Zuo"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77105-0_31"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2723710"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2014.7028557"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/LCSYS.2018.2846185"},{"key":"ref19","article-title":"Competitive influence maximization: Integrating budget allocation and seed selection","author":"Ansari","year":"2019","journal-title":"arXiv:1912.12283"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783392"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487649"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2018.8485904"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2020.2997021"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1080\/17445760.2022.2094379"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/s10462-021-09996-w"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11794"},{"key":"ref27","first-page":"7254","article-title":"Learning attentional communication for multi-agent cooperation","volume-title":"Proc. Conf. Adv. Neural Inf. Process. Syst.","author":"Jiang"},{"key":"ref28","first-page":"2137","article-title":"Learning to communicate with deep multi-agent reinforcement learning","volume-title":"Proc. Conf. Adv. Neural Inf. Process. Syst.","author":"Foerster"},{"key":"ref29","first-page":"4190","article-title":"A unified game-theoretic approach to multiagent reinforcement learning","volume-title":"Proc. Conf. Adv. Neural Inf. Process. Syst.","author":"Lanctot"},{"key":"ref30","first-page":"1","article-title":"Emergent complexity via multi-agent competition","volume-title":"Proc. 6th Int. Conf. Learn. Represent.","author":"Bansal"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2017.2679115"},{"key":"ref32","first-page":"1","article-title":"Learning when to communicate at scale in multiagent cooperative and competitive tasks","volume-title":"Proc. 7th Int. Conf. Learn. Represent.","author":"Singh"},{"key":"ref33","first-page":"6379","article-title":"Multi-agent actor-critic for mixed cooperative-competitive environments","volume-title":"Proc. Conf. Adv. Neural Inf. Process. Syst.","author":"Lowe"},{"issue":"7","key":"ref34","first-page":"1","article-title":"Decomposition of Gini and the generalized entropy inequality measures","volume":"4","author":"Mussard","year":"2003","journal-title":"Econ. Bull."},{"key":"ref35","volume-title":"Auction Theory","author":"Krishna","year":"2009"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623357"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2017.05.004"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2012.79"},{"key":"ref39","volume-title":"SNAP Datasets: Stanford Large Network Dataset Collection","author":"Leskovec","year":"2014"},{"key":"ref40","first-page":"1192","article-title":"Online influence maximization under linear threshold model","volume-title":"Proc. Conf. Adv. Neural Inf. Process. Syst.","author":"Li"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/s13278-020-00704-0"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2019.01199"},{"key":"ref43","first-page":"1","article-title":"Continuous control with deep reinforcement learning","volume-title":"Proc. 4th Int. Conf. Learn. Represent.","author":"Lillicrap"},{"key":"ref44","first-page":"1587","article-title":"Addressing function approximation error in actor-critic methods","volume-title":"Proc. 35th Int. Conf. Mach. Learn.","author":"Fujimoto"},{"key":"ref45","first-page":"1861","article-title":"Soft actor-critic: Off-policy maximum entropy deep reinforcement learning with a stochastic actor","volume-title":"Proc. 35th Int. Conf. Mach. Learn.","author":"Haarnoja"},{"key":"ref46","article-title":"Proximal policy optimization algorithms","author":"Schulman","year":"2017","journal-title":"arXiv:1707.06347"}],"container-title":["IEEE Transactions on Computational Social Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6570650\/10488768\/10161600.pdf?arnumber=10161600","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,3]],"date-time":"2024-04-03T17:53:10Z","timestamp":1712166790000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10161600\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4]]},"references-count":46,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tcss.2023.3285605","relation":{},"ISSN":["2329-924X","2373-7476"],"issn-type":[{"value":"2329-924X","type":"electronic"},{"value":"2373-7476","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,4]]}}}