{"id":"https://openalex.org/W7124167445","doi":"https://doi.org/10.65109/mqtp9765","title":"Distributed algorithms for solving the multiagent temporal decoupling problem","display_name":"Distributed algorithms for solving the multiagent temporal decoupling problem","alternate_titles":[],"publication_year":2011,"publication_date":"2011-05-02","ids":{"openalex":"https://openalex.org/W7124167445","doi":"https://doi.org/10.65109/mqtp9765"},"language":"en","primary_location":{"id":"doi:10.65109/mqtp9765","doi":"https://doi.org/10.65109/mqtp9765","is_oa":false,"landing_page_url":"https://doi.org/10.65109/mqtp9765","pdf_url":null,"source":{"id":"https://openalex.org/S4306417597","display_name":"Adaptive Agents and Multi-Agents Systems","issn_l":"1548-8403","issn":["1548-8403"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":["norway-1"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Joint Conference on Autonomous Agents and Multiagent Systems","raw_type":"proceedings-article"},"parent_works":[],"lineage":["https://openalex.org/W7124167445"],"child_works_count":0,"type":"conference-paper","is_traditional":true,"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/A5055168327","display_name":"James C. Boerkoel","orcid":"https://orcid.org/0000-0002-4564-0226","observed_orcids":["https://orcid.org/0000-0002-4564-0226"]},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"James C. Boerkoel","raw_affiliation_strings":["University of Michigan, Ann Arbor, MI"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Michigan, Ann Arbor, MI","institution_ids":["https://openalex.org/I27837315"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5061747257","display_name":"Edmund H. Durfee","orcid":"https://orcid.org/0000-0002-1045-3690","observed_orcids":["https://orcid.org/0000-0002-1045-3690"]},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Edmund H. Durfee","raw_affiliation_strings":["University of Michigan, Ann Arbor, MI"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Michigan, Ann Arbor, MI","institution_ids":["https://openalex.org/I27837315"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I27837315"],"apc_list":null,"apc_paid":null,"fwci":0.4613,"has_fulltext":false,"cited_by_count":2,"reviewed_by_count":0,"citation_normalized_percentile":{"value":0.50057211,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":87,"max":92},"biblio":{"volume":null,"issue":null,"first_page":"141","last_page":"148"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10456","display_name":"Multi-Agent Systems and Negotiation","score":0.0003000000142492354,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":9.999999747378752e-05,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/temporal-decoupling","display_name":"temporal decoupling","score":0.9670000076293945},{"id":"https://openalex.org/keywords/distributed-algorithms","display_name":"distributed algorithms","score":0.7409999966621399},{"id":"https://openalex.org/keywords/privacy-protection","display_name":"privacy preservation","score":0.5830000042915344},{"id":"https://openalex.org/keywords/communication-uncertainty","display_name":"communication uncertainty","score":0.47999998927116394},{"id":"https://openalex.org/keywords/computational-complexity","display_name":"computational complexity","score":0.7179999947547913},{"id":"https://openalex.org/keywords/heuristic-selection","display_name":"heuristic selection","score":0.4490000009536743},{"id":"https://openalex.org/keywords/temporal-flexibility","display_name":"temporal flexibility","score":0.4259999990463257}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.707099974155426},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.698199987411499},{"id":"https://openalex.org/C205606062","wikidata":"https://www.wikidata.org/wiki/Q5249645","display_name":"Decoupling (probability)","level":2,"score":0.6761999726295471},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5274999737739563},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4562000036239624},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.44679999351501465},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4399999976158142},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4178999960422516},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.38600000739097595},{"id":"https://openalex.org/C18555067","wikidata":"https://www.wikidata.org/wiki/Q8375051","display_name":"Joint (building)","level":2,"score":0.37059998512268066},{"id":"https://openalex.org/C41550386","wikidata":"https://www.wikidata.org/wiki/Q529909","display_name":"Multi-agent system","level":2,"score":0.329800009727478},{"id":"https://openalex.org/C148043351","wikidata":"https://www.wikidata.org/wiki/Q4456944","display_name":"Current (fluid)","level":2,"score":0.3028999865055084},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.2992999851703644},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.2824999988079071},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.26089999079704285},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.25929999351501465},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.25699999928474426},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.25060001015663147}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.65109/mqtp9765","doi":"https://doi.org/10.65109/mqtp9765","is_oa":false,"landing_page_url":"https://doi.org/10.65109/mqtp9765","pdf_url":null,"source":{"id":"https://openalex.org/S4306417597","display_name":"Adaptive Agents and Multi-Agents Systems","issn_l":"1548-8403","issn":["1548-8403"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":["norway-1"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Joint Conference on Autonomous Agents and Multiagent Systems","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2294087783","https://openalex.org/W2572404266","https://openalex.org/W1483291011","https://openalex.org/W2562788649","https://openalex.org/W2325354116","https://openalex.org/W2000129601","https://openalex.org/W7099668472","https://openalex.org/W3177246986","https://openalex.org/W2158638039","https://openalex.org/W7124145052"],"abstract_inverted_index":{"Scheduling":[0],"agents":[1,62],"can":[2,63],"use":[3],"the":[4,16,101,126],"Multiagent":[5],"Simple":[6],"Temporal":[7],"Problem":[8],"(MaSTP)":[9],"formulation":[10],"to":[11],"efficiently":[12],"find":[13,64],"and":[14,27,65,137,150,159],"represent":[15,66],"complete":[17],"set":[18,34,84],"of":[19,35,72,76,85,100,156],"alternative":[20],"consistent":[21,36,77,86],"joint":[22,37,87],"schedules":[23,38,78],"in":[24,49,70,104,145],"a":[25,46,67,83,94,109,117,163],"distributed":[26,113],"privacy-maintaining":[28],"manner.":[29],"However,":[30],"continually":[31],"revising":[32],"this":[33,105,123],"as":[39,131],"new":[40,157],"constraints":[41],"arise":[42],"may":[43],"not":[44],"be":[45],"viable":[47],"option":[48],"environments":[50],"where":[51],"communication":[52],"is":[53,142],"uncertain,":[54],"costly,":[55],"or":[56],"otherwise":[57],"problematic.":[58],"As":[59],"an":[60,152],"alternative,":[61],"temporal":[68,95,118,166],"decoupling":[69,96],"terms":[71],"locally":[73],"independent":[74],"sets":[75],"that,":[79],"when":[80],"combined,":[81],"form":[82],"schedules.":[88],"Unlike":[89],"current":[90,132],"algorithms":[91],"for":[92,115,161],"calculating":[93,116],"that":[97,122,140],"require":[98],"centralization":[99],"problem":[102],"representation,":[103],"paper":[106],"we":[107],"present":[108],"new,":[110],"provably":[111],"correct,":[112],"algorithm":[114,124],"decoupling.":[119,167],"We":[120,147],"prove":[121],"has":[125],"same":[127],"theoretical":[128],"computational":[129],"complexity":[130],"state-of-the-art":[133],"MaSTP":[134],"solution":[135],"algorithms,":[136],"empirically":[138],"demonstrate":[139],"it":[141],"more":[143],"efficient":[144],"practice.":[146],"also":[148],"introduce":[149],"perform":[151],"empirical":[153],"cost/benefit":[154],"analysis":[155],"techniques":[158],"heuristics":[160],"selecting":[162],"maximally":[164],"flexible":[165]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W7124167445","counts_by_year":[{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2025-10-27T00:00:00"}
