{"id":"https://openalex.org/W2576770739","doi":"https://doi.org/10.1109/infcomw.2017.8116368","title":"Optimal distributed channel assignment in D2D networks using learning in noisy potential games","display_name":"Optimal distributed channel assignment in D2D networks using learning in noisy potential games","publication_year":2017,"publication_date":"2017-05-01","ids":{"openalex":"https://openalex.org/W2576770739","doi":"https://doi.org/10.1109/infcomw.2017.8116368","mag":"2576770739"},"language":"en","primary_location":{"id":"doi:10.1109/infcomw.2017.8116368","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcomw.2017.8116368","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5112343191","display_name":"Mohd. Shabbir Ali","orcid":null},"institutions":[{"id":"https://openalex.org/I12356871","display_name":"T\u00e9l\u00e9com Paris","ror":"https://ror.org/01naq7912","country_code":"FR","type":"education","lineage":["https://openalex.org/I12356871","https://openalex.org/I205703379","https://openalex.org/I4210145102"]},{"id":"https://openalex.org/I4210165912","display_name":"Laboratoire Traitement et Communication de l\u2019Information","ror":"https://ror.org/057er4c39","country_code":"FR","type":"facility","lineage":["https://openalex.org/I12356871","https://openalex.org/I205703379","https://openalex.org/I4210145102","https://openalex.org/I4210165912"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Mohd. Shabbir Ali","raw_affiliation_strings":["INFRES - D\u00e9partement Informatique et R\u00e9seaux (46, rue Barrault \r\n75013 Paris - France)","LTCI - Laboratoire Traitement et Communication de l'Information (T\u00e9l\u00e9com Paris 19 Place Marguerite Perey 91120 PALAISEAU - France)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"INFRES - D\u00e9partement Informatique et R\u00e9seaux (46, rue Barrault \r\n75013 Paris - France)","institution_ids":[]},{"raw_affiliation_string":"LTCI - Laboratoire Traitement et Communication de l'Information (T\u00e9l\u00e9com Paris 19 Place Marguerite Perey 91120 PALAISEAU - France)","institution_ids":["https://openalex.org/I12356871","https://openalex.org/I4210165912"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5034149647","display_name":"Pierre Coucheney","orcid":"https://orcid.org/0000-0001-6746-801X"},"institutions":[{"id":"https://openalex.org/I277688954","display_name":"Universit\u00e9 Paris-Saclay","ror":"https://ror.org/03xjwb503","country_code":"FR","type":"education","lineage":["https://openalex.org/I277688954"]},{"id":"https://openalex.org/I4210165912","display_name":"Laboratoire Traitement et Communication de l\u2019Information","ror":"https://ror.org/057er4c39","country_code":"FR","type":"facility","lineage":["https://openalex.org/I12356871","https://openalex.org/I205703379","https://openalex.org/I4210145102","https://openalex.org/I4210165912"]},{"id":"https://openalex.org/I4390039268","display_name":"Donn\u00e9es et algorithmes pour une ville intelligente et durable","ror":"https://ror.org/01xta2p78","country_code":"FR","type":"facility","lineage":["https://openalex.org/I195731000","https://openalex.org/I277688954","https://openalex.org/I4390039268"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Pierre Coucheney","raw_affiliation_strings":["LTCI, Universit\u00e9, Paris-Saclay","DAVID - Donn\u00e9es et algorithmes pour une ville intelligente et durable - DAVID (B\u00e2timent Descartes \u2014 Campus des Sciences\r\nUniversit\u00e9 de Versailles Saint-Quentin\r\n45 avenue des \u00c9tats-Unis\r\n78035 Versailles - France)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LTCI, Universit\u00e9, Paris-Saclay","institution_ids":["https://openalex.org/I277688954","https://openalex.org/I4210165912"]},{"raw_affiliation_string":"DAVID - Donn\u00e9es et algorithmes pour une ville intelligente et durable - DAVID (B\u00e2timent Descartes \u2014 Campus des Sciences\r\nUniversit\u00e9 de Versailles Saint-Quentin\r\n45 avenue des \u00c9tats-Unis\r\n78035 Versailles - France)","institution_ids":["https://openalex.org/I4390039268"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5046008934","display_name":"Marceau Coupechoux","orcid":"https://orcid.org/0000-0003-0744-319X"},"institutions":[{"id":"https://openalex.org/I12356871","display_name":"T\u00e9l\u00e9com Paris","ror":"https://ror.org/01naq7912","country_code":"FR","type":"education","lineage":["https://openalex.org/I12356871","https://openalex.org/I205703379","https://openalex.org/I4210145102"]},{"id":"https://openalex.org/I277688954","display_name":"Universit\u00e9 Paris-Saclay","ror":"https://ror.org/03xjwb503","country_code":"FR","type":"education","lineage":["https://openalex.org/I277688954"]},{"id":"https://openalex.org/I4210145102","display_name":"Institut Polytechnique de Paris","ror":"https://ror.org/042tfbd02","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210145102"]},{"id":"https://openalex.org/I4210165912","display_name":"Laboratoire Traitement et Communication de l\u2019Information","ror":"https://ror.org/057er4c39","country_code":"FR","type":"facility","lineage":["https://openalex.org/I12356871","https://openalex.org/I205703379","https://openalex.org/I4210145102","https://openalex.org/I4210165912"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Marceau Coupechoux","raw_affiliation_strings":["LTCI, Universit\u00e9, Paris-Saclay","INFRES - D\u00e9partement Informatique et R\u00e9seaux (46, rue Barrault \r\n75013 Paris - France)","IP Paris - Institut Polytechnique de Paris (Route de Saclay, 91120 Palaiseau Cedex, France - France)","LINCS - Laboratory of Information, Network and Communication Sciences (23 avenue d'Italie 75013 Paris - France)","RMS - R\u00e9seaux, Mobilit\u00e9 et Services (T\u00e9l\u00e9com Paris 19 Place Marguerite Perey 91120 Palaiseau - France)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LTCI, Universit\u00e9, Paris-Saclay","institution_ids":["https://openalex.org/I277688954","https://openalex.org/I4210165912"]},{"raw_affiliation_string":"INFRES - D\u00e9partement Informatique et R\u00e9seaux (46, rue Barrault \r\n75013 Paris - France)","institution_ids":[]},{"raw_affiliation_string":"IP Paris - Institut Polytechnique de Paris (Route de Saclay, 91120 Palaiseau Cedex, France - France)","institution_ids":["https://openalex.org/I4210145102"]},{"raw_affiliation_string":"LINCS - Laboratory of Information, Network and Communication Sciences (23 avenue d'Italie 75013 Paris - France)","institution_ids":[]},{"raw_affiliation_string":"RMS - R\u00e9seaux, Mobilit\u00e9 et Services (T\u00e9l\u00e9com Paris 19 Place Marguerite Perey 91120 Palaiseau - France)","institution_ids":["https://openalex.org/I12356871"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.1376,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.70493473,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"151","last_page":"156"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10148","display_name":"Advanced MIMO Systems Optimization","score":0.9997000098228455,"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"}},"topics":[{"id":"https://openalex.org/T10148","display_name":"Advanced MIMO Systems Optimization","score":0.9997000098228455,"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/T11392","display_name":"Energy Harvesting in Wireless Networks","score":0.9983999729156494,"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/T12879","display_name":"Distributed Sensor Networks and Detection Algorithms","score":0.9983000159263611,"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.6778824925422668},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.6372276544570923},{"id":"https://openalex.org/keywords/noise","display_name":"Noise (video)","score":0.6003890037536621},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.5953524112701416},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5381200313568115},{"id":"https://openalex.org/keywords/rate-of-convergence","display_name":"Rate of convergence","score":0.5092819929122925},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.48740842938423157},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4792513847351074},{"id":"https://openalex.org/keywords/noise-measurement","display_name":"Noise measurement","score":0.4754706919193268},{"id":"https://openalex.org/keywords/stochastic-approximation","display_name":"Stochastic approximation","score":0.46011027693748474},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.45251041650772095},{"id":"https://openalex.org/keywords/binary-search-algorithm","display_name":"Binary search algorithm","score":0.4298290014266968},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2179807722568512},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.14418908953666687},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.11238729953765869},{"id":"https://openalex.org/keywords/noise-reduction","display_name":"Noise reduction","score":0.10421863198280334},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.07288673520088196}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6778824925422668},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.6372276544570923},{"id":"https://openalex.org/C99498987","wikidata":"https://www.wikidata.org/wiki/Q2210247","display_name":"Noise (video)","level":3,"score":0.6003890037536621},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.5953524112701416},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5381200313568115},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.5092819929122925},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.48740842938423157},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4792513847351074},{"id":"https://openalex.org/C29265498","wikidata":"https://www.wikidata.org/wiki/Q7047719","display_name":"Noise measurement","level":3,"score":0.4754706919193268},{"id":"https://openalex.org/C55479107","wikidata":"https://www.wikidata.org/wiki/Q97663916","display_name":"Stochastic approximation","level":3,"score":0.46011027693748474},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45251041650772095},{"id":"https://openalex.org/C121610932","wikidata":"https://www.wikidata.org/wiki/Q243754","display_name":"Binary search algorithm","level":3,"score":0.4298290014266968},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2179807722568512},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.14418908953666687},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.11238729953765869},{"id":"https://openalex.org/C163294075","wikidata":"https://www.wikidata.org/wiki/Q581861","display_name":"Noise reduction","level":2,"score":0.10421863198280334},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.07288673520088196},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.0},{"id":"https://openalex.org/C115961682","wikidata":"https://www.wikidata.org/wiki/Q860623","display_name":"Image (mathematics)","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/infcomw.2017.8116368","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcomw.2017.8116368","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-03143499v1","is_oa":false,"landing_page_url":"https://telecom-paris.hal.science/hal-03143499","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"2017 IEEE Conference on Computer Communications: Workshops (INFOCOM WKSHPS), May 2017, Atlanta, United States. pp.151-156, ⟨10.1109/INFCOMW.2017.8116368⟩","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W595252221","https://openalex.org/W1596687746","https://openalex.org/W1969281101","https://openalex.org/W1992942660","https://openalex.org/W1994616650","https://openalex.org/W1996387524","https://openalex.org/W2005228957","https://openalex.org/W2009797711","https://openalex.org/W2013923357","https://openalex.org/W2019633955","https://openalex.org/W2022317317","https://openalex.org/W2024612830","https://openalex.org/W2024934110","https://openalex.org/W2040123988","https://openalex.org/W2040423954","https://openalex.org/W2061968742","https://openalex.org/W2064076655","https://openalex.org/W2073939733","https://openalex.org/W2081879752","https://openalex.org/W2091638851","https://openalex.org/W2124289529","https://openalex.org/W2135540075","https://openalex.org/W2141314343","https://openalex.org/W2142906016","https://openalex.org/W2149016651","https://openalex.org/W2166874862","https://openalex.org/W2170166244","https://openalex.org/W2316126926","https://openalex.org/W2576770739","https://openalex.org/W2963387149","https://openalex.org/W3022321359","https://openalex.org/W3098552807","https://openalex.org/W3098915991","https://openalex.org/W6635735902","https://openalex.org/W6660529734"],"related_works":["https://openalex.org/W2382626982","https://openalex.org/W2376716665","https://openalex.org/W1495725930","https://openalex.org/W1907128005","https://openalex.org/W1525838894","https://openalex.org/W2110562615","https://openalex.org/W4295363057","https://openalex.org/W1988575180","https://openalex.org/W2352621013","https://openalex.org/W1522863580"],"abstract_inverted_index":{"We":[0,143],"present":[1],"a":[2,56,77,81,92],"novel":[3,82],"solution":[4],"for":[5,111,117],"Channel":[6],"Assignment":[7],"Problem":[8,59],"(CAP)":[9],"in":[10,29,86,183],"Device-to-Device":[11],"(D2D)":[12],"wireless":[13],"networks":[14],"that":[15,40,99,135,154],"takes":[16,41],"into":[17,42],"account":[18,43],"the":[19,30,44,53,63,70,102,137,140,145,155,161,169,173,177],"throughput":[20],"estimation":[21,45,71,131,186],"noise.":[22,46,115,187],"CAP":[23,54,73],"is":[24,34,74,109,133],"known":[25],"to":[26,61,101,139,168],"be":[27],"NP-hard":[28],"literature":[31],"and":[32,113,119,165],"there":[33],"no":[35],"practical":[36],"optimal":[37,103,141,178],"learning":[38],"algorithm":[39,175],"In":[47],"this":[48,87],"paper,":[49],"we":[50,84,90],"first":[51],"formulate":[52],"as":[55,76],"Stochastic":[57],"Optimization":[58],"(SOP)":[60],"maximize":[62],"expected":[64],"sum":[65,156],"data":[66,157],"rate.":[67],"To":[68],"capture":[69],"noise,":[72],"modeled":[75],"noisy":[78],"potential":[79],"game,":[80],"notion":[83],"introduce":[85],"paper.":[88],"Then,":[89],"propose":[91],"distributed":[93],"Binary":[94],"Log-linear":[95],"Learning":[96],"Algorithm":[97],"(BLLA)":[98],"converges":[100],"channel":[104,179],"assignments.":[105],"Convergence":[106],"of":[107,123,130,147,163,185],"BLLA":[108,124,148],"proved":[110],"bounded":[112],"unbounded":[114],"Proofs":[116],"fixed":[118],"decreasing":[120],"temperature":[121],"parameter":[122],"are":[125],"provided.":[126],"A":[127],"sufficient":[128],"number":[129,162],"samples":[132],"given":[134],"guarantees":[136],"convergence":[138],"state.":[142],"assess":[144],"performance":[146],"by":[149],"extensive":[150],"simulations,":[151],"which":[152],"show":[153],"rate":[158],"increases":[159],"with":[160],"channels":[164],"users.":[166],"Contrary":[167],"better":[170],"response":[171],"algorithm,":[172],"proposed":[174],"achieves":[176],"assignments":[180],"distributively":[181],"even":[182],"presence":[184]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}