Aug 2026· GeoInformatica· Vol 30· 0 citations· 38 references
TL;DR
A Reputation-Based Incentive Mechanism Double-Auction Model (RBIM), which considers both uneven worker arrivals and the diminishing returns of task quality, and consistently outperforms several benchmark algorithms, significantly improving task completion rates, task quality, and overall system utility.
Abstract
Mobile crowdsensing (MCS) leverages distributed mobile users to complete large-scale sensing tasks. With the rapid advancement of sensing capabilities in urban environments, data acquisition has become increasingly efficient and scalable. However, promoting user participation and improving task quality remain significant challenges. While auction-based models in MCS aim to optimize task allocation efficiency and incentivize high-quality data contributions, they often fail to account for the effective evaluation of worker distribution and task quality. To address these limitations, we propose a Reputation-Based Incentive Mechanism Double-Auction Model (RBIM), which considers both uneven worker arrivals and the diminishing returns of task quality. RBIM categorizes tasks based on difficulty levels, allowing workers to choose tasks aligned with their preferences. The task quality is evaluated by integrating platform costs and requester satisfaction, which subsequently influence both worker compensation and reputation scores. Moreover, the payment scheme incorporates reputation-based adjustments to further incentivize reliable participation and enhance task completion rates. Experimental results demonstrate that RBIM consistently outperforms several benchmark algorithms, significantly improving task completion rates, task quality, and overall system utility. Additionally, the proposed mechanism satisfies essential economic properties including individual rationality (IR), truthfulness (TF), and budget feasibility, while maximizing social welfare within given budget constraints (BC).
A trust incentive-driven consensus feedback mechanism that transforms ballots into structural and behavioral signals is developed that provides decision makers with a transparent and scalable way to incorporate consensus feedback into anonymous PB without requiring observed interpersonal trust data.
This work investigates the design of two-stage auctions that allow advertisers to submit and update their bids, with second-stage bids serving as refinements of the initial ones, and proposes a dynamic two-stage auction that adopts realization-dependent entry fees with discounts.
Yidan Xing, Rui Guo, Yi-Xin Tao et al.· Proceedings of the 32nd ACM...· 0 citations
This paper fully characterize implementable diffusion mechanisms within the combinatorial auction domain for the first time and applies the established theory to design a practical diffusion combinatorial auction, named the Exhausted-Reference Pricing Mechanism, which is incentive-compatible, individually rational, and...
Hao-Tian Zhu, Miao Li, Bin Li et al.· Proceedings of the Thirty-Fi...· 0 citations
An offline model-based RL framework for cost-controllable sequential incentive allocation is developed and an independent counterfactual scorer evaluates each learned policy on held-out logs, enabling pre-launch selection without costly online exposure.
Zi-Lin Zhao, Han Yang, Tian-Pei Yang et al.· 0 citations
This paper investigates two marketing strategies a reward-based crowdfunding platform employs to align its preferences with an entrepreneur’s choice of pledge and target levels. These are (a) how to promote campaigns to potential backers, and (b) how to share campaign revenues with the entrepreneur. Kickstarter, for in...
The key insight of C3Bid is to leverage channel-wise estimation bias as an explicit coupling mechanism, where campaign-level and channel-level bids are combined through bias-aware weighting to produce the final bid.
Yingjie Chen, Zhuo-Yang Li, Tian-Li Han et al.· Proceedings of the 32nd ACM...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.