Selected Publications

(2018). Learning Safe Policies with Expert Guidance. In NeurIPS.

PDF arXiv

(2017). Learning Multi-item Auctions with (or without) Samples. In FOCS.

PDF arXiv

(2017). Approximating Gains from Trade in Two-sided Markets via Simple Mechanisms. In EC.

PDF arXiv

(2017). Simple Mechanisms for Subadditive Buyers via Duality. In STOC, invited to the Special Issue of Games and Economic Behavior for STOC/FOCS/SODA.

PDF arXiv

(2016). A Duality Based Unified Approach to Bayesian Mechanism Design. In STOC, invited to the Special Issue of SIAM Journal on Computing for STOC and the 2017 Highlights of Algorithms.

PDF

(2016). On the Economic Efficiency of the Combinatorial Clock Auction. In SODA.

PDF arXiv

(2015). Optimum Statistical Estimation with Strategic Data Sources. In COLT.

PDF arXiv

(2013). Understanding Incentives: Mechanism Design becomes Algorithm Design. In FOCS, invited to the Special Issue of Games and Economic Behavior for STOC/FOCS/SODA.

PDF arXiv

Recent Publications

More Publications

. Third-Party Data Providers Ruin Simple Mechanisms. 2018.

PDF arXiv

. Simple and Approximately Optimal Pricing for Proportional Complementarities. 2018.

. A Duality Based Unified Approach to Bayesian Mechanism Design. In SIGECOM Newsletter, 2016.

PDF Source Document

. Zero-sum Polymatrix Games: A Generalization of Minmax. In Mathematics of Operations Research, 2016.

PDF Source Document

. Reducing Bayesian Mechanism Design to Algorithm Design. In Encyclopedia of Algorithms, 2015.

PDF Source Document

. Biobjective Online Bipartite Matching. In WINE, 2014.

PDF

Teaching

Here is a list of courses I’ve previously taught:

  • COMP 362: Honours Algorithm Design. Winter 2018
  • COMP 360: Algorithm Design. Winter 2015, Fall 2016, Winter 2017, Fall 2017
  • COMP/MATH 553: Algorithmic Game Theory. Fall 2014, Fall 2016, Fall 2018
  • COMP 202: Foundations of Computing. Winter 2016
  • Contact