{"id":"https://openalex.org/W2555054312","doi":"https://doi.org/10.1109/allerton.2010.5706991","title":"Optimal transmission policies for two-user multiple access broadcast using dynamic team theory","display_name":"Optimal transmission policies for two-user multiple access broadcast using dynamic team theory","publication_year":2010,"publication_date":"2010-09-01","ids":{"openalex":"https://openalex.org/W2555054312","doi":"https://doi.org/10.1109/allerton.2010.5706991","mag":"2555054312"},"language":"en","primary_location":{"id":"doi:10.1109/allerton.2010.5706991","is_oa":false,"landing_page_url":"https://doi.org/10.1109/allerton.2010.5706991","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","raw_type":"proceedings-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/A5005770424","display_name":"Aditya Mahajan","orcid":"https://orcid.org/0000-0001-8125-1191"},"institutions":[{"id":"https://openalex.org/I5023651","display_name":"McGill University","ror":"https://ror.org/01pxwe438","country_code":"CA","type":"education","lineage":["https://openalex.org/I5023651"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Aditya Mahajan","raw_affiliation_strings":["Department of Electrical and Computer Engineering, McGill University, Montreal, QUE, Canada"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, McGill University, Montreal, QUE, Canada","institution_ids":["https://openalex.org/I5023651"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5005770424"],"corresponding_institution_ids":["https://openalex.org/I5023651"],"apc_list":null,"apc_paid":null,"fwci":0.391,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.72995065,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"ac 23","issue":null,"first_page":"806","last_page":"813"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11031","display_name":"Game Theory and Applications","score":0.9991999864578247,"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"}},"topics":[{"id":"https://openalex.org/T11031","display_name":"Game Theory and Applications","score":0.9991999864578247,"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"}},{"id":"https://openalex.org/T11182","display_name":"Auction Theory and Applications","score":0.9972000122070312,"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"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9891999959945679,"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.7461234331130981},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.678161084651947},{"id":"https://openalex.org/keywords/countable-set","display_name":"Countable set","score":0.5824863910675049},{"id":"https://openalex.org/keywords/state-space","display_name":"State space","score":0.567253828048706},{"id":"https://openalex.org/keywords/transmission","display_name":"Transmission (telecommunications)","score":0.5203242301940918},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4831473231315613},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.4529813230037689},{"id":"https://openalex.org/keywords/asynchronous-communication","display_name":"Asynchronous communication","score":0.4523013234138489},{"id":"https://openalex.org/keywords/action","display_name":"Action (physics)","score":0.4440630078315735},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.4428287446498871},{"id":"https://openalex.org/keywords/markov-decision-process","display_name":"Markov decision process","score":0.4355430006980896},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3657800853252411},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.33302199840545654},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.290467232465744},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.21580037474632263},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19679725170135498},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.11736994981765747},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.1018751859664917}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7461234331130981},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.678161084651947},{"id":"https://openalex.org/C110729354","wikidata":"https://www.wikidata.org/wiki/Q185478","display_name":"Countable set","level":2,"score":0.5824863910675049},{"id":"https://openalex.org/C72434380","wikidata":"https://www.wikidata.org/wiki/Q230930","display_name":"State space","level":2,"score":0.567253828048706},{"id":"https://openalex.org/C761482","wikidata":"https://www.wikidata.org/wiki/Q118093","display_name":"Transmission (telecommunications)","level":2,"score":0.5203242301940918},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4831473231315613},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.4529813230037689},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.4523013234138489},{"id":"https://openalex.org/C2780791683","wikidata":"https://www.wikidata.org/wiki/Q846785","display_name":"Action (physics)","level":2,"score":0.4440630078315735},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.4428287446498871},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.4355430006980896},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3657800853252411},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.33302199840545654},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.290467232465744},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.21580037474632263},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19679725170135498},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.11736994981765747},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.1018751859664917},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/allerton.2010.5706991","is_oa":false,"landing_page_url":"https://doi.org/10.1109/allerton.2010.5706991","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.4300000071525574}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1535136082","https://openalex.org/W1559536003","https://openalex.org/W1579579904","https://openalex.org/W1798373787","https://openalex.org/W1908253641","https://openalex.org/W2006258746","https://openalex.org/W2019664122","https://openalex.org/W2028145673","https://openalex.org/W2088395464","https://openalex.org/W2115118348","https://openalex.org/W2125145840","https://openalex.org/W2162635261","https://openalex.org/W2163419140","https://openalex.org/W2314068453","https://openalex.org/W2551194514","https://openalex.org/W4245448682","https://openalex.org/W6631933408","https://openalex.org/W6633577693","https://openalex.org/W6634752865","https://openalex.org/W6638525973","https://openalex.org/W6640044251","https://openalex.org/W6684093917"],"related_works":["https://openalex.org/W4389475841","https://openalex.org/W4241327272","https://openalex.org/W2120406836","https://openalex.org/W1996214847","https://openalex.org/W2903299703","https://openalex.org/W2117282672","https://openalex.org/W4211224558","https://openalex.org/W1672382258","https://openalex.org/W2119790124","https://openalex.org/W4281791088"],"abstract_inverted_index":{"Optimal":[0],"transmission":[1],"policies":[2],"for":[3,60],"a":[4,20,61,72,80,92,97,142],"two-user":[5],"multiple":[6],"access":[7],"broadcast":[8],"channel":[9,26],"with":[10,146],"binary":[11],"feedback":[12],"are":[13,108],"investigated.":[14],"The":[15],"system":[16],"is":[17,34,43,84,89,113,154],"modeled":[18],"as":[19],"dynamic":[21,62,81,87,118,144],"team.":[22],"Conditioned":[23],"on":[24],"the":[25,28,45,51,69,102,117,124,138],"feedback,":[27],"past":[29],"history":[30],"of":[31,54,71,75,105,141],"buffer":[32],"states":[33],"redundant":[35,41],"to":[36,65],"each":[37],"user.":[38],"Once":[39],"this":[40,135],"data":[42],"removed,":[44],"information":[46],"structure,":[47],"although":[48],"non-classical,":[49],"satisfies":[50],"sufficient":[52],"conditions":[53],"Mahajan,":[55,76],"Nayyar,":[56,77],"and":[57,78,96,131],"Teneketzis,":[58,79],"2008":[59],"team":[63,145],"problem":[64],"be":[66],"tractable.":[67],"Using":[68],"idea":[70],"virtual":[73],"coordinator":[74],"programming":[82],"decomposition":[83],"presented.":[85],"This":[86,121],"program":[88,119],"defined":[90],"over":[91],"countable":[93],"state":[94],"space":[95],"finite":[98],"action":[99],"space.":[100],"When":[101],"arrival":[103],"rates":[104],"both":[106],"users":[107],"symmetric,":[109],"an":[110,139,150],"optimal":[111,125],"policy":[112,122],"identified":[114],"by":[115,129],"solving":[116],"analytically.":[120],"matches":[123],"window":[126],"protocol":[127],"proposed":[128],"Hluchyj":[130],"Gallager,":[132],"1981.":[133],"Thus,":[134],"paper":[136],"presents":[137],"example":[140],"non-trivial":[143],"non-linear":[147],"dynamics":[148],"where":[149],"exact":[151],"analytic":[152],"solution":[153],"obtained.":[155]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}