2015 IEEE Conference on Computer Communications (INFOCOM) 2015
DOI: 10.1109/infocom.2015.7218592
|View full text |Cite
|
Sign up to set email alerts
|

Truthful online double auctions for dynamic mobile crowdsourcing

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
45
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 75 publications
(45 citation statements)
references
References 13 publications
0
45
0
Order By: Relevance
“…Our paper focuses on the Stackelberg game-based incentive mechanism design to reveal the iteration strategy of the participating clients by solving the local subproblems for building a high-quality centralized learning model. Interestingly, incentive mechanism has been studied for years in mobile crowdsourcing/crowdsensing systems, especially with auction mechanisms (e.g., [31], [32], [33]), contract and tournament models (e.g, [34], [35]) and Stackelberg game-based incentive mechanisms such as in [36] and [37]. However, the design goals were specific towards fair and truthful data trading of distributed sensing tasks.…”
Section: Related Workmentioning
confidence: 99%
“…Our paper focuses on the Stackelberg game-based incentive mechanism design to reveal the iteration strategy of the participating clients by solving the local subproblems for building a high-quality centralized learning model. Interestingly, incentive mechanism has been studied for years in mobile crowdsourcing/crowdsensing systems, especially with auction mechanisms (e.g., [31], [32], [33]), contract and tournament models (e.g, [34], [35]) and Stackelberg game-based incentive mechanisms such as in [36] and [37]. However, the design goals were specific towards fair and truthful data trading of distributed sensing tasks.…”
Section: Related Workmentioning
confidence: 99%
“…Focusing on dynamic crowdsensing where participants arrive in an online manner, Zhao et al [13] presented two online incentive mechanisms using a multiple-stage sampling-accepting process. Similarly, Y. Wei et al [15] proposed an online incentive mechanism to maximize the number of matched pairs of participants and crowdsourcing service users when participants and service users are dynamically changing.…”
Section: Related Workmentioning
confidence: 99%
“…After the trimming process, the platform calculates temporary fee q j for each r j ∈ R s and temporary payment p i to each w i ∈ W s . For the calculation of q j and w i , the platform uses the ratio value v th /(α β th |Γ th |) of r th and the ratio value c th /λ β th of w th , which consequently make q j and p i the critical values to guarantee truthfulness of requesters and workers, respectively (line [14][15][16][17][18][19]. Note that we denote q j (p i ) temporary fee (temporary payment) because both q j and p i in the TA were initially calculated based on the assumption that all w i ∈ W s will meet the deadline and all r j ∈ R s will accordingly achieve their full valuation.…”
Section: Matching Stepmentioning
confidence: 99%
“…Aware of the paramount importance of attracting worker participation, the research community has recently developed various incentive mechanisms for MCS systems. Among them, game-theoretic incentive mechanisms , which utilize either auction [10][11][12][13][18][19][20][21][22][23][24][25][26][27][28] or other gametheoretic models [8,9,[14][15][16][17], have gained increasing popularity due to their ability to tackle workers' selfish and strategic behaviors. These mechanisms typically aim to maximize the platform's profit [14][15][16][17][18][19][20][21][22][23] or social welfare [9][10][11][12][13], and minimize the platform's payment [7,8,[24][25][26][27] or social cost [28].…”
Section: Related Workmentioning
confidence: 99%