I am advised by the following unordered pair: {Geoff Gordon, André Platzer}. Currents interests are:

  • linear complementarity problems
  • learning theory
  • probabilistic inference

I am a member of the Logical Systems Lab and the SELECT Lab


  • Ph.D. in Computer Science from Carnegie Mellon University (2008 - )
  • M.Sc. in Computer Science from the University of British Columbia; advised by Kevin Leyton-Brown (2007 - 2008)
  • EPIC Intern, IBM Toronto (2004 - 2005)
  • B.Sc. Honours in Computer Science from the University of British Columbia (2001 - 2006)


  • A Projection Algorithm for Strictly Monotone Linear Complementarity Problems E. Zawadzki, Geoffrey Gordon, Andre Platzer. NIPS OPT, December 2013. (Paper)
  • A Generalization of SAT and #SAT for Robust Policy Evaluation E. Zawadzki, Andre Platzer, Geoffrey Gordon. IJCAI, August 2013. (Paper)
  • Memory-Efficient GroupBy-Aggregate with Compressed Buffer Trees A. Hrishikesh, W. Richter, D. Andersen, M. Kaminksy, A. Balachandran, E. Zawadzki. ACM Symposium on Cloud Computing, October 2013 (Paper)
  • An Instantiation-Based Theorem Prover for First-Order Programming E. Zawadzki, Geoffrey Gordon, Andre Platzer. AISTATS, April 2011. (Paper)
  • Search Tree Restructuring E. Zawadzki, T. Sandholm. Technical Report, May 2010. (Paper)
  • Empirically Evaluating Multiagent Learning Algorithms E. Zawadzki, A. Lipson, K. Leyton-Brown. Working Paper, November 2008. (Paper)
  • Empirically testing decision making in TAC SCM, E. Zawadzki, K. Leyton-Brown. AAAI-07 Workshop on Trading Agent Design and Analysis (TADA-07), Vancouver, 2007. (Paper)
  • Multiagent learning and empirical methods E. Zawadzki. Master's Thesis, 2008. (Thesis)



Graduate coursework



  • NSERC PGS M (2007-2008)
  • UBC Undergraduate Scholarship Program (2001-2006)