A Near-Optimal Truthful Online Auction for Efficient Crowdsourced Data Trading with Dynamic Data Owners and Dynamic Data Requests

Algorithm 1

Online matching algorithm.

Input: The set of bids .

Output: The matching rule .

1 , , ;// is the set of all active bids which can provide accessible data block at current time slot.

2 whiledo

3  Remove expired bids (bids with ) from ;

4  Add newly active bids (bids with ) to ;

  /Greedy select the first bids with lowest bid price at each time slot .   /

5  for to do

    //Loop times.

6    Choose a bid with the lowest bid price and match it to the -th data request at current time slot, i.e., ;

7    ;//Remove from .

8  end for

9  

10 end while

11 return