Show simple item record

dc.contributor.authorBassem, Christineen_US
dc.contributor.authorBestavros, Azeren_US
dc.date.accessioned2015-06-24T19:48:44Z
dc.date.available2015-06-24T19:48:44Z
dc.date.issued2012-02-10
dc.identifier.citationBassem, 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]
dc.identifier.urihttps://hdl.handle.net/2144/11390
dc.description.abstractMobile 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.en_US
dc.description.sponsorshipNational Science Foundation (1012798, 0952145, 0820138, 0720604, 0735974)en_US
dc.language.isoen_US
dc.publisherComputer Science Department, Boston Universityen_US
dc.relation.ispartofseriesBUCS Technical Reports;BUCS-TR-2012-002
dc.titleMechanism design for spatio-temporal request satisfaction in mobile networksen_US
dc.typeTechnical Reporten_US


This item appears in the following Collection(s)

Show simple item record