运气在社交媒体影响者成功中的作用。

IF 1.3 Q3 COMPUTER SCIENCE, THEORY & METHODS Applied Network Science Pub Date : 2023-01-01 Epub Date: 2023-07-25 DOI:10.1007/s41109-023-00573-4
Stefania Ionescu, Anikó Hannák, Nicolò Pagan
{"title":"运气在社交媒体影响者成功中的作用。","authors":"Stefania Ionescu,&nbsp;Anikó Hannák,&nbsp;Nicolò Pagan","doi":"10.1007/s41109-023-00573-4","DOIUrl":null,"url":null,"abstract":"<p><strong>Motivation: </strong>Social media platforms centered around content creators (CCs) faced rapid growth in the past decade. Currently, millions of CCs make livable incomes through platforms such as YouTube, TikTok, and Instagram. As such, similarly to the job market, it is important to ensure the success and income (usually related to the follower counts) of CCs reflect the quality of their work. Since quality cannot be observed directly, two other factors govern the network-formation process: (a) the <i>visibility</i> of CCs (resulted from, e.g., recommender systems and moderation processes) and (b) the <i>decision-making process</i> of seekers (i.e., of users focused on finding CCs). Prior virtual experiments and empirical work seem contradictory regarding fairness: While the first suggests the expected number of followers of CCs reflects their quality, the second says that quality does not perfectly predict success.</p><p><strong>Results: </strong>Our paper extends prior models in order to bridge this gap between theoretical and empirical work. We (a) define a parameterized recommendation process which allocates visibility based on popularity biases, (b) define two metrics of individual fairness (ex-ante and ex-post), and (c) define a metric for seeker satisfaction. Through an analytical approach we show our process is an absorbing Markov Chain where exploring only the most popular CCs leads to lower expected times to absorption but higher chances of unfairness for CCs. While increasing the exploration helps, doing so only guarantees fair outcomes for the highest (and lowest) quality CC. Simulations revealed that CCs and seekers prefer different algorithmic designs: CCs generally have higher chances of fairness with anti-popularity biased recommendation processes, while seekers are more satisfied with popularity-biased recommendations. Altogether, our results suggest that while the exploration of low-popularity CCs is needed to improve fairness, platforms might not have the incentive to do so and such interventions do not entirely prevent unfair outcomes.</p>","PeriodicalId":37010,"journal":{"name":"Applied Network Science","volume":null,"pages":null},"PeriodicalIF":1.3000,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10368581/pdf/","citationCount":"0","resultStr":"{\"title\":\"The role of luck in the success of social media influencers.\",\"authors\":\"Stefania Ionescu,&nbsp;Anikó Hannák,&nbsp;Nicolò Pagan\",\"doi\":\"10.1007/s41109-023-00573-4\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p><strong>Motivation: </strong>Social media platforms centered around content creators (CCs) faced rapid growth in the past decade. Currently, millions of CCs make livable incomes through platforms such as YouTube, TikTok, and Instagram. As such, similarly to the job market, it is important to ensure the success and income (usually related to the follower counts) of CCs reflect the quality of their work. Since quality cannot be observed directly, two other factors govern the network-formation process: (a) the <i>visibility</i> of CCs (resulted from, e.g., recommender systems and moderation processes) and (b) the <i>decision-making process</i> of seekers (i.e., of users focused on finding CCs). Prior virtual experiments and empirical work seem contradictory regarding fairness: While the first suggests the expected number of followers of CCs reflects their quality, the second says that quality does not perfectly predict success.</p><p><strong>Results: </strong>Our paper extends prior models in order to bridge this gap between theoretical and empirical work. We (a) define a parameterized recommendation process which allocates visibility based on popularity biases, (b) define two metrics of individual fairness (ex-ante and ex-post), and (c) define a metric for seeker satisfaction. Through an analytical approach we show our process is an absorbing Markov Chain where exploring only the most popular CCs leads to lower expected times to absorption but higher chances of unfairness for CCs. While increasing the exploration helps, doing so only guarantees fair outcomes for the highest (and lowest) quality CC. Simulations revealed that CCs and seekers prefer different algorithmic designs: CCs generally have higher chances of fairness with anti-popularity biased recommendation processes, while seekers are more satisfied with popularity-biased recommendations. Altogether, our results suggest that while the exploration of low-popularity CCs is needed to improve fairness, platforms might not have the incentive to do so and such interventions do not entirely prevent unfair outcomes.</p>\",\"PeriodicalId\":37010,\"journal\":{\"name\":\"Applied Network Science\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":1.3000,\"publicationDate\":\"2023-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10368581/pdf/\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Applied Network Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/s41109-023-00573-4\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"2023/7/25 0:00:00\",\"PubModel\":\"Epub\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Applied Network Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/s41109-023-00573-4","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2023/7/25 0:00:00","PubModel":"Epub","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

摘要

动机:以内容创作者为中心的社交媒体平台在过去十年中面临着快速增长。目前,数以百万计的CC通过YouTube、TikTok和Instagram等平台赚取了宜居的收入。因此,与就业市场类似,确保CC的成功和收入(通常与追随者数量有关)反映其工作质量是很重要的。由于无法直接观察质量,另外两个因素控制着网络形成过程:(a)CC的可见性(例如,由推荐系统和审核过程产生)和(b)寻求者的决策过程(即,专注于寻找CC的用户)。先前的虚拟实验和实证工作在公平性方面似乎是矛盾的:虽然第一个实验表明CC的预期追随者数量反映了他们的质量,但第二个实验认为质量并不能完全预测成功。结果:我们的论文扩展了先前的模型,以弥合理论和实证工作之间的差距。我们(a)定义了一个参数化的推荐过程,该过程基于流行度偏差来分配可见性,(b)定义了两个个人公平性指标(事前和事后),以及(c)定义了寻求者满意度指标。通过分析方法,我们表明我们的过程是一个吸收马尔可夫链,其中只探索最流行的CC会导致较低的预期吸收时间,但CC不公平的几率较高。虽然增加探索有帮助,但这样做只能保证最高(和最低)质量CC的公平结果。模拟显示,CC和寻求者更喜欢不同的算法设计:CC通常在反流行偏见的推荐过程中有更高的公平机会,而寻求者对流行偏见的建议更满意。总之,我们的研究结果表明,虽然需要探索低人气CC来提高公平性,但平台可能没有这样做的动机,而且这种干预措施并不能完全防止不公平的结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

摘要图片

摘要图片

摘要图片

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
The role of luck in the success of social media influencers.

Motivation: Social media platforms centered around content creators (CCs) faced rapid growth in the past decade. Currently, millions of CCs make livable incomes through platforms such as YouTube, TikTok, and Instagram. As such, similarly to the job market, it is important to ensure the success and income (usually related to the follower counts) of CCs reflect the quality of their work. Since quality cannot be observed directly, two other factors govern the network-formation process: (a) the visibility of CCs (resulted from, e.g., recommender systems and moderation processes) and (b) the decision-making process of seekers (i.e., of users focused on finding CCs). Prior virtual experiments and empirical work seem contradictory regarding fairness: While the first suggests the expected number of followers of CCs reflects their quality, the second says that quality does not perfectly predict success.

Results: Our paper extends prior models in order to bridge this gap between theoretical and empirical work. We (a) define a parameterized recommendation process which allocates visibility based on popularity biases, (b) define two metrics of individual fairness (ex-ante and ex-post), and (c) define a metric for seeker satisfaction. Through an analytical approach we show our process is an absorbing Markov Chain where exploring only the most popular CCs leads to lower expected times to absorption but higher chances of unfairness for CCs. While increasing the exploration helps, doing so only guarantees fair outcomes for the highest (and lowest) quality CC. Simulations revealed that CCs and seekers prefer different algorithmic designs: CCs generally have higher chances of fairness with anti-popularity biased recommendation processes, while seekers are more satisfied with popularity-biased recommendations. Altogether, our results suggest that while the exploration of low-popularity CCs is needed to improve fairness, platforms might not have the incentive to do so and such interventions do not entirely prevent unfair outcomes.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Applied Network Science
Applied Network Science Multidisciplinary-Multidisciplinary
CiteScore
4.60
自引率
4.50%
发文量
74
审稿时长
5 weeks
期刊最新文献
A multilevel backbone extraction framework Online news ecosystem dynamics: supply, demand, diffusion, and the role of disinformation A bridge between influence models and control methods Link-limited bypass rewiring for enhancing the robustness of complex networks Persistent homology based Bottleneck distance in hypergraph products
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1