Optimal Task Partition with Delay Requirement in Mobile Crowdsourcing

Algorithm 2

Unsuccessful assignment attempts for task i.

	Input:
	The probability Piw denoting that a worker accepts the subtask of task
	The optimal task partition
	The maximal value can be obtained
	The number m of slots within
	Output:
	Average unsuccessful number of subtask assignment attempts E[U]
(1)	Based on transition probability matrix Q and the optimal task partition in Algorithm 1, is obtained
(2)	Using , is defined to describe invalid attempts based on Equation (12)
(3)	Using equations (13) and (14), is converted to denoting the probability generating function of unsuccessful attempts
(4)	Using Equation (15), average unsuccessful attempts E[U] is obtained
	Return E[U]