Derives cost-adjusted bounds on the reward-penalty ratio for incentive compatibility and individual rationality in binary aggregation without verification, maps feasible regions, and states a conditional all-conforming Nash equilibrium.
Using truth detection to incentivize workers in mobile crowdsourcing.IEEE transactions on mobile computing, 21(6):2257–2270, 2020
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.GT 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A Tunable Incentive Mechanism for Binary Aggregation Without Verification
Derives cost-adjusted bounds on the reward-penalty ratio for incentive compatibility and individual rationality in binary aggregation without verification, maps feasible regions, and states a conditional all-conforming Nash equilibrium.