BLMA: A Blind Matching Algorithm with Application to Cognitive Radio Networks

Handle URI:
http://hdl.handle.net/10754/622828
Title:
BLMA: A Blind Matching Algorithm with Application to Cognitive Radio Networks
Authors:
Hamza, Doha R.; Shamma, Jeff S. ( 0000-0001-5638-9551 )
Abstract:
We consider a two-sided one-to-one abstract matching problem with a defined notion of pairwise stability. The formulated problem is shown to encompass the ordinal and cardinal utility markets. We propose a distributed blind matching algorithm (BLMA) to solve the problem. BLMA is characterized by random activations of agents, and by generic negotiation and aspiration (utility) update processes. We prove the solution produced by BLMA will converge to an <formula> <img src=
KAUST Department:
Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
Citation:
Hamza D, Shamma JS (2017) BLMA: A Blind Matching Algorithm with Application to Cognitive Radio Networks. IEEE Journal on Selected Areas in Communications: 1–1. Available: http://dx.doi.org/10.1109/JSAC.2017.2659098.
Publisher:
Institute of Electrical and Electronics Engineers (IEEE)
Journal:
IEEE Journal on Selected Areas in Communications
Issue Date:
26-Jan-2017
DOI:
10.1109/JSAC.2017.2659098
Type:
Article
ISSN:
0733-8716
Sponsors:
The research reported in this publication was supported by funding from King Abdullah University of Science and Technology (KAUST).
Additional Links:
http://ieeexplore.ieee.org/document/7835147/
Appears in Collections:
Articles; Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division

Full metadata record

DC FieldValue Language
dc.contributor.authorHamza, Doha R.en
dc.contributor.authorShamma, Jeff S.en
dc.date.accessioned2017-02-05T13:53:44Z-
dc.date.available2017-02-05T13:53:44Z-
dc.date.issued2017-01-26en
dc.identifier.citationHamza D, Shamma JS (2017) BLMA: A Blind Matching Algorithm with Application to Cognitive Radio Networks. IEEE Journal on Selected Areas in Communications: 1–1. Available: http://dx.doi.org/10.1109/JSAC.2017.2659098.en
dc.identifier.issn0733-8716en
dc.identifier.doi10.1109/JSAC.2017.2659098en
dc.identifier.urihttp://hdl.handle.net/10754/622828-
dc.description.abstractWe consider a two-sided one-to-one abstract matching problem with a defined notion of pairwise stability. The formulated problem is shown to encompass the ordinal and cardinal utility markets. We propose a distributed blind matching algorithm (BLMA) to solve the problem. BLMA is characterized by random activations of agents, and by generic negotiation and aspiration (utility) update processes. We prove the solution produced by BLMA will converge to an <formula> <img src=en
dc.description.sponsorshipThe research reported in this publication was supported by funding from King Abdullah University of Science and Technology (KAUST).en
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)en
dc.relation.urlhttp://ieeexplore.ieee.org/document/7835147/en
dc.rights(c) 2016 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works.en
dc.subjectcognitive radioen
dc.subjectDecentralized matchingen
dc.subjectgeneralized assignment gamesen
dc.subjectone-to-one matchingen
dc.subjectepsilon-pairwise stabilityen
dc.subjectepsilon-coreen
dc.titleBLMA: A Blind Matching Algorithm with Application to Cognitive Radio Networksen
dc.typeArticleen
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Divisionen
dc.identifier.journalIEEE Journal on Selected Areas in Communicationsen
dc.eprint.versionPost-printen
kaust.authorHamza, Doha R.en
kaust.authorShamma, Jeff S.en
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.