A Picture of Hau

Hau Chan

Assistant Professor
Department of Computer Science and Engineering
University of Nebraska-Lincoln, Lincoln, NE

Office: Avery 261
e-mail: hchan3 [at] unl.edu
Phone: 402-472-5091

Research Interests: Computational Game Theory, Mechanism Design, Algorithms, Data/Graph Mining, Machine Learning, Discrete Mathematics


I am starting my first year (Fall 2018) as a tenure-track assistant professor in the Department of Computer Science and Engineering at the University of Nebraska-Lincoln (UNL)!

I am teaching a new course on Networks, Crowds, and Markets: Societal Problems (T/Th 8:00 AM - 9:15 AM, Avery 110).

Prospective Students!

I am looking for students to work on various projects in the area of computational game theory, graph mining, and AI for social goods.
If you are interested, please contact me and/or apply to the UNL CS program.

About Me

From 2017 to 2018, I was a postdoctoral fellow in the Laboratory for Innovation Science at Harvard (a joint lab with the Harvard's School of Engineering and Applied Sciences, Business School, and Medical School) working with Prof. David Parkes and Prof. Karim Lakhani. I will continue to be an affiliated member of the lab!

I was a postdoctoral summer fellow at the USC Center for Artificial Intelligence in Society working with Prof. Milind Tambe in the summer of 2017.

From 2015 to 2017, I was a postdoctoral research associate (postdoc) at Trinity University working with Prof. Albert Jiang.

I designed and taught CSCI:1311 Introduction to Programming for Non-Majors using Python as a part-time faculty at Trinity University.

I work mainly in the area of computational game theory (CGT) and AI. More specifically, I am interested in modeling and representing social science problems compactly, and finding efficient algorithms and heuristics to compute solution/equilibrium concepts efficiently (by leveraging the compact representation). I am also interested in graph measuring and mining, and graph manipulating problems with the goals of understanding and improving real world network systems, respectively.

I obtained my Ph.D. in Computer Science at Stony Brook University under the advising of Prof. Luis Ortiz in (August) 2015. For my Ph.D., Prof. Ortiz and I were working on applying game-theoretic models to attacher/defenders settings. I was awarded the NSF graduate research fellowship based on this proposed research.

While I was at Stony Brook, I also worked with Prof. Leman Akoglu and Prof. Jing Chen on data mining/graph mining and mechanism designs, respectively.

I worked with Prof. Edith Elkind on a computational voting theory project in the summer of 2012 under the NSF EASPSI Fellowship (at Nanyang Technological University, Singapore).

Prior coming to Stony Brook, I obtained my Bachelor of Science in Computer Science and Mathematics at the College of Charleston, SC. At College of Charleston, I worked on several research projects on combinatorial designs with Prof. Dinesh Sarvate. I spent my summer of 2009 at Georgia Institute of Technology under the NSF Research Experience for Undergraduate (REU) working on polynomials satisfying second-order q-difference equations with Prof. Plamen lliev. At the same summer, I was selected to attend a summer program in analysis and geometry hosted by the Department of Mathematics at Princeton University.

Selected Awards

  1. Best Student Research Paper Award, Autonomous Agents and Multiagent Systems (AAMAS), 2016
  2. Best Research Paper Award, 2015 SIAM International Conference on Data Mining (SDM), 2015
  3. Catacosinos Fellowship for Excellence in Computer Science, Stony Brook University, 2015
  4. National Science Foundation Graduate Research Fellowship, 2012 - 2015
  5. Top Graduate Student, Stony Brook University, 2013
  6. National Science Foundation EAPSI Summer Fellowship, 2012
  7. Enhanced Computer Science Fellowship, Stony Brook University, 2010