This line of research studies efficient and scalable graph/hypergraph partitioning algorithms for distributed computing. We design streaming partitioning methods and game-theoretic optimization techniques to balance workload and minimize communication in large-scale graph processing systems.