Existing Research Problem model: online bipartite matching Objective: Nodes arrive and maximize the leave dynamically sum of weights 3 Match as soon as the node arrives 4 (instantaneous constraint) 5 Solution: online algorithms under instantaneous constraint Y. Tong et al, On line mobile microtask allocation in spatial crowdsourcing In ICDE 2016.⚫ Problem model: online bipartite matching ⚫ Solution: online algorithms under instantaneous constraint Existing Research 6 3 1 2 4 5 6 Nodes arrive and leave dynamically 2 3 4 1 2 Objective: maximize the sum of weights Match as soon as the node arrives (instantaneous constraint) Y. Tong et al, Online mobile microtask allocation in spatial crowdsourcing. In ICDE 2016