research-article

Approximation Algorithms for Secondary Spectrum Auctions

Authors:

Thomas Kesselheim,

Berthold VöckingAuthors Info & Claims

ACM Transactions on Internet Technology (TOIT), Volume 14, Issue 2-3

Article No.: 16, Pages 1 - 24

https://doi.org/10.1145/2663496

Published: 28 October 2014 Publication History

Abstract

We study combinatorial auctions for secondary spectrum markets, where short-term communication licenses are sold to wireless nodes. Channels can be assigned to multiple bidders according to interference constraints captured by a conflict graph. We suggest a novel approach to such combinatorial auctions using a graph parameter called inductive independence number. We achieve good approximation results by showing that interference constraints for wireless networks imply a bounded inductive independence number. For example, in the physical model the factor becomes O(√k log² n) for n bidders and k channels. Our algorithms can be turned into incentive-compatible mechanisms for bidders with arbitrary valuations.

References

[1]

K. Akcoglu, J. Aspnes, B. Dasgupta, and M.-Y. Kao. 2002. Opportunity cost algorithms for combinatorial auctions. In Applied Optimization 74: Computational Methods in Decision-Making, Economics and Finance, E. Kontoghiorghes, B. Rustem, and S. Siokos, Eds., Kluwer, 455--479.

Digital Library

[2]

M. Alicherry, R. Bhatia, and L. E. Li. 2006. Joint channel assignment and routing for throughput optimization in multi-radio wireless mesh networks. IEEE J. Select. Areas Comm. 24, 11, 1960--1971.

Digital Library

[3]

H. Balakrishnan, C. Barrett, A. Kumar, M. Marathe, and S. Thite. 2004. The distance-2 matching problem and its relationship to the mac-layer capacity of ad hoc wireless networks. IEEE J. Select. Areas Comm. 22, 6, 1069--1079.

Digital Library

[4]

C. Barrett, A. Kumar, M. Marathe, S. Thite, and G. Istrate. 2006. Strong edge coloring for channel assignment in wireless radio networks. In Proceedings of the 4^th Pervasive Computing and Communications Workshops (PERCOMW'06). 106.

Digital Library

[5]

M. Buddhikot, P. Kolodzy, S. Miller, K. Ryan, and J. Evans. 2005. DIMSUMNet: New directions in wireless networking using coordinated dynamic spectrum access. In Proceedings of the 6^th IEEE International Symposium on a World of Wireless Mobile and Multimedia Networks (WoWMoM'05). 78--85.

Digital Library

[6]

G. Christodoulou, K. Elbassioni, and M. Fouz. 2010. Truthful mechanisms for exhibitions. In Proceedings of the 6^th International Workshop on Internet and Network Economics (WINE'10). 170--181.

Digital Library

[7]

P. Cramton, Y. Shoham, and R. Steinberg. Eds. 2006. Combinatorial Auctions. MIT Press.

Digital Library

[8]

S. Dobzinski, N. Nisan, and M. Schapira. 2012. Truthful randomized mechanisms for combinatorial auctions. J. Comput. Syst. Sci. 78, 1, 15--25.

Digital Library

[9]

A. Fanghänel, S. Geulen, M. Hoefer, and B. Vöcking. 2013. Online capacity maximization in wireless networks. J. Sched. 16, 1, 81--91.

Digital Library

[10]

A. Fanghänel, T. Kesselheim, H. Racke, and B. Vöcking. 2009. Oblivious interference scheduling. In Proceedings of the 28^th Symposium on Principles of Distributed Computing (PODC'09). 220--229.

Digital Library

[11]

A. Fanghänel, T. Kesselheim, and B. Vöcking. 2011. Improved algorithms for latency minimization in wireless networks. Theor. Comput. Sci. 412, 24, 2657--2667.

Digital Library

[12]

U. Feige and J. Vondrak. 2006. Approximation algorithms for allocation problems: Improving the factor of 1-1/e. In Proceedings of the 47^th Symposium on Foundations of Computer Science (FOCS'06). 667--676.

Digital Library

[13]

A. V. Fishkin. 2003. Disk graphs: A short survey. In Proceedings of the 1^st International Workshop on Approximation and Online Algorithms (WAOA'03). 260--264.

[14]

S. Gandhi, C. Buragohain, L. Cao, H. Zheng, and S. Suri. 2008. Towards real-time dynamic spectrum auctions. Comput. Netw. 52, 4, 879--897.

Digital Library

[15]

A. Gopinathan, Z. Li, and C. Wu. 2011. Strategy proof auctions for balancing social welfare and fairness in secondary spectrum markets. In Proceedings of the 30^th IEEE Conference on Computer Communications (INFOCOM'11). 3020--3028.

Digital Library

[16]

O. Goussevskaia, M. Halldorsson, R. Wattenhofer, and E. Welzl. 2009. Capacity of arbitrary wireless networks. In Proceedings of the 28^th IEEE Conference on Computer Communications (INFOCOM'09). 1872--1880.

[17]

A. Graf, M. Stumpf, and G. Weißenfels. 1998. On coloring unit disk graphs. Algorithmica 20, 3, 277--293.

[18]

P. Gupta and P. R. Kumar. 2000. The capacity of wireless networks. IEEE Trans. Inf. Theory 46, 2, 388--404.

Digital Library

[19]

M. Halldorsson. 2013. Wireless scheduling with power control. ACM Trans. Algor. 9, 1, 7.

Digital Library

[20]

M. Halldorsson, S. Holzer, P. Mitra, and R. Wattenhofer. 2013. The power of non-uniform wireless power. In Proceedings of the 24^th Symposium on Discrete Algorithms (SODA'13). 1595--1606.

Digital Library

[21]

M. Halldorsson and P. Mitra. 2011. Wireless capacity with oblivious power in general metrics. In Proceedings of the 22^nd Symposium on Discrete Algorithms (SODA'11). 1538--1548.

Digital Library

[22]

J. Hastad. 1999. Clique is hard to approximate within n^1-&epsi;. Acta Math. 182, 1, 105--142.

[23]

D. Hochbaum. 1983. Efficient bounds for the stable set, vertex cover and set packing problems. Discr. Appl. Math. 6, 3, 243--254.

[24]

M. Hoefer and T. Kesselheim. 2012. Secondary spectrum auctions for symmetric and submodular bidders. In Proceedings of the 13^th Conference on Electronic Commerce (EC'12). 657--671.

Digital Library

[25]

M. Hoefer and T. Kesselheim. 2013. Brief announcement: Universally truthful secondary spectrum auctions. In Proceedings of the 25^th Symposium on Parallelism in Algorithms and Architectures (SPAA'13). 99--101.

Digital Library

[26]

M. Hoefer, T. Kesselheim, and B. Vöcking. 2011. Approximation algorithms for secondary spectrum auctions. In Proceedings of the 23^rd Symposium on Parallelism in Algorithms and Architectures (SPAA'11). 177--186.

Digital Library

[27]

M. Hoefer, T. Kesselheim, and B. Vöcking. 2013. Truthfulness and stochastic dominance with monetary transfers. In Proceedings of the 14^th Conference on Electronic Commerce (EC'13). 567--582.

Digital Library

[28]

R. Holzman, N. Kfir-Dahav, D. Monderer, and M. Tennenholtz. 2004. Bundling equilibrium in combinatorial auctions. Games Econ. Behav. 47, 1, 104--123.

[29]

O. Ileri, D. Samardzija, T. Sizer, and N. Mandayam. 2005. Demand responsive pricing and competitive spectrum allocation via a spectrum server. In Proceedings of the 1^st IEEE International Symposium on New Frontiers in Dynamic Spectrum Access Networks (DySPAN'05). 194--202.

Digital Library

[30]

A. Kako, T. Ono, T. Hirata, and M. Halldórsson. 2009. Approximation algorithms for the weighted independent set problem in sparse graphs. Discr. Appl. Math. 157, 4, 617--626.

Digital Library

[31]

I. Kash, R. Murty, and D. Parkes. 2011. Enabling spectrum sharing in secondary market auctions. In Proceedings of the 6^th Workshop on the Economics of Networks, Systems, and Computation (NetEcon'11).

[32]

T. Kesselheim. 2011. A constant-factor approximation for wireless capacity maximization with power control in the sinr model. In Proceedings of the 22^nd Symposium on Discrete Algorithms (SODA'11). 1549--1559.

Digital Library

[33]

T. Kesselheim. 2012. Approximation algorithms for wireless link scheduling with flexible data rates. In Proceedings of the 20^th European Symposium on Algorithms (ESA'12). 659--670.

Digital Library

[34]

T. Kesselheim and B. Vöcking. 2010. Distributed contention resolution in wireless networks. In Proceedings of the 24^th International Symposium on Distributed Computing (DISC'10). 163--178.

Digital Library

[35]

S. Krumke, M. Marathe, and S. S. Ravi. 2001. Models and approximation algorithms for channel assignment in radio networks. Wirel. Netw. 7, 6, 575--584.

Digital Library

[36]

R. Lavi and C. Swamy. 2011. Truthful and near-optimal mechanism design via linear programming. J. ACM 58, 6, 25.

Digital Library

[37]

N. Nisan, E. Tardos, T. Roughgarden, and V. Vazirani. Eds. 2007. Algorithmic Game Theory. Cambridge University Press.

Digital Library

[38]

L. Trevisan. 2001. Non-approximability results for optimization problems on bounded degree instances. In Proceedings of the 33^rd Symposium on Theory of Computing (STOC'01). 453--461.

Digital Library

[39]

J. Vondrak. 2008. Optimal approximation for the submodular welfare problem in the value oracle model. In Proceedings of the 40^th Symposium on Theory of Computing (STOC'08). 67--74.

Digital Library

[40]

P.-J. Wan. 2009. Multiflows in multihop wireless networks. In Proceedings of the 10^th Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc'09). 85--94.

Digital Library

[41]

Y. Ye and A. Borodin. 2012. Elimination graphs. ACM Trans. Algor. 8, 2, 14.

Digital Library

[42]

X. Zhou, S. Gandhi, S. Suri, and H. Zheng. 2008. eBay in the sky: Strategy-proof wireless spectrum auctions. In Proceedings of the 14^th International Conference on Mobile Computing and Networking (MOBICOM'08). 2--13.

Digital Library

[43]

X. Zhou and H. Zheng. 2009. TRUST: A general framework for truthful double spectrum auctions. In Proceedings of the 28^th IEEE Conference on Computer Communications (INFOCOM'09). 999--1007.

[44]

Y. Zhu, B. Li, and Z. Li. 2012. Truthful spectrum auction design for secondary networks. In Proceedings of the 31^st IEEE Conference on Computer Communications (INFOCOM'12). 873--881.

Cited By

Wu C(2022)Enabling Innovation in Spectrum ManagementProceedings of the 6th Asia-Pacific Workshop on Networking10.1145/3542637.3542638(1-7)Online publication date: 1-Jul-2022
https://dl.acm.org/doi/10.1145/3542637.3542638
Liu XZheng WChen ZHe ZWang X(2022)Querying Maximum Quasi-independent Set by Pay-and-Recycle2022 IEEE 38th International Conference on Data Engineering (ICDE)10.1109/ICDE53745.2022.00069(859-871)Online publication date: May-2022
https://doi.org/10.1109/ICDE53745.2022.00069
Halldórsson MTonoyan T(2021)Effective Wireless Scheduling via Hypergraph SketchesSIAM Journal on Computing10.1137/19M127508550:2(718-759)Online publication date: 13-Apr-2021
https://doi.org/10.1137/19M1275085
Show More Cited By

Index Terms

Approximation Algorithms for Secondary Spectrum Auctions
1. Theory of computation
  1. Randomness, geometry and discrete structures

Recommendations

Secondary Spectrum Auctions for Symmetric and Submodular Bidders
Special Issue on EC'12, Part 2

We study truthful auctions for secondary spectrum usage in wireless networks. In this scenario, n communication requests need to be allocated to k available channels that are subject to interference and noise. We present the first truthful mechanisms ...
Approximation algorithms for secondary spectrum auctions
SPAA '11: Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures

We study combinatorial auctions for the secondary spectrum market. In this market, short-term licenses shall be given to wireless nodes for communication in their local neighborhood. In contrast to the primary market, channels can be assigned to ...
Risk aversion and loss aversion in core-selecting auctions

Core-selecting combinatorial auctions have been introduced as an alternative to the Vickrey-Clarke-Groves (VCG) mechanism because VCG can result in payments that are not in the core with respect to bids, leading to unfair payments, unacceptably low ...

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Internet Technology

ACM Transactions on Internet Technology Volume 14, Issue 2-3

Special Issue on Pricing and Incentives in Networks and Systems and Regular Papers

October 2014

287 pages

ISSN:1533-5399

EISSN:1557-6051

DOI:10.1145/2684804

Editors:
Munindar P. Singh
Department of Computer Science, North Carolina State University
,
Costas Courcoubetis
SUTD, Singapore
,
Roch Guérin
Washington University in St. Louis, USA
,
Patrick Loiseau
EURECOM, France
,
David Parkes
Harvard University, USA
,
Jean Walrand
University of California, Berkeley, USA
,
Adam Wierman
Caltech, USA

Issue’s Table of Contents

Copyright © 2014 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 28 October 2014

Accepted: 01 June 2014

Revised: 01 March 2014

Received: 01 September 2013

Published in TOIT Volume 14, Issue 2-3

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article
Research
Refereed

Funding Sources

UMIC Research Centre at RWTH Aachen University
Deutsche Forschungsgemeinschaft
Cluster of Excellence MMCI at Saarland University

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

20
Total Citations
View Citations
207
Total Downloads

Downloads (Last 12 months)9
Downloads (Last 6 weeks)2

Reflects downloads up to 21 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Wu C(2022)Enabling Innovation in Spectrum ManagementProceedings of the 6th Asia-Pacific Workshop on Networking10.1145/3542637.3542638(1-7)Online publication date: 1-Jul-2022
https://dl.acm.org/doi/10.1145/3542637.3542638
Liu XZheng WChen ZHe ZWang X(2022)Querying Maximum Quasi-independent Set by Pay-and-Recycle2022 IEEE 38th International Conference on Data Engineering (ICDE)10.1109/ICDE53745.2022.00069(859-871)Online publication date: May-2022
https://doi.org/10.1109/ICDE53745.2022.00069
Halldórsson MTonoyan T(2021)Effective Wireless Scheduling via Hypergraph SketchesSIAM Journal on Computing10.1137/19M127508550:2(718-759)Online publication date: 13-Apr-2021
https://doi.org/10.1137/19M1275085
Dong XWang LYao QWang YZhang JShen Y(2021)Towards Flexible and Truthful Incentive for Multichannel Allocation in DSAIEEE Transactions on Vehicular Technology10.1109/TVT.2021.307142470:5(4646-4656)Online publication date: May-2021
https://doi.org/10.1109/TVT.2021.3071424
Liu BXie SHong Y(2021)Efficient and Private Divisible Double Auction in Trusted Execution EnvironmentApplied Cryptography in Computer and Communications10.1007/978-3-030-80851-8_6(75-92)Online publication date: 5-Jul-2021
https://doi.org/10.1007/978-3-030-80851-8_6
Baste JJaffke LMasařík TPhilip GRote G(2019)FPT Algorithms for Diverse Collections of Hitting SetsAlgorithms10.3390/a1212025412:12(254)Online publication date: 27-Nov-2019
https://doi.org/10.3390/a12120254
Yang ZCui YXiao SWang XLi MLi CLiu Y(2019)Achieving Efficient Routing in Reconfigurable DCNsProceedings of the ACM on Measurement and Analysis of Computing Systems10.1145/33666953:3(1-30)Online publication date: 17-Dec-2019
https://dl.acm.org/doi/10.1145/3366695
Wang QHuang JChen YTian XZhang Q(2019)Privacy-Preserving and Truthful Double Auction for Heterogeneous SpectrumIEEE/ACM Transactions on Networking10.1109/TNET.2019.290387927:2(848-861)Online publication date: 1-Apr-2019
https://dl.acm.org/doi/10.1109/TNET.2019.2903879
Wang QHuang JChen YWang CXiao FLuo X(2019) $PROST$ : Privacy-Preserving and Truthful Online Double Auction for Spectrum AllocationIEEE Transactions on Information Forensics and Security10.1109/TIFS.2018.285033014:2(374-386)Online publication date: Feb-2019
https://doi.org/10.1109/TIFS.2018.2850330
Ying XBuddhikot MRoy S(2018)SAS-Assisted Coexistence-Aware Dynamic Channel Assignment in CBRS BandIEEE Transactions on Wireless Communications10.1109/TWC.2018.285826117:9(6307-6320)Online publication date: Sep-2018
https://doi.org/10.1109/TWC.2018.2858261
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Issue’s Table of Contents