Games meet Concurrency: Algorithms and Hardness
Name
coulombe-mcoulomb-phd-eecs-2023-thesis.pdf
Description
Thesis PDF
Size
2.52 MB
Format
Adobe PDF
Checksum (MD5)
b8caccefec1ae0ea620024600acf0112
Author(s)
Coulombe, Michael Joseph
Advisor(s)
Demaine, Erik D.
Date Issued
June 2023
Publisher
Massachusetts Institute of Technology
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.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
In Copyright - Educational Use Permitted
Copyright retained by author(s)
Persistent DSpace Link
