User Recruitment Algorithm for Maximizing Quality under Limited Budget in Mobile Crowdsensing

Algorithm 2

User-known cost recruitment algorithm based on CMAB.

	Input: R, P, , B, Y, Q[0,…n], Cost, , Task collection
	Output:
(1)	r = 1, Select the first option of each user to get the initial parameters
(2)	Update the corresponding , , , , Cost = 0
(3)	Average value of perceived task quality:
(4)	while true do
(5)	r = r+1
(6)	while
(7)	Calculate the ratio between the value of the perceived quality function and the cost of all users
(8)	Sort the candidate users in descending order of and store them in the array Q[0,…n]
(9)	for(i←1 to n)
(11)
(12)	if (and&F[i] = 0)
(13)	F[i] ←1
(14)	Add to
(15)	else
(16)
(17)	=  -Cost