{"id":{"repo_id":"mit","oai_identifier":"oai:dspace.mit.edu:1721.1/151237"},"canonical_url":"https://search.dev.ndltd.org/etd/mit/oai:dspace.mit.edu:1721.1/151237","repository":{"repo_id":"mit","name":"MIT","base_url":"https://dspace.mit.edu/oai/request"},"display":{"title":"Games meet Concurrency: Algorithms and Hardness","abstract":"Since the turn of the 21st century, seeing the decline of Moore’s Law on the horizon, the pursuit of continued software performance gains has led to the prominence of computer architectures with high degrees of parallelism and memory cache hierarchies. However, there are still many challenges to designing efficient algorithms and understanding the complexity of fundamental problems in these new models of computation. Given the similarities of concurrent systems of multiple agents and multiplayer games, this thesis analyzes a spectrum of models connecting these three fields and bridges the gaps between them by building upon techniques from the growing literature studying the complexity of games through gadget motion planning frameworks.","abstract_html":"Since the turn of the 21st century, seeing the decline of Moore’s Law on the horizon, the pursuit of continued software performance gains has led to the prominence of computer architectures with high degrees of parallelism and memory cache hierarchies. However, there are still many challenges to designing efficient algorithms and understanding the complexity of fundamental problems in these new models of computation. Given the similarities of concurrent systems of multiple agents and multiplayer games, this thesis analyzes a spectrum of models connecting these three fields and bridges the gaps between them by building upon techniques from the growing literature studying the complexity of games through gadget motion planning frameworks.","abstract_has_math":false,"creators":["Coulombe, Michael Joseph"],"institution":"Massachusetts Institute of Technology","degree_name":"Doctoral","degree_level":null,"degree_discipline":null,"degree_department":"Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science","school":null,"contributors":[],"advisors":["Demaine, Erik D."],"committee_chairs":[],"committee_members":[],"year":2023,"date_issued":"2023-06","date_published":"2023-06","updated_at":"2026-07-22T22:21:20Z","subjects":[],"languages":[],"rights":["In Copyright - Educational Use Permitted","Copyright retained by author(s)"],"rights_urls":["https://rightsstatements.org/page/InC-EDU/1.0/"],"identifier_entries":[]},"links":{"outbound_url":"https://hdl.handle.net/1721.1/151237","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Demaine, Erik D."]},{"key":"dc:contributor.department","label":"Department","values":["Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science"]},{"key":"dc:creator","label":"Author","values":["Coulombe, Michael Joseph"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2023-07-31T19:24:59Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2023-07-31T19:24:59Z"]},{"key":"dc:date.issued","label":"Date","values":["2023-06"]},{"key":"dc:publisher","label":"Institution","values":["Massachusetts Institute of Technology"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Doctoral","Doctor of Philosophy"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:rights","label":"Dc Rights","values":["In Copyright - Educational Use Permitted","Copyright retained by author(s)"]},{"key":"dc:rights.uri","label":"Rights URI","values":["https://rightsstatements.org/page/InC-EDU/1.0/"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://hdl.handle.net/1721.1/151237"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["Since the turn of the 21st century, seeing the decline of Moore’s Law on the horizon, the pursuit of continued software performance gains has led to the prominence of computer architectures with high degrees of parallelism and memory cache hierarchies. However, there are still many challenges to designing efficient algorithms and understanding the complexity of fundamental problems in these new models of computation. Given the similarities of concurrent systems of multiple agents and multiplayer games, this thesis analyzes a spectrum of models connecting these three fields and bridges the gaps between them by building upon techniques from the growing literature studying the complexity of games through gadget motion planning frameworks."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["Ph.D."]},{"key":"dc:title","label":"Title","values":["Games meet Concurrency: Algorithms and Hardness"]}]}],"canonical_facts":{"dc:contributor.advisor":["Demaine, Erik D."],"dc:contributor.department":["Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science"],"dc:creator":["Coulombe, Michael Joseph"],"dc:date.accessioned":["2023-07-31T19:24:59Z"],"dc:date.available":["2023-07-31T19:24:59Z"],"dc:date.issued":["2023-06"],"dc:description.abstract":["Since the turn of the 21st century, seeing the decline of Moore’s Law on the horizon, the pursuit of continued software performance gains has led to the prominence of computer architectures with high degrees of parallelism and memory cache hierarchies. However, there are still many challenges to designing efficient algorithms and understanding the complexity of fundamental problems in these new models of computation. Given the similarities of concurrent systems of multiple agents and multiplayer games, this thesis analyzes a spectrum of models connecting these three fields and bridges the gaps between them by building upon techniques from the growing literature studying the complexity of games through gadget motion planning frameworks."],"dc:description.degree":["Ph.D."],"dc:identifier.uri":["https://hdl.handle.net/1721.1/151237"],"dc:publisher":["Massachusetts Institute of Technology"],"dc:rights":["In Copyright - Educational Use Permitted","Copyright retained by author(s)"],"dc:rights.uri":["https://rightsstatements.org/page/InC-EDU/1.0/"],"dc:title":["Games meet Concurrency: Algorithms and Hardness"],"dc:type":["Thesis"],"thesis:degree_name":["Doctoral","Doctor of Philosophy"]},"updated_at":"2026-07-22T22:21:20Z"}