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

Doha R. Hamza, Jeff S. Shamma

Research output: Contribution to journalArticlepeer-review

13 Scopus citations


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
Original languageEnglish (US)
Pages (from-to)302-316
Number of pages15
JournalIEEE Journal on Selected Areas in Communications
Issue number2
StatePublished - Jan 26 2017

Bibliographical note

KAUST Repository Item: Exported on 2020-10-01
Acknowledgements: The research reported in this publication was supported by funding from King Abdullah University of Science and Technology (KAUST).


Dive into the research topics of 'BLMA: A Blind Matching Algorithm with Application to Cognitive Radio Networks'. Together they form a unique fingerprint.

Cite this