{"id":"https://openalex.org/W2148782196","doi":"https://doi.org/10.1109/glocom.2013.6831243","title":"Carrier aggregation as a repeated game: Learning algorithms for efficient convergence to a Nash equilibrium","display_name":"Carrier aggregation as a repeated game: Learning algorithms for efficient convergence to a Nash equilibrium","publication_year":2013,"publication_date":"2013-12-01","ids":{"openalex":"https://openalex.org/W2148782196","doi":"https://doi.org/10.1109/glocom.2013.6831243","mag":"2148782196"},"language":"en","primary_location":{"id":"doi:10.1109/glocom.2013.6831243","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocom.2013.6831243","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE Global Communications Conference (GLOBECOM)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/2262/72156","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5089768882","display_name":"Hamed Ahmadi","orcid":"https://orcid.org/0000-0001-5508-8757"},"institutions":[{"id":"https://openalex.org/I205274468","display_name":"Trinity College Dublin","ror":"https://ror.org/02tyrky19","country_code":"IE","type":"education","lineage":["https://openalex.org/I205274468"]}],"countries":["IE"],"is_corresponding":false,"raw_author_name":"Hamed Ahmadi","raw_affiliation_strings":["CTVR Telecommunications Research Center, Trinity College, Dublin, Ireland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CTVR Telecommunications Research Center, Trinity College, Dublin, Ireland","institution_ids":["https://openalex.org/I205274468"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5050129536","display_name":"Irene Macaluso","orcid":"https://orcid.org/0000-0002-7728-2232"},"institutions":[{"id":"https://openalex.org/I205274468","display_name":"Trinity College Dublin","ror":"https://ror.org/02tyrky19","country_code":"IE","type":"education","lineage":["https://openalex.org/I205274468"]}],"countries":["IE"],"is_corresponding":false,"raw_author_name":"Irene Macaluso","raw_affiliation_strings":["CTVR Telecommunications Research Center, Trinity College, Dublin, Ireland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CTVR Telecommunications Research Center, Trinity College, Dublin, Ireland","institution_ids":["https://openalex.org/I205274468"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5041092244","display_name":"Luiz A. DaSilva","orcid":"https://orcid.org/0000-0001-6310-6150"},"institutions":[{"id":"https://openalex.org/I205274468","display_name":"Trinity College Dublin","ror":"https://ror.org/02tyrky19","country_code":"IE","type":"education","lineage":["https://openalex.org/I205274468"]}],"countries":["IE"],"is_corresponding":false,"raw_author_name":"Luiz A. DaSilva","raw_affiliation_strings":["CTVR Telecommunications Research Center, Trinity College, Dublin, Ireland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CTVR Telecommunications Research Center, Trinity College, Dublin, Ireland","institution_ids":["https://openalex.org/I205274468"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I205274468"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1233","last_page":"1239"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9980999827384949,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9980999827384949,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11409","display_name":"Advanced Wireless Network Optimization","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10579","display_name":"Cognitive Radio Networks and Spectrum Sensing","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7883100509643555},{"id":"https://openalex.org/keywords/nash-equilibrium","display_name":"Nash equilibrium","score":0.7790417671203613},{"id":"https://openalex.org/keywords/potential-game","display_name":"Potential game","score":0.6431966423988342},{"id":"https://openalex.org/keywords/bandwidth","display_name":"Bandwidth (computing)","score":0.6166396141052246},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.5340370535850525},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.533768892288208},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.4988844394683838},{"id":"https://openalex.org/keywords/aggregate","display_name":"Aggregate (composite)","score":0.4747217893600464},{"id":"https://openalex.org/keywords/channel-allocation-schemes","display_name":"Channel allocation schemes","score":0.46783462166786194},{"id":"https://openalex.org/keywords/bandwidth-allocation","display_name":"Bandwidth allocation","score":0.45194509625434875},{"id":"https://openalex.org/keywords/game-theory","display_name":"Game theory","score":0.4303600788116455},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.4200235605239868},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.41395390033721924},{"id":"https://openalex.org/keywords/wireless","display_name":"Wireless","score":0.39446404576301575},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.37032368779182434},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36226344108581543},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3131083548069},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.2230139672756195},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.10794806480407715}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7883100509643555},{"id":"https://openalex.org/C46814582","wikidata":"https://www.wikidata.org/wiki/Q23389","display_name":"Nash equilibrium","level":2,"score":0.7790417671203613},{"id":"https://openalex.org/C2778079155","wikidata":"https://www.wikidata.org/wiki/Q288500","display_name":"Potential game","level":3,"score":0.6431966423988342},{"id":"https://openalex.org/C2776257435","wikidata":"https://www.wikidata.org/wiki/Q1576430","display_name":"Bandwidth (computing)","level":2,"score":0.6166396141052246},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.5340370535850525},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.533768892288208},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.4988844394683838},{"id":"https://openalex.org/C4679612","wikidata":"https://www.wikidata.org/wiki/Q866298","display_name":"Aggregate (composite)","level":2,"score":0.4747217893600464},{"id":"https://openalex.org/C114237682","wikidata":"https://www.wikidata.org/wiki/Q5072483","display_name":"Channel allocation schemes","level":3,"score":0.46783462166786194},{"id":"https://openalex.org/C200157131","wikidata":"https://www.wikidata.org/wiki/Q4854763","display_name":"Bandwidth allocation","level":3,"score":0.45194509625434875},{"id":"https://openalex.org/C177142836","wikidata":"https://www.wikidata.org/wiki/Q44455","display_name":"Game theory","level":2,"score":0.4303600788116455},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.4200235605239868},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.41395390033721924},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.39446404576301575},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.37032368779182434},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36226344108581543},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3131083548069},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.2230139672756195},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.10794806480407715},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/glocom.2013.6831243","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocom.2013.6831243","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE Global Communications Conference (GLOBECOM)","raw_type":"proceedings-article"},{"id":"pmh:http://www.rian.ie/104636/","is_oa":true,"landing_page_url":"http://hdl.handle.net/2262/72156","pdf_url":null,"source":{"id":"https://openalex.org/S4306400033","display_name":"Arrow@dit (Dublin Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I115570527","host_organization_name":"Dublin Institute of Technology","host_organization_lineage":["https://openalex.org/I115570527"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-sa","license_id":"https://openalex.org/licenses/cc-by-nc-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"H. Ahmadi, I. Macaluso, and L. A. DaSilva, Carrier Aggregation as a Repeated Game: Learning Algorithms for Efficient Convergence to a Nash Equilibrium, IEEE Global Communications Conference (Globecom), Atlanta, GA, USA, 9-13 December, 2013, 2013","raw_type":"Conference item"}],"best_oa_location":{"id":"pmh:http://www.rian.ie/104636/","is_oa":true,"landing_page_url":"http://hdl.handle.net/2262/72156","pdf_url":null,"source":{"id":"https://openalex.org/S4306400033","display_name":"Arrow@dit (Dublin Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I115570527","host_organization_name":"Dublin Institute of Technology","host_organization_lineage":["https://openalex.org/I115570527"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-sa","license_id":"https://openalex.org/licenses/cc-by-nc-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"H. Ahmadi, I. Macaluso, and L. A. DaSilva, Carrier Aggregation as a Repeated Game: Learning Algorithms for Efficient Convergence to a Nash Equilibrium, IEEE Global Communications Conference (Globecom), Atlanta, GA, USA, 9-13 December, 2013, 2013","raw_type":"Conference item"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W604710130","https://openalex.org/W2046445506","https://openalex.org/W2060313396","https://openalex.org/W2074215173","https://openalex.org/W2108068819","https://openalex.org/W2142152348","https://openalex.org/W2152332139","https://openalex.org/W2163505601","https://openalex.org/W2163905491","https://openalex.org/W2170161043","https://openalex.org/W2216312297","https://openalex.org/W6683851007"],"related_works":["https://openalex.org/W2528338391","https://openalex.org/W2126431628","https://openalex.org/W2787778301","https://openalex.org/W2567986414","https://openalex.org/W2914286174","https://openalex.org/W3119014777","https://openalex.org/W2953849958","https://openalex.org/W2185830305","https://openalex.org/W2150463679","https://openalex.org/W2316903755"],"abstract_inverted_index":{"Carrier":[0],"aggregation":[1,19],"is":[2],"a":[3,87],"key":[4],"feature":[5],"of":[6,90,95],"next":[7],"generation":[8],"wireless":[9],"networks":[10,22,30],"to":[11,37,83],"deliver":[12],"high-bandwidth":[13],"links.":[14],"This":[15],"paper":[16],"studies":[17],"carrier":[18,75],"for":[20],"autonomous":[21],"operating":[23],"in":[24,39,65,86],"shared":[25],"spectrum.":[26],"In":[27],"our":[28,51],"model,":[29],"decide":[31],"how":[32],"many":[33],"and":[34,69,97],"which":[35],"channels":[36,68],"aggregate":[38],"multiple":[40],"frequency":[41,67],"bands,":[42],"hence":[43],"extending":[44],"the":[45,55,62,70,93],"distributed":[46],"channel":[47],"allocation":[48],"framework.":[49],"Moreover,":[50],"model":[52],"takes":[53],"into":[54],"account":[56],"physical":[57],"layer":[58],"issues,":[59],"such":[60],"as":[61],"out-of-channel":[63],"interference":[64],"adjacent":[66],"cost":[71],"associated":[72],"with":[73],"inter-band":[74],"aggregation.":[76],"We":[77],"propose":[78],"learning":[79],"algorithms":[80],"that":[81],"converge":[82],"Nash":[84],"equilibria":[85],"reasonable":[88],"number":[89],"iterations":[91],"under":[92],"assumption":[94],"incomplete":[96],"imperfect":[98],"information.":[99]},"counts_by_year":[{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}