网络外部性下的信息管理时代经济学

Shugang Hao, Lingjie Duan
{"title":"网络外部性下的信息管理时代经济学","authors":"Shugang Hao, Lingjie Duan","doi":"10.1145/3323679.3326511","DOIUrl":null,"url":null,"abstract":"Online content platforms are concerned about the freshness of their content updates to their end customers, and increasingly more platforms now invite and pay the crowd to share real-time information (e.g., news and sensor data) to help reduce their ages of information (AoI). How much crowdsourced data to sample and buy over time is a critical question for a platform's AoI management, requiring a good balance between its AoI and the incurred sampling cost. This question becomes more interesting by considering the stage after sampling, where two platforms coexist in sharing the content delivery network of limited bandwidth, and one platform's update may jam or preempt the other's under negative network externalities. When the two selfish platforms know each other's sampling costs, we formulate their interaction as a non-cooperative game and show both want to over-sample to reduce their own AoI, causing the price of anarchy (PoA) to be infinity. To remedy this huge efficiency loss, we propose a non-monetary trigger mechanism of punishment in a repeated game to enforce the platforms' cooperation to achieve the social optimum. We also study the more challenging incomplete information scenario that platform 1 knows more information about sampling cost than platform 2 by hiding its sampling cost information in the Bayesian game. Perhaps surprisingly, we show that even platform 1 may get hurt by knowing more information. We successfully redesign the trigger-and-punishment mechanism to negate platform 1's information advantage and ensure no cheating. As compared to the social optimum, extensive simulations show that the mechanisms can remedy the huge efficiency loss due to platform competition in different information scenarios.","PeriodicalId":205641,"journal":{"name":"Proceedings of the Twentieth ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"Economics of Age of Information Management under Network Externalities\",\"authors\":\"Shugang Hao, Lingjie Duan\",\"doi\":\"10.1145/3323679.3326511\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Online content platforms are concerned about the freshness of their content updates to their end customers, and increasingly more platforms now invite and pay the crowd to share real-time information (e.g., news and sensor data) to help reduce their ages of information (AoI). How much crowdsourced data to sample and buy over time is a critical question for a platform's AoI management, requiring a good balance between its AoI and the incurred sampling cost. This question becomes more interesting by considering the stage after sampling, where two platforms coexist in sharing the content delivery network of limited bandwidth, and one platform's update may jam or preempt the other's under negative network externalities. When the two selfish platforms know each other's sampling costs, we formulate their interaction as a non-cooperative game and show both want to over-sample to reduce their own AoI, causing the price of anarchy (PoA) to be infinity. To remedy this huge efficiency loss, we propose a non-monetary trigger mechanism of punishment in a repeated game to enforce the platforms' cooperation to achieve the social optimum. We also study the more challenging incomplete information scenario that platform 1 knows more information about sampling cost than platform 2 by hiding its sampling cost information in the Bayesian game. Perhaps surprisingly, we show that even platform 1 may get hurt by knowing more information. We successfully redesign the trigger-and-punishment mechanism to negate platform 1's information advantage and ensure no cheating. As compared to the social optimum, extensive simulations show that the mechanisms can remedy the huge efficiency loss due to platform competition in different information scenarios.\",\"PeriodicalId\":205641,\"journal\":{\"name\":\"Proceedings of the Twentieth ACM International Symposium on Mobile Ad Hoc Networking and Computing\",\"volume\":\"9 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-04-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the Twentieth ACM International Symposium on Mobile Ad Hoc Networking and Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3323679.3326511\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Twentieth ACM International Symposium on Mobile Ad Hoc Networking and Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3323679.3326511","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11

摘要

在线内容平台关注其内容更新对最终客户的新鲜度,现在越来越多的平台邀请和付费人群分享实时信息(例如新闻和传感器数据),以帮助减少他们的信息年龄(AoI)。对于平台的AoI管理来说,采样和购买多少众包数据是一个关键问题,需要在AoI和产生的采样成本之间取得良好的平衡。考虑到采样后的阶段,这个问题变得更加有趣,两个平台共存共享有限带宽的内容分发网络,在负网络外部性下,一个平台的更新可能会阻塞或抢占另一个平台的更新。当两个自私的平台知道彼此的采样成本时,我们将它们的交互描述为非合作游戏,并表明两者都希望通过过度采样来减少自己的AoI,从而导致无政府状态的价格(PoA)无穷大。为了弥补这种巨大的效率损失,我们提出了一种非货币触发机制,在重复博弈中强制平台合作以实现社会最优。我们还研究了更具挑战性的不完全信息场景,即平台1通过在贝叶斯博弈中隐藏其采样成本信息而比平台2了解更多关于采样成本的信息。也许令人惊讶的是,我们表明即使是平台1也可能因为知道更多的信息而受到伤害。我们成功地重新设计了触发和惩罚机制,否定了平台1的信息优势,确保不作弊。与社会最优相比,大量的仿真表明,该机制可以弥补不同信息场景下平台竞争带来的巨大效率损失。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Economics of Age of Information Management under Network Externalities
Online content platforms are concerned about the freshness of their content updates to their end customers, and increasingly more platforms now invite and pay the crowd to share real-time information (e.g., news and sensor data) to help reduce their ages of information (AoI). How much crowdsourced data to sample and buy over time is a critical question for a platform's AoI management, requiring a good balance between its AoI and the incurred sampling cost. This question becomes more interesting by considering the stage after sampling, where two platforms coexist in sharing the content delivery network of limited bandwidth, and one platform's update may jam or preempt the other's under negative network externalities. When the two selfish platforms know each other's sampling costs, we formulate their interaction as a non-cooperative game and show both want to over-sample to reduce their own AoI, causing the price of anarchy (PoA) to be infinity. To remedy this huge efficiency loss, we propose a non-monetary trigger mechanism of punishment in a repeated game to enforce the platforms' cooperation to achieve the social optimum. We also study the more challenging incomplete information scenario that platform 1 knows more information about sampling cost than platform 2 by hiding its sampling cost information in the Bayesian game. Perhaps surprisingly, we show that even platform 1 may get hurt by knowing more information. We successfully redesign the trigger-and-punishment mechanism to negate platform 1's information advantage and ensure no cheating. As compared to the social optimum, extensive simulations show that the mechanisms can remedy the huge efficiency loss due to platform competition in different information scenarios.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信