Mechanism design for spatio-temporal request satisfaction in mobile networks
Date
2012-02-10
DOI
Authors
Bassem, Christine
Bestavros, Azer
Version
OA Version
Citation
Bassem, Christine; Bestavros, Azer. "Mechanism Design for Spatio-Temporal Request Satisfaction in Mobile Networks", Technical Report BUCS-TR-2012-002, Computer Science Department, Boston University, February 10, 2012. [Available from: http://hdl.handle.net/2144/11390]
Abstract
Mobile agents participating in geo-presence-capable crowdsourcing applications should be presumed rational, competitive, and willing to deviate from their routes if given the right incentive. In this paper, we design a mechanism that takes into consideration this rationality for request satisfaction in such applications. We propose the Geo-temporal Request Satisfaction (GRS) problem to be that of finding the optimal assignment of requests with specific spatio-temporal characteristics to competitive mobile agents subject to spatio-temporal constraints. The objective of the GRS problem is to maximize the total profit of the system subject to our rationality assumptions. We define the problem formally, prove that it is NP-Complete, and present a practical solution mechanism, which we prove to be convergent, and which we evaluate experimentally.