{"id":"https://openalex.org/W2515792973","doi":"https://doi.org/10.1109/isit.2016.7541789","title":"Asynchronous decentralized algorithms for the noisy 20 questions problem","display_name":"Asynchronous decentralized algorithms for the noisy 20 questions problem","publication_year":2016,"publication_date":"2016-07-01","ids":{"openalex":"https://openalex.org/W2515792973","doi":"https://doi.org/10.1109/isit.2016.7541789","mag":"2515792973"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2016.7541789","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2016.7541789","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE International Symposium on Information Theory (ISIT)","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/A5031789494","display_name":"Theodoros Tsiligkaridis","orcid":"https://orcid.org/0000-0003-0903-2861"},"institutions":[{"id":"https://openalex.org/I4210122954","display_name":"MIT Lincoln Laboratory","ror":"https://ror.org/022z6jk58","country_code":"US","type":"facility","lineage":["https://openalex.org/I4210122954","https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Theodoros Tsiligkaridis","raw_affiliation_strings":["MIT Lincoln Laboratory, USA","MIT Lincoln Laboratory"],"affiliations":[{"raw_affiliation_string":"MIT Lincoln Laboratory, USA","institution_ids":["https://openalex.org/I4210122954"]},{"raw_affiliation_string":"MIT Lincoln Laboratory","institution_ids":["https://openalex.org/I4210122954"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5031789494"],"corresponding_institution_ids":["https://openalex.org/I4210122954"],"apc_list":null,"apc_paid":null,"fwci":1.5184,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.85013802,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"2699","last_page":"2703"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.9997000098228455,"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/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.9997000098228455,"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/T12879","display_name":"Distributed Sensor Networks and Detection Algorithms","score":0.998199999332428,"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/T12288","display_name":"Optimization and Search Problems","score":0.9937000274658203,"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/asynchronous-communication","display_name":"Asynchronous communication","score":0.7747011184692383},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7473471760749817},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.7216905355453491},{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.6686892509460449},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.6271206736564636},{"id":"https://openalex.org/keywords/pairwise-comparison","display_name":"Pairwise comparison","score":0.5450277328491211},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.43500033020973206},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.415319561958313},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.32086101174354553},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.20907026529312134}],"concepts":[{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.7747011184692383},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7473471760749817},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.7216905355453491},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.6686892509460449},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.6271206736564636},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.5450277328491211},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.43500033020973206},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.415319561958313},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32086101174354553},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.20907026529312134},{"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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"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/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2016.7541789","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2016.7541789","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W55403181","https://openalex.org/W2003321974","https://openalex.org/W2005235540","https://openalex.org/W2006602349","https://openalex.org/W2025658991","https://openalex.org/W2035039048","https://openalex.org/W2044212084","https://openalex.org/W2062626064","https://openalex.org/W2094365833","https://openalex.org/W2117905067","https://openalex.org/W2128439793","https://openalex.org/W2136817255","https://openalex.org/W2137775453","https://openalex.org/W2145574455","https://openalex.org/W2147713217","https://openalex.org/W2154834860","https://openalex.org/W2165469059","https://openalex.org/W2169826194","https://openalex.org/W2246700095","https://openalex.org/W2478708596","https://openalex.org/W2964256184","https://openalex.org/W6602262026","https://openalex.org/W6691157973"],"related_works":["https://openalex.org/W2487162673","https://openalex.org/W2793211469","https://openalex.org/W2949152769","https://openalex.org/W4372354731","https://openalex.org/W2942366970","https://openalex.org/W2807634898","https://openalex.org/W1692008701","https://openalex.org/W2597588799","https://openalex.org/W4360593462","https://openalex.org/W2562400057"],"abstract_inverted_index":{"This":[0],"paper":[1],"studies":[2],"the":[3,57,68,79,82,85,116,127],"problem":[4],"of":[5,27,81,87,131],"adaptively":[6],"searching":[7],"for":[8,38,51,134],"an":[9,34],"unknown":[10],"target":[11],"using":[12],"multiple":[13],"agents":[14],"connected":[15],"through":[16],"a":[17,110],"time-varying":[18,69],"network":[19,70,136],"topology.":[20],"Agents":[21],"are":[22],"equipped":[23],"with":[24,101],"sensors":[25],"capable":[26],"fast":[28],"information":[29],"processing,":[30],"and":[31,61,95,104,129],"we":[32,72],"propose":[33,47],"asynchronous":[35,48],"decentralized":[36,49,118],"algorithm":[37,133],"controlling":[39],"their":[40],"search":[41,54],"based":[42],"on":[43,67,78],"noisy":[44],"observations.":[45],"We":[46,125],"algorithms":[50,120],"adaptive":[52],"query-based":[53],"that":[55,93],"combine":[56],"Bayesian":[58],"bisection":[59],"method":[60],"social":[62],"learning.":[63],"Under":[64],"standard":[65],"assumptions":[66],"dynamics,":[71],"prove":[73],"convergence":[74],"to":[75,115],"correct":[76],"consensus":[77],"value":[80],"parameter":[83],"as":[84],"number":[86],"iterations":[88],"grow.":[89],"Our":[90],"results":[91],"establish":[92],"stability":[94],"consistency":[96],"can":[97],"be":[98],"maintained":[99],"even":[100],"one-way":[102],"updating":[103],"randomized":[105],"pairwise":[106],"averaging,":[107],"thus":[108],"providing":[109],"scalable":[111],"low":[112],"complexity":[113],"alternative":[114],"synchronous":[117],"estimation":[119],"studied":[121],"in":[122],"previous":[123],"works.":[124],"illustrate":[126],"effectiveness":[128],"robustness":[130],"our":[132],"random":[135],"topologies.":[137]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":4},{"year":2015,"cited_by_count":1}],"updated_date":"2026-03-21T06:30:42.041108","created_date":"2025-10-10T00:00:00"}