{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T11:12:18Z","timestamp":1775301138249,"version":"3.50.1"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030053444","type":"print"},{"value":"9783030053451","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-05345-1_17","type":"book-chapter","created":{"date-parts":[[2018,12,7]],"date-time":"2018-12-07T09:07:56Z","timestamp":1544173676000},"page":"203-213","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Strategy-Proof Mechanism for Provisioning Non-obedient Resources Without Payment"],"prefix":"10.1007","author":[{"given":"Wei","family":"Song","sequence":"first","affiliation":[]},{"given":"Min","family":"Li","sequence":"additional","affiliation":[]},{"given":"Shun","family":"You","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,12,7]]},"reference":[{"key":"17_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-642-13119-6_30","volume-title":"Algorithms and Architectures for Parallel Processing","author":"M Mihailescu","year":"2010","unstructured":"Mihailescu, M., Teo, Y.M.: Strategy-proof dynamic resource pricing of multiple resource types on federated clouds. In: Hsu, C.-H., Yang, Laurence T., Park, J.H., Yeo, S.-S. (eds.) ICA3PP 2010. LNCS, vol. 6081, pp. 337\u2013350. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13119-6_30"},{"issue":"7","key":"17_CR2","doi-asserted-by":"publisher","first-page":"1650","DOI":"10.1109\/TPDS.2017.2785815","volume":"29","author":"X Liu","year":"2017","unstructured":"Liu, X., Li, W., Zhang, X.: Strategy-proof mechanism for provisioning and allocation virtual machines in heterogeneous clouds. IEEE Trans. Parallel Distrib. Syst. 29(7), 1650\u20131663 (2017)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"2","key":"17_CR3","doi-asserted-by":"publisher","first-page":"594","DOI":"10.1109\/TPDS.2014.2308224","volume":"26","author":"MM Nejad","year":"2015","unstructured":"Nejad, M.M., Mashayekhy, L., Grosu, D.: Truthful greedy mechanisms for dynamic virtual machine provisioning and allocation in clouds. IEEE Trans. Parallel Distrib. Syst. 26(2), 594\u2013603 (2015)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"4","key":"17_CR4","doi-asserted-by":"publisher","first-page":"2060","DOI":"10.1109\/TNET.2015.2444657","volume":"24","author":"W Shi","year":"2016","unstructured":"Shi, W., Zhang, L., Wu, C., Li, Z., Lau, F.C.M.: An online auction framework for dynamic resource provisioning in cloud computing. IEEE\/ACM Trans. Netw. 24(4), 2060\u20132073 (2016)","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"2","key":"17_CR5","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1109\/JSAC.2017.2659558","volume":"35","author":"MH Hajiesmaili","year":"2017","unstructured":"Hajiesmaili, M.H., Deng, L., Chen, M., Li, Z.: Incentivizing device-to-device load balancing for cellular networks: an online auction design. IEEE J. Sel. Areas Commun. 35(2), 265\u2013279 (2017)","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Anderegg, L., Eidenbenz, S.: Ad hoc-VCG: a truthful and cost efficient routing protocol for mobile ad-hoc networks with selfish agents. In: Proceedings of the 9th Annual International Conference on Mobile Computing and Networking, pp. 245\u2013259. ACM (2003)","DOI":"10.1145\/938985.939011"},{"issue":"5","key":"17_CR7","doi-asserted-by":"publisher","first-page":"708","DOI":"10.1109\/TPDS.2010.184","volume":"22","author":"A Gopinathan","year":"2011","unstructured":"Gopinathan, A., Li, Z.P., Li, B.C.: Group strategyproof multicast in wireless networks. IEEE Trans. Parallel Distrib. Syst. 22(5), 708\u2013715 (2011)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"5","key":"17_CR8","first-page":"871","volume":"35","author":"Q Wei","year":"2012","unstructured":"Wei, Q., Zhou, W., Ren, X.J.: A strategy-proof trust based decision mechanism for pervasive computing environments. Comput. Sci. 35(5), 871\u2013882 (2012)","journal-title":"Comput. Sci."},{"issue":"9","key":"17_CR9","doi-asserted-by":"publisher","first-page":"3144","DOI":"10.1109\/TCOMM.2014.2350503","volume":"62","author":"T Wang","year":"2014","unstructured":"Wang, T., Song, L., Han, Z., Saad, W.: Distributed cooperative sensing in cognitive radio networks: an overlapping coalition formation approach. IEEE Trans. Commun. 62(9), 3144\u20133160 (2014)","journal-title":"IEEE Trans. Commun."},{"issue":"2","key":"17_CR10","first-page":"69","volume":"49","author":"J Liu","year":"2015","unstructured":"Liu, J., Wang, Q.: A false data detecting scheme based on coalition game for vehicular ad-hoc network. J. Xi\u2019an Jiaotong Univ. 49(2), 69\u201373 (2015)","journal-title":"J. Xi\u2019an Jiaotong Univ."},{"issue":"1","key":"17_CR11","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1006\/game.1999.0790","volume":"35","author":"N Nisan","year":"2001","unstructured":"Nisan, N., Ronen, A.: Algorithmic mechanism design. Games Econ. Behav. 35(1), 166\u2013196 (2001)","journal-title":"Algorithmic mechanism design. Games Econ. Behav."},{"issue":"5","key":"17_CR12","doi-asserted-by":"publisher","first-page":"986","DOI":"10.1109\/JSAC.2014.2361092","volume":"33","author":"Y Xiao","year":"2015","unstructured":"Xiao, Y., Han, Z., Chen, K.-C.: Bayesian hierarchical mechanism design for cognitive radio networks. IEEE J. Sel. Areas Commun. 33(5), 986\u20131001 (2015)","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"Nejad, M. M., Mashayekhy, L., Grosu, D.: A family of truthful greedy mechanisms for dynamic virtual machine provisioning and allocation in clouds. In: Proceedings of the 6th IEEE International Conference on Cloud Computing, pp. 188\u2013195. IEEE Computer Society, Santa Clara (2013)","DOI":"10.1109\/CLOUD.2013.14"},{"issue":"3","key":"17_CR14","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1007\/PL00004200","volume":"18","author":"H Moulin","year":"2001","unstructured":"Moulin, H., Shenker, S.: Strategyproof sharing of submodular costs: budget balance versus efficiency. Econ. Theor. 18(3), 511\u2013533 (2001)","journal-title":"Econ. Theor."},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"Pal, M., Tardos, E.: Group strategyproof mechanisms via primal-dual algorithms. In: Proceedings 44th Annual IEEE Symposium on Foundations of Computer Science, pp. 584\u2013593. IEEE, Cambridge (2003)","DOI":"10.1109\/SFCS.2003.1238231"},{"issue":"5","key":"17_CR16","doi-asserted-by":"publisher","first-page":"913","DOI":"10.1109\/TPDS.2011.197","volume":"23","author":"ZP Li","year":"2012","unstructured":"Li, Z.P., Chu, X.W.: On achieving group-strategyproof multicast. IEEE Trans. Parallel Distrib. Syst. 23(5), 913\u2013923 (2012)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"17_CR17","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511800481","volume-title":"Algorithmic Game Theory","author":"N Nisan","year":"2007","unstructured":"Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V.: Algorithmic Game Theory. Cambridge University Press, Cambridge (2007)"},{"issue":"4","key":"17_CR18","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/BF00128122","volume":"35","author":"H Moulin","year":"1980","unstructured":"Moulin, H.: On strategy-proofness and single peakedness. Public Choice 35(4), 437\u2013455 (1980)","journal-title":"Public Choice"},{"key":"17_CR19","unstructured":"Gershkov, A., Moldovanu, B., Shi, X.W.: Optimal mechanism design without money. Technical Report, University of Toronto, 4 (2013)"},{"key":"17_CR20","unstructured":"Arribillagay, R.P., Massz, J.: Comparing generalized median voter schemes according to their manipulability. Technical Report, Universitat Autnoma de Barcelona and Barcelona GSE, 2 (2014)"},{"key":"17_CR21","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1016\/j.tcs.2011.11.041","volume":"497","author":"YK Cheng","year":"2013","unstructured":"Cheng, Y.K., Yu, W., Zhang, G.C.: Strategy-proof approximation mechanisms for an obnoxious facility game on networks. Theor. Comput. Sci. 497, 154\u2013163 (2013)","journal-title":"Theor. Comput. Sci."},{"issue":"5","key":"17_CR22","doi-asserted-by":"publisher","first-page":"1648","DOI":"10.1016\/j.jet.2010.03.006","volume":"145","author":"S Barber","year":"2010","unstructured":"Barber, S., Berga, D., Moreno, B.: Individual versus group strategyproofness when do they coincide. J. Econ. Theory 145(5), 1648\u20131674 (2010)","journal-title":"J. Econ. Theory"}],"container-title":["Lecture Notes in Computer Science","Security, Privacy, and Anonymity in Computation, Communication, and Storage"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-05345-1_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T10:18:06Z","timestamp":1775297886000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-05345-1_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030053444","9783030053451"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-05345-1_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"SpaCCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Security, Privacy and Anonymity in Computation, Communication and Storage","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Melbourne, NSW","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 December 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 December 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"spaccs2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/space2018.cse.iitk.ac.in\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}