{"id":"https://openalex.org/W4253718549","doi":"https://doi.org/10.1109/twc.2021.3094556","title":"Completely Uncoupled Utility Maximization Algorithms for State Dependent Networks","display_name":"Completely Uncoupled Utility Maximization Algorithms for State Dependent Networks","publication_year":2021,"publication_date":"2021-07-13","ids":{"openalex":"https://openalex.org/W4253718549","doi":"https://doi.org/10.1109/twc.2021.3094556"},"language":"en","primary_location":{"id":"doi:10.1109/twc.2021.3094556","is_oa":false,"landing_page_url":"https://doi.org/10.1109/twc.2021.3094556","pdf_url":null,"source":{"id":"https://openalex.org/S63459445","display_name":"IEEE Transactions on Wireless Communications","issn_l":"1536-1276","issn":["1536-1276","1558-2248"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Wireless Communications","raw_type":"journal-article"},"type":"article","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/A5100649489","display_name":"S. Ramakrishnan","orcid":null},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en informatique et en automatique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1326498283"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"S. Ramakrishnan","raw_affiliation_strings":["Inria Sophia Antipolis, Biot, France","NEO - Network Engineering and Operations (2004 route des Lucioles BP 93 06902 Sophia Antipolis - France)"],"affiliations":[{"raw_affiliation_string":"Inria Sophia Antipolis, Biot, France","institution_ids":["https://openalex.org/I1326498283"]},{"raw_affiliation_string":"NEO - Network Engineering and Operations (2004 route des Lucioles BP 93 06902 Sophia Antipolis - France)","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5038728729","display_name":"Venkatesh Ramaiyan","orcid":null},"institutions":[{"id":"https://openalex.org/I24676775","display_name":"Indian Institute of Technology Madras","ror":"https://ror.org/03v0r5n49","country_code":"IN","type":"facility","lineage":["https://openalex.org/I24676775"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Venkatesh Ramaiyan","raw_affiliation_strings":["Indian Institute of Technology (IIT) Madras, Chennai, India","IIT Madras - Indian Institute of Technology Madras (Chennai 600036 - India)"],"affiliations":[{"raw_affiliation_string":"Indian Institute of Technology (IIT) Madras, Chennai, India","institution_ids":["https://openalex.org/I24676775"]},{"raw_affiliation_string":"IIT Madras - Indian Institute of Technology Madras (Chennai 600036 - India)","institution_ids":["https://openalex.org/I24676775"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5112611258","display_name":"K. P. Naveen","orcid":null},"institutions":[{"id":"https://openalex.org/I4210109292","display_name":"Indian Institute of Technology Tirupati","ror":"https://ror.org/01xtkxh20","country_code":"IN","type":"education","lineage":["https://openalex.org/I4210109292"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"K. P. Naveen","raw_affiliation_strings":["Indian Institute of Technology (IIT) at Tirupati, Tirupati, India","IIT Tirupati - Indian Institute of Technology [Tirupati] (India)"],"affiliations":[{"raw_affiliation_string":"Indian Institute of Technology (IIT) at Tirupati, Tirupati, India","institution_ids":["https://openalex.org/I4210109292"]},{"raw_affiliation_string":"IIT Tirupati - Indian Institute of Technology [Tirupati] (India)","institution_ids":["https://openalex.org/I4210109292"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5100649489"],"corresponding_institution_ids":["https://openalex.org/I1326498283"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.34189413,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"21","issue":"1","first_page":"191","last_page":"202"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10974","display_name":"Advanced Queuing Theory Analysis","score":0.9962999820709229,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10974","display_name":"Advanced Queuing Theory Analysis","score":0.9962999820709229,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11409","display_name":"Advanced Wireless Network Optimization","score":0.9927999973297119,"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/T11031","display_name":"Game Theory and Applications","score":0.9891999959945679,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7849443554878235},{"id":"https://openalex.org/keywords/utility-maximization","display_name":"Utility maximization","score":0.618226170539856},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.6091809272766113},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.6082955002784729},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.5679513216018677},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.556308925151825},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5070977210998535},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4936617314815521},{"id":"https://openalex.org/keywords/state-dependent","display_name":"State dependent","score":0.43284308910369873},{"id":"https://openalex.org/keywords/resource-allocation","display_name":"Resource allocation","score":0.43159353733062744},{"id":"https://openalex.org/keywords/markov-decision-process","display_name":"Markov decision process","score":0.43027475476264954},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4254581332206726},{"id":"https://openalex.org/keywords/utility-maximization-problem","display_name":"Utility maximization problem","score":0.41224589943885803},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.4101620614528656},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.16636687517166138},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.13724061846733093},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.1168745756149292},{"id":"https://openalex.org/keywords/mathematical-economics","display_name":"Mathematical economics","score":0.09212708473205566}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7849443554878235},{"id":"https://openalex.org/C2985793214","wikidata":"https://www.wikidata.org/wiki/Q3274096","display_name":"Utility maximization","level":2,"score":0.618226170539856},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.6091809272766113},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.6082955002784729},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.5679513216018677},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.556308925151825},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5070977210998535},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4936617314815521},{"id":"https://openalex.org/C2984679396","wikidata":"https://www.wikidata.org/wiki/Q7602986","display_name":"State dependent","level":2,"score":0.43284308910369873},{"id":"https://openalex.org/C29202148","wikidata":"https://www.wikidata.org/wiki/Q287260","display_name":"Resource allocation","level":2,"score":0.43159353733062744},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.43027475476264954},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4254581332206726},{"id":"https://openalex.org/C2779044140","wikidata":"https://www.wikidata.org/wiki/Q3274096","display_name":"Utility maximization problem","level":3,"score":0.41224589943885803},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.4101620614528656},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16636687517166138},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.13724061846733093},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.1168745756149292},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.09212708473205566},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/twc.2021.3094556","is_oa":false,"landing_page_url":"https://doi.org/10.1109/twc.2021.3094556","pdf_url":null,"source":{"id":"https://openalex.org/S63459445","display_name":"IEEE Transactions on Wireless Communications","issn_l":"1536-1276","issn":["1536-1276","1558-2248"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Wireless Communications","raw_type":"journal-article"},{"id":"pmh:oai:HAL:hal-04818356v1","is_oa":false,"landing_page_url":"https://inria.hal.science/hal-04818356","pdf_url":null,"source":{"id":"https://openalex.org/S4406922466","display_name":"SPIRE - Sciences Po Institutional REpository","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE Transactions on Wireless Communications, 2022, 21 (1), pp.191-202. &#x27E8;10.1109/TWC.2021.3094556&#x27E9;","raw_type":"Journal articles"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W1532995108","https://openalex.org/W1990237136","https://openalex.org/W1996013982","https://openalex.org/W2032200533","https://openalex.org/W2097058227","https://openalex.org/W2118994458","https://openalex.org/W2121877077","https://openalex.org/W2122011919","https://openalex.org/W2133492106","https://openalex.org/W2141539428","https://openalex.org/W2143253081","https://openalex.org/W2143690081","https://openalex.org/W2169077434","https://openalex.org/W2171081201","https://openalex.org/W2555234985","https://openalex.org/W2613411633","https://openalex.org/W2791232707","https://openalex.org/W2801154251","https://openalex.org/W2890196942","https://openalex.org/W2891292132","https://openalex.org/W4240896209","https://openalex.org/W4252999360","https://openalex.org/W4253990512","https://openalex.org/W6681189144","https://openalex.org/W6748239211","https://openalex.org/W6754503832"],"related_works":["https://openalex.org/W2951390543","https://openalex.org/W3121912968","https://openalex.org/W2949260239","https://openalex.org/W2949594337","https://openalex.org/W3123067344","https://openalex.org/W4299412355","https://openalex.org/W2953072363","https://openalex.org/W3125423763","https://openalex.org/W2267645079","https://openalex.org/W3121521771"],"abstract_inverted_index":{"We":[0,28,54],"study":[1],"a":[2,9,30,41,89],"completely":[3,77],"uncoupled":[4,78],"resource":[5],"allocation":[6],"algorithm":[7],"for":[8,80],"heterogeneous":[10],"network":[11],"with":[12],"the":[13,17,20,23,34,38,49,52,61,65,69,84,101,106,109,113,116,124],"objective":[14],"of":[15,19,26,43,51,68,91,108,118,126],"maximizing":[16],"sum":[18],"utilities":[21],"(on":[22],"average":[24],"pay-off)":[25],"users.":[27],"consider":[29,55],"state-dependent":[31],"network,":[32],"where":[33,83],"pay-off":[35],"achieved":[36],"by":[37],"users":[39,111],"are":[40],"function":[42,90],"their":[44],"actions":[45,94,107],"as":[46,48],"well":[47],"state":[50,62],"system.":[53],"four":[56],"different":[57],"scenarios":[58],"depending":[59],"on":[60],"evolution":[63],"and":[64,95],"users\u2019":[66,85],"knowledge":[67],"system":[70],"state.":[71],"In":[72,99],"this":[73],"context,":[74],"we":[75,122],"present":[76],"algorithms":[79,128],"utility":[81],"maximization,":[82],"action":[86],"is":[87,103],"entirely":[88],"its":[92,96],"past":[93],"received":[97],"pay-off.":[98],"particular,":[100],"user":[102],"oblivious":[104],"to":[105],"other":[110],"in":[112],"network.":[114],"Using":[115],"theory":[117],"perturbed":[119],"Markov":[120],"chains,":[121],"show":[123],"optimality":[125],"our":[127],"under":[129],"appropriate":[130],"scenarios.":[131]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
