Abstract
Crowd sensing is a novel sensing paradigm, in which a challenging task is to balance benefits of various participants, i.e., data requesters, data providers and transaction platforms for attracting sufficient participants. Little attention in literature has been paid to the transaction platform’s profit which is one of the major issues for maintaining a crowd sensing system consistently. In this paper, we aim to propose a mechanism design for optimizing the platform’s profit. For that, we first model the interactions in crowd sensing by leveraging tools of game theory, and then we prove the best strategy for maximizing the benefit of transaction platforms with satisfying individual rationality constraint and incentive compatibility constraint. Finally, we propose two practical algorithms based on the best strategy. Our simulations show that the algorithms are effective in terms of keeping the platform’s profit and time efficiency.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Ganti, R.K., Ye, F., Lei, H.: Mobile crowdsensing: current state and future challenges. IEEE Commun. Mag. 49(11), 32–39 (2011)
Capponi, A., Fiandrino, C., Kliazovich, D., et al.: A cost-effective distributed framework for data collection in cloud-based mobile crowd sensing architectures. IEEE Trans. Sustain. Comput. 2(1), 3–16 (2017)
Kalejaiye, G.B., Orefice, H.R., Moura, T.A., et al.: Frugal crowd sensing for bus arrival time prediction in developing regions. In: 2017 IEEE/ACM Second International Conference on Internet-of-Things Design and Implementation (IoTDI), pp. 355–356. IEEE (2017)
Aly, H., Basalamah, A., Youssef, M.: Automatic rich map semantics identification through smartphone-based crowd-sensing. IEEE Trans. Mob. Comput. 16, 2712–2725 (2016)
Fan, Y., Sun, H., Liu, X.: Truthful incentive mechanisms for dynamic and heterogeneous tasks in mobile crowdsourcing. In: 2015 IEEE 27th International Conference on Tools with Artificial Intelligence (ICTAI), pp. 881–888. IEEE (2015)
Wei, Y., et al.: Truthful online double auctions for dynamic mobile crowdsourcing. In: 2015 IEEE Conference on Computer Communications (INFOCOM). IEEE (2015)
Wen, Y., Shi, J., Zhang, Q., et al.: Quality-driven auction-based incentive mechanism for mobile crowd sensing. IEEE Trans. Veh. Technol. 64(9), 4203–4214 (2015)
Han, Y., Zhu, Y.: Profit-maximizing stochastic control for mobile crowd sensing platforms. In: 2014 IEEE 11th International Conference on Mobile Ad Hoc and Sensor Systems (MASS), pp. 145–153. IEEE (2014)
Shah-Mansouri, H., Wong, V.W.S.: Profit maximization in mobile crowdsourcing: a truthful auction mechanism. In: 2015 IEEE International Conference on Communications (ICC), pp. 3216–3221. IEEE (2015)
Luo, T., Tan, H.P., Xia, L.: Profit-maximizing incentive for participatory sensing. In: 2014 Proceedings of IEEE INFOCOM, pp. 127–135. IEEE (2014)
Harsanyi, J.C.: Games with incomplete information played by Bayesian players, I–III: Part I. The basic model. Manag. Sci. 50(12 supplement), 1804–1817 (2004). MLA
Myerson, R.B.: Optimal auction design. Math. Oper. Res. 6(1), 58–73 (1981)
Johnson, E.L., Kostreva, M.M., Suhl, U.H.: Solving 0–1 integer programming problems arising from large scale planning models. Oper. Res. 33(4), 803–819 (1985)
Munkres, J.: Algorithms for the assignment and transportation problems. J. Soci. Ind. Appl. Math. 5(1), 32–38 (1957)
Kuhn, H.W.: The Hungarian method for the assignment problem. Nav. Res. Logist. (NRL) 2(12), 83–97 (1955)
Acknowledgements
This research was supported by 863 under grant No. 2015AA015802, NSF of China under grant No. U1401253 and No. 61373155.
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Appendix: Proof of Lemma 1
Appendix: Proof of Lemma 1
Proof. The original problem that we formulated is as follows,
We first have \(\mathbb {E}_V\{\sum _{j=1}^{m}p^R_j(\mathbf v )\} = \sum _{j=1}^{m} \int _{0}^{\bar{v_j}} \mathbb {E}_{V_{R_j}} \{p^R_j(u,\mathbf v _{j}\} f^R_j(u)du\).
For data requester j, we discover \(\mathbb {E}_{V_{R_j}} \{p^R_j(u,\mathbf v _{j}\} = \mathbb {E}_{V_{R_j}}\{u(1-x^R_j(u,\mathbf v _{j})\} - U^R_j(u)\) according to its utility function. Recalling in incentive compatibility constraint, we manage to transform utility function in to following integration form, \( U^R_j(u) = U^R_j(0)+\int _{0}^{u}\mathbb {E}_{V_{R_j}}\{ (1-x^R_j(u,\mathbf v _{j})\}du\)
We then substitute the term in the integration with the above two equations.
We can apply integration by parts (\(f'= f^R_j(u), \quad g = \int _{0}^{u}\mathbb {E}_{V_{R_j}}\{ (1-x^R_j(x,\mathbf v _{j})\}dx \)) to the second term and rewrite the above equation, \(\sum _{j=1}^{m} \int _{0}^{\bar{v_j}} \int _{0}^{u} \mathbb {E}_{V_{R_j}} \{ (1-x^R_j(x,\mathbf v _{j}) \} dx f^R_j(u)du = \sum _{j=1}^{m} \mathbb {E}_V\{\frac{1-F^R_j(u)}{f^R_j(u)}(1-x^R_j(u,\mathbf v _{j})\}\).
So, we have rewrite the payment of data requesters with definition of \( Q^R_j(v_j) = v_j - \frac{1-F^R_j(v_j)}{f^R_j(v_j)} \): \( \mathbb {E}_V\{\sum _{j=1}^{m}p^R_j(\mathbf v )\} = \mathbb {E}_V\{\sum _{j=1}^{m} \{Q^R_j(v_j)-x^R_j(\mathbf v )Q^R_j(v_j)-U^R_j(0)\}\).
The deduction of data providers’ payment is almost the same. We first have: \(\mathbb {E}_V\{\sum _{i=1}^{n}p^W_i(\mathbf v )\} = \sum _{i=1}^{n} \int _{V_i} \mathbb {E}_{V_{W_i}} \{p^W_i(\mathbf v )\} f^W_i(\mathbf u )d\mathbf u \). Apply again integration form of utility function in individual rationality constraint to substitute the term in the integration.
The second term needs to simplify further. Replace \( V_i \) and \( f^W_i \) by their definition and apply integration by parts for every components in summation and \( f^W_{i,j}\), and the results is as follows: \(\mathbb {E}_V\{\sum _{i=1}^{n}p^W_i(\mathbf v )\} = \sum _{i=1}^{n}\mathbb {E}_V\{\sum _{j=1}^{m} \frac{F^W_{i,j}(c_j)}{f^W_{i,j}(c_j)}x^W_{i,j} +\sum _{j=1}^{m}x^W_{i,j}c_{i,j}+U^W_i(\bar{\mathbf{c }}_\mathbf i )\} \). Let \(Q^W_{i,j}(c_{i,j})\) represent \( \frac{F^W_{i,j}(c_{i,j})}{f^W_{i,j}(c_{i,j})} + c_{i,j}\), we have
\(\mathbb {E}_V\{\sum _{i=1}^{n}p^W_i(\mathbf v )\} = \sum _{i=1}^{n}\mathbb {E}_V\{\sum _{j=1}^{m} Q^W_{i,j} (c_{i,j})x^W_{i,j} +U^W_i(\bar{\mathbf{c }}_\mathbf i )\} \). In order to satisfy the individual rationality constraint and maximizing the profit of platform, our best choice is set all \(U^W_i(\mathbf c _\mathbf i ) \) and \( U^R_j(0) \) equal to zero according to Eqs. (14) and (15).
The final problem of the platform’s profit is as follows.
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Luo, X., Lu, J., Chen, G., Kong, L., Wu, MY. (2017). On the Profit-Maximizing for Transaction Platforms in Crowd Sensing. In: Gao, X., Du, H., Han, M. (eds) Combinatorial Optimization and Applications. COCOA 2017. Lecture Notes in Computer Science(), vol 10627. Springer, Cham. https://doi.org/10.1007/978-3-319-71150-8_6
Download citation
DOI: https://doi.org/10.1007/978-3-319-71150-8_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-71149-2
Online ISBN: 978-3-319-71150-8
eBook Packages: Computer ScienceComputer Science (R0)