不规则流动:不完全信息下的动态联盟形成激励机制

IF 8.1 1区 计算机科学 0 COMPUTER SCIENCE, INFORMATION SYSTEMS
Zhilin Xu, Hao Sun, Panfei Sun
{"title":"不规则流动:不完全信息下的动态联盟形成激励机制","authors":"Zhilin Xu,&nbsp;Hao Sun,&nbsp;Panfei Sun","doi":"10.1016/j.ins.2025.122155","DOIUrl":null,"url":null,"abstract":"<div><div>The cornerstone of Mobile Crowdsensing is participant mobility, which means different participants will arrive and leave the system separately and their costs also change over time. The uncertainty of participants caused by participants irregular mobility will generate incomplete information, and requesters will be unaware of participants' arrival times, departure times, and cost information. Consequently, the match between requesters and participants by requesters-centric matching algorithm is infeasible because requesters cannot decide on matching strategies because of the lack of knowledge about which participants can be matched. Besides, on account of participant irregular mobility, the match is also unstable due to the irregular changes in participants, requesters may become dissatisfied with the original matching strategies. For incomplete information, a participants-centric matching algorithm where participants have the dominant power is proposed to eliminate the impact of participants' uncertainty. As to the instability of the match, a requesters classification algorithm that could reduce the computational complexity to polynomials is used to update the matching rules. We also promise that with irregular mobility in our algorithm, whichever requester, if not matched in this stage will certainly match participants in the next stage.</div></div>","PeriodicalId":51063,"journal":{"name":"Information Sciences","volume":"712 ","pages":"Article 122155"},"PeriodicalIF":8.1000,"publicationDate":"2025-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Irregular mobility: A dynamic alliance formation incentive mechanism under incomplete information\",\"authors\":\"Zhilin Xu,&nbsp;Hao Sun,&nbsp;Panfei Sun\",\"doi\":\"10.1016/j.ins.2025.122155\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>The cornerstone of Mobile Crowdsensing is participant mobility, which means different participants will arrive and leave the system separately and their costs also change over time. The uncertainty of participants caused by participants irregular mobility will generate incomplete information, and requesters will be unaware of participants' arrival times, departure times, and cost information. Consequently, the match between requesters and participants by requesters-centric matching algorithm is infeasible because requesters cannot decide on matching strategies because of the lack of knowledge about which participants can be matched. Besides, on account of participant irregular mobility, the match is also unstable due to the irregular changes in participants, requesters may become dissatisfied with the original matching strategies. For incomplete information, a participants-centric matching algorithm where participants have the dominant power is proposed to eliminate the impact of participants' uncertainty. As to the instability of the match, a requesters classification algorithm that could reduce the computational complexity to polynomials is used to update the matching rules. We also promise that with irregular mobility in our algorithm, whichever requester, if not matched in this stage will certainly match participants in the next stage.</div></div>\",\"PeriodicalId\":51063,\"journal\":{\"name\":\"Information Sciences\",\"volume\":\"712 \",\"pages\":\"Article 122155\"},\"PeriodicalIF\":8.1000,\"publicationDate\":\"2025-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Information Sciences\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0020025525002877\",\"RegionNum\":1,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"0\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information Sciences","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0020025525002877","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"0","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

移动众测的基础是参与者的移动性,这意味着不同的参与者将分别进入和离开系统,他们的成本也会随着时间的推移而变化。参与者不规律的移动导致参与者的不确定性会产生不完整的信息,请求者不知道参与者的到达时间、离开时间和成本信息。因此,通过以请求者为中心的匹配算法在请求者和参与者之间进行匹配是不可行的,因为请求者无法决定匹配策略,因为缺乏关于哪些参与者可以匹配的知识。此外,由于参与者的不规则移动,匹配也会因为参与者的不规则变化而变得不稳定,请求者可能会对原有的匹配策略产生不满。在信息不完全的情况下,提出了一种以参与者为中心、参与者占主导地位的匹配算法,消除了参与者不确定性的影响。针对匹配的不稳定性,采用将计算复杂度降低到多项式的请求者分类算法更新匹配规则。我们还承诺,在我们的算法中具有不规则的移动性,无论哪个请求者,如果在这一阶段没有匹配,一定会匹配下一阶段的参与者。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Irregular mobility: A dynamic alliance formation incentive mechanism under incomplete information
The cornerstone of Mobile Crowdsensing is participant mobility, which means different participants will arrive and leave the system separately and their costs also change over time. The uncertainty of participants caused by participants irregular mobility will generate incomplete information, and requesters will be unaware of participants' arrival times, departure times, and cost information. Consequently, the match between requesters and participants by requesters-centric matching algorithm is infeasible because requesters cannot decide on matching strategies because of the lack of knowledge about which participants can be matched. Besides, on account of participant irregular mobility, the match is also unstable due to the irregular changes in participants, requesters may become dissatisfied with the original matching strategies. For incomplete information, a participants-centric matching algorithm where participants have the dominant power is proposed to eliminate the impact of participants' uncertainty. As to the instability of the match, a requesters classification algorithm that could reduce the computational complexity to polynomials is used to update the matching rules. We also promise that with irregular mobility in our algorithm, whichever requester, if not matched in this stage will certainly match participants in the next stage.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Information Sciences
Information Sciences 工程技术-计算机:信息系统
CiteScore
14.00
自引率
17.30%
发文量
1322
审稿时长
10.4 months
期刊介绍: Informatics and Computer Science Intelligent Systems Applications is an esteemed international journal that focuses on publishing original and creative research findings in the field of information sciences. We also feature a limited number of timely tutorial and surveying contributions. Our journal aims to cater to a diverse audience, including researchers, developers, managers, strategic planners, graduate students, and anyone interested in staying up-to-date with cutting-edge research in information science, knowledge engineering, and intelligent systems. While readers are expected to share a common interest in information science, they come from varying backgrounds such as engineering, mathematics, statistics, physics, computer science, cell biology, molecular biology, management science, cognitive science, neurobiology, behavioral sciences, and biochemistry.
×
引用
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学术文献互助群
群 号:481959085
Book学术官方微信