Many-to-Many Matching for Distributed Spectrum Trading

[1]  Robert W. Irving,et al.  The Stable marriage problem - structure and algorithms , 1989, Foundations of computing series.

[2]  Jin Zhang,et al.  Database-assisted multi-AP network on TV white spaces: Architecture, spectrum allocation and AP discovery , 2011, 2011 IEEE International Symposium on Dynamic Spectrum Access Networks (DySPAN).

[3]  L. Shapley,et al.  College Admissions and the Stability of Marriage , 1962 .

[4]  Xu Chen,et al.  Database-Assisted Distributed Spectrum Sharing , 2013, IEEE Journal on Selected Areas in Communications.

[5]  Zhu Han,et al.  Distributed stable matching algorithm for physical layer security with multiple source-destination pairs and jammer nodes , 2012, 2012 IEEE Wireless Communications and Networking Conference (WCNC).

[6]  Noam Nisan,et al.  An efficient approximate allocation algorithm for combinatorial auctions , 2001, EC '01.

[7]  Zhu Han,et al.  Physical-Layer Security in Distributed Wireless Networks Using Matching Theory , 2013, IEEE Transactions on Information Forensics and Security.

[8]  Noam Nisan,et al.  Truthful approximation mechanisms for restricted combinatorial auctions , 2008, Games Econ. Behav..

[9]  Baochun Li,et al.  Anchor: A Versatile and Efficient Framework for Resource Management in the Cloud , 2013, IEEE Transactions on Parallel and Distributed Systems.

[10]  Miao Pan,et al.  Cheating in matching of device to device pairs in cellular networks , 2014, 2014 IEEE Global Communications Conference.

[11]  Branka Vucetic,et al.  Cognitive Radio Relay Networks with Multiple Primary and Secondary Users: Distributed Stable Matching Algorithms for Spectrum Access , 2011, 2011 IEEE International Conference on Communications (ICC).

[12]  Xinbing Wang,et al.  MAP: Multiauctioneer Progressive Auction for Dynamic Spectrum Access , 2011, IEEE Transactions on Mobile Computing.

[13]  Koichi Yamazaki,et al.  A note on greedy algorithms for the maximum weighted independent set problem , 2003, Discret. Appl. Math..

[14]  Guihai Chen,et al.  A Strategy-Proof Combinatorial Heterogeneous Channel Auction Framework in Noncooperative Wireless Networks , 2015, IEEE Transactions on Mobile Computing.

[15]  V. Crawford,et al.  Job Matching, Coalition Formation, and Gross Substitutes , 1982 .

[16]  Yanjiao Chen,et al.  TAMES: A Truthful Double Auction for Multi-Demand Heterogeneous Spectrums , 2014, IEEE Transactions on Parallel and Distributed Systems.

[17]  Yanjiao Chen,et al.  LOTUS: Location-aware online truthful double auction for dynamic spectrum access , 2014, 2014 IEEE International Symposium on Dynamic Spectrum Access Networks (DYSPAN).

[18]  Baochun Li,et al.  District: Embracing local markets in truthful spectrum double auctions , 2011, 2011 8th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks.

[19]  Xia Zhou,et al.  TRUST: A General Framework for Truthful Double Spectrum Auctions , 2009, IEEE INFOCOM 2009.

[20]  XiaoHua Xu,et al.  TODA: Truthful Online Double Auction for Spectrum Allocation in Wireless Networks , 2010, 2010 IEEE Symposium on New Frontiers in Dynamic Spectrum (DySPAN).

[21]  F. Echenique,et al.  A Theory of Stability in Many-to-Many Matching Markets , 2004 .

[22]  Bo Li,et al.  TAHES: A Truthful Double Auction Mechanism for Heterogeneous Spectrums , 2012, IEEE Transactions on Wireless Communications.

[23]  Jun Cai,et al.  Two-Stage Spectrum Sharing With Combinatorial Auction and Stackelberg Game in Recall-Based Cognitive Radio Networks , 2014, IEEE Transactions on Communications.

[24]  Berthold Vöcking,et al.  A universally-truthful approximation scheme for multi-unit auctions , 2012, SODA.

[25]  Walid Saad,et al.  A college admissions game for uplink user association in wireless small cell networks , 2014, IEEE INFOCOM 2014 - IEEE Conference on Computer Communications.

[26]  Adam Wierman,et al.  Peer Effects and Stability in Matching Markets , 2011, SAGT.