Abstract
In recent years, auction theory has been extensively studied and many state-of-art solutions have been proposed aiming at allocating scarce resources (e.g. spectrum resources in wireless communications). Unfortunately, most of these studies assume that the auctioneer is always trustworthy in the sealed-bid auctions, which is not always true in a more realistic scenario. On the other hand, performance guarantee, such as social efficiency maximization, is also crucial for auction mechanism design. Therefore, the goal of this work is to design a series of strategyproof and privacy preserving auction mechanisms that maximize the social efficiency. To make the designed auction model more general, we allow the bidders to express their preferences about multiple items, which is often regarded as the multi-unit auction. As computing an optimal allocation in multi-unit auction is NP-hard, we design a set of near optimal allocation mechanisms with privacy preserving separately for: (1) The auction aims at identical multi-items trading; and (2) The auction aims at distinct multi-items trading, which is also known as combinatorial auction. To the best of our knowledge, we are the first to design strategyproof multi-unit auction mechanisms with privacy preserving, which maximize the social efficiency at the same time. The evaluation results corroborate our theoretical analysis, and show that our proposed methods achieve low computation and communication complexity.
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
Chen, D., Yin, S., Zhang, Q., Liu, M., Li, S.: Mining spectrum usage data: a large-scale spectrum measurement study. In: ACM Mobicom 2009, pp. 13–24 (2009)
Chung, Y.F., Huang, K.H., Lee, H.H., Lai, F., Chen, T.S.: Bidder-anonymous English auction scheme with privacy and public verifiability. J. Syst. Softw. 81(1), 113–119 (2008)
Cramton, P., Shoham, Y., Steinberg, R.: Combinatorial Auctions, vol. 475. MIT Press, Cambridge (2006)
Dobzinski, S., Nisan, N., Schapira, M.: Approximation algorithms for combinatorial auctions with complement-free bidders. In: Proceedings of the Thirty-Seventh Annual ACM Symposium on Theory of Computing (STOC), pp. 610–618 (2005)
Dong, M., Sun, G., Wang, X., Zhang, Q.: Combinatorial auction with time-frequency flexibility in cognitive radio networks. In: IEEE INFOCOM 2012, pp. 2282–2290 (2012)
Dong, W., Rallapalli, S., Jana, R., Qiu, L., Ramakrishnan, K., Razoumov, L., Zhang, Y., Cho, T.W.: iDEAL: incentivized dynamic cellular offloading via auctions. IEEE/ACM Trans. Netw. (TON) 22(4), 1271–1284 (2014)
Gopinathan, A., Li, Z.: Strategyproof auctions for balancing social welfare and fairness in secondary spectrum markets. In: IEEE INFOCOM 2011, pp. 3020–3028 (2011)
Huang, H., Sun, Y.-E., Li, X.-Y., Chen, Z., Yang, W., Xu, H.: Near-optimal truthful spectrum auction mechanisms with spatial and temporal reuse in wireless networks. In: ACM MobiHoc 2013, pp. 237–240 (2013)
Huang, Q., Tao, Y., Wu, F.: Spring: a strategy-proof and privacy preserving spectrum auction mechanism. In: IEEE INFOCOM 2013, pp. 827–835 (2013)
Kikuchi, H.: (M+1)st-price auction protocol. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 85(3), 676–683 (2002)
Krishna, V.: Auction Theory. Academic Press, San Diego (2009)
Lai, K., Goemans, M.X.: The knapsack problem, fully polynomial time approximation schemes (FPTAS) (2006). Accessed 3 Nov 2012
Lehmann, D., Oćallaghan, L., Shoham, Y.: Truth revelation in approximately efficient combinatorial auctions. J. ACM (JACM) 49(5), 577–602 (2002)
Lin, W.-Y., Lin, G.-Y., Wei, H.-Y.: Dynamic auction mechanism for cloud resource allocation. In: 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing (CCGrid), pp. 591–592 (2010)
Pan, M., Li, H., Li, P., Fang, Y.: Dealing with the untrustworthy auctioneer in combinatorial spectrum auctions. In: IEEE GLOBECOM 2011, pp. 1–5 (2011)
Pan, M., Zhu, X., Fang, Y.: Using homomorphic encryption to secure the combinatorial spectrum auction without the trustworthy auctioneer. Wirel. Netw. 18(2), 113–128 (2012)
Rothkopf, M.H., Pekeč, A., Harstad, R.M.: Computationally manageable combinational auctions. Manag. Sci. 44(8), 1131–1147 (1998)
Sun, Y.-E., Huang, H., Li, X.-Y., et al.: Privacy-preserving strategyproof auction mechanisms for resource allocation in wireless communications. Technical report, Soochow University, June 2016. http://home.ustc.edu.cn/~huang83/bigcom.pdf
Wang, X., Huang, L., Xu, H., Huang, H.: Truthful auction for resource allocation in cooperative cognitive radio networks. In: IEEE ICCCN 2015, pp. 1–8 (2015)
Wang, X., Li, Z., Xu, P., Xu, Y., Gao, X., Chen, H.-H.: Spectrum sharing in cognitive radio networks an auction-based approach. IEEE Trans. Syst. Man Cybern. Part B Cybern. 40(3), 587–596 (2010)
Zhou, X., Gandhi, S., Suri, S., Zheng, H.: eBay in the Sky: strategy-proof wireless spectrum auctions. In: ACM Mobicom 2008, pp. 2–13 (2008)
Acknowledgements
This work is partially supported by National Natural Science Foundation of China (NSFC) under Grant No. 61572342, No. 61303206, Natural Science Foundation of Jiangsu Province under Grant No. BK20151240, China Postdoctoral Science Foundation under Grant No. 2015M580470. Any opinions, findings, conclusions, or recommendations expressed in this paper are those of author(s) and do not necessarily reflect the views of the funding agencies (NSFC).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Sun, YE. et al. (2016). Privacy-Preserving Strategyproof Auction Mechanisms for Resource Allocation in Wireless Communications. In: Wang, Y., Yu, G., Zhang, Y., Han, Z., Wang, G. (eds) Big Data Computing and Communications. BigCom 2016. Lecture Notes in Computer Science(), vol 9784. Springer, Cham. https://doi.org/10.1007/978-3-319-42553-5_2
Download citation
DOI: https://doi.org/10.1007/978-3-319-42553-5_2
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-42552-8
Online ISBN: 978-3-319-42553-5
eBook Packages: Computer ScienceComputer Science (R0)