Hau Chan

Publications

Computational Game Theory and Algorithms

  1. Resource Graph Games: A Compact Representation for Games with Structured Strategy Spaces
    A. X. Jiang, H. Chan, K. Leyton-Brown
    The Thirty-First AAAI Conference on Artificial Intelligence (AAAI 2017)
    [PDF]

  2. Multilinear Games
    H. Chan and A. X. Jiang, K. Leyton-Brown, R. Mehta
    The 12th Conference on Web and Internet Economics (WINE 2016)
    [PDF (Short)] [PDF (Long)]

  3. Congestion Games with Polytopal Strategy Space
    H. Chan and A. X. Jiang
    25th International Joint Conference on Artificial Intelligence (IJCAI 2016)
    [PDF]

  4. Provision-After-Wait with Common Preferences
    H. Chan and J. Chen
    Autonomous Agents and Multiagent Systems (AAMAS 2016)
    [PDF]

  5. Budget Feasible Mechanisms for Dealers
    H. Chan and J. Chen
    Autonomous Agents and Multiagent Systems (AAMAS 2016)
    [PDF]

  6. Computing Nash Equilibria in Interdependent Defense Games
    H. Chan and L. Ortiz
    The Twenty-Ninth AAAI Conference on Artificial Intelligence (AAAI 2015)
    [PDF] [SUPP]

  7. Computing Nash Equilibria in Interdependent Security Games
    H. Chan and L. Ortiz
    2014 Neural Information Processing Systems Foundation (NIPS 2014)
    [PDF] [SUPP]

  8. Truthful Multi-unit Procurements with Budgets
    H. Chan and J. Chen
    The 10th Conference on Web and Internet Economics (WINE 2014)
    [PDF]

  9. Multiwinner Elections Under Preferences that Are Single-Peaked on a Tree
    L. Yu, H. Chan, and E. Elkind
    23rd International Joint Conference on Artificial Intelligence (IJCAI 2013)
    [PDF]

  10. Interdependent Defense Games: Modeling Interdependent Security under Deliberate Attacks
    H. Chan, M. Ceyko, and L. Ortiz
    The 28th Conference on Uncertainty in Artificial Intelligence (UAI 2012)
    [PDF] [SUPP]

Information Network

  1. Using Social Networks to Aid Homeless Shelters: Dynamic Influence Maximization Under Uncertainty
    A. Yadav, H. Chan, A. X. Jiang, H. Xu, E. Rice, M. Tambe
    Autonomous Agents and Multiagent Systems (AAMAS 2016)
    [PDF] Best Student Research Paper

  2. Optimizing Network Robustness by Edge Rewiring: A General Framework
    H. Chan and L. Akoglu
    2016 The European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML PKDD 2016), Journal Track (Data Mining and Knowledge Discovery)
    [LINK]

  3. Where Graph Topology Matters: The Robust Subgraph Problem
    H. Chan, Shuchu Han, and L. Akoglu
    2015 SIAM International Conference on Data Mining (SDM 2015)
    [PDF] Best Research Paper

  4. Make It or Break It: Manipulating Robustness in Large Networks
    H. Chan, L. Akoglu, and H. Tong
    2014 SIAM International Conference on Data Mining (SDM 2014)
    [PDF]

  5. External Evaluation of Topic Models: A Graph Mining Approach
    H. Chan and L. Akoglu
    The IEEE 13th International Conference on Data Mining (ICDM 2013)
    [PDF]

Discrete Mathematics

  1. Sarvate-Beam designs: new results and large sets
    H. Chan, W. Hein, D. G. Sarvate
    The Journal of Combinatorial Mathematics and Combinatorial Computing (JCMCC), (84) 2012
    [PDF]

  2. Stanton Graph Decompositions
    H. Chan and D. G. Sarvate
    Bulletin of Institute of Combinatorics and its Applications (Bulletin of ICA), (64) 2012
    [PDF]

  3. On 1-Sarvate-Beam designs
    H. Chan and D. G. Sarvate
    Discrete Math (DM), (311) 2011
    [LINK]

  4. Beautifully Ordered Balanced Incomplete Block Designs
    H. Chan and D. G. Sarvate
    The Journal of Combinatorial Mathematics and Combinatorial Computing (JCMCC), (74) 2010
    [PDF]

  5. A non-existence result and large sets for SB designs
    H. Chan and D. G. Sarvate
    Ars Combinatoria, (95) 2010
    [PDF]

  6. Sets of MOLSs generated from a single Latin square
    H. Chan and D. G. Sarvate
    Congressus Numerantium, (195) 2009
    [PDF]