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

Doha R. Hamza; Jeff S. Shamma

doi:10.1109/JSAC.2017.2659098

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

Doha R. Hamza, Jeff S. Shamma

Research output: Contribution to journal › Article › peer-review

16 Scopus citations

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

Original language	English (US)
Pages (from-to)	302-316
Number of pages	15
Journal	IEEE Journal on Selected Areas in Communications
Volume	35
Issue number	2
DOIs	https://doi.org/10.1109/JSAC.2017.2659098
State	Published - Jan 26 2017

Access to Document

10.1109/JSAC.2017.2659098

https://repository.kaust.edu.sa/bitstream/10754/622828/1/07835147.pdf

Cite this

@article{7123056eab15465a86d0e8389c35ddde,

title = "BLMA: A Blind Matching Algorithm with Application to Cognitive Radio Networks",

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",

author = "Hamza, {Doha R.} and Shamma, {Jeff S.}",

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).",

year = "2017",

month = jan,

day = "26",

doi = "10.1109/JSAC.2017.2659098",

language = "English (US)",

volume = "35",

pages = "302--316",

journal = "IEEE Journal on Selected Areas in Communications",

issn = "0733-8716",

publisher = "Institute of Electrical and Electronics Engineers",

number = "2",

}

TY - JOUR

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

AU - Hamza, Doha R.

AU - Shamma, Jeff S.

N1 - 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).

PY - 2017/1/26

Y1 - 2017/1/26

N2 - 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

AB - 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

UR - http://hdl.handle.net/10754/622828

UR - http://ieeexplore.ieee.org/document/7835147/

UR - http://www.scopus.com/inward/record.url?scp=85017298984&partnerID=8YFLogxK

U2 - 10.1109/JSAC.2017.2659098

DO - 10.1109/JSAC.2017.2659098

M3 - Article

SN - 0733-8716

VL - 35

SP - 302

EP - 316

JO - IEEE Journal on Selected Areas in Communications

JF - IEEE Journal on Selected Areas in Communications

IS - 2

ER -

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

Abstract

Access to Document

Other files and links

Fingerprint

Cite this