Yash Kanoria

I'm the Sidney Taurel Associate Professor of Business in the Decision, Risk and Operations division at Columbia Business School.

My core research centers on the design and optimization of marketplaces including matching markets and online platforms.

I received an NSF CAREER Award in 2017. “The Faculty Early Career Development (CAREER) Program is a Foundation-wide activity that offers the National Science Foundation's most prestigious awards in support of early-career faculty ...”

I teach Business Analytics in the MBA core. Some time back I co-taught a PhD class Engineering Online Matching Markets with Jay Sethuraman. In Fall 2019, I taught an interdisciplinary research-oriented PhD class Statistical Physics, Markets and Algorithms.

You can reach me at ykanoria at-the-rate-of columbia POINT edu. My office is Uris 404.

PhD students: Jiaqi Lu, Pengyu Qian

Postdoc: Abhinav Sinha (co-advised with Fanyin Zheng)

PhD students and postdocs I have worked with: Irene Lo, Vijay Kamble, Itai Feigenbaum, Daniela Saban, Peng Shi, Nick Arnosti, Ross Anderson, Utkarsh Patange.

Journal papers:

• Y. Kanoria and D. Saban, “Facilitating the Search for Partners on Matching Platforms,” minor revision at Management Science (appeared in EC 2017). (talk video)

• I. Ashlagi, M. Braverman, Y. Kanoria and P. Shi, “Clearing matching markets efficiently: informative signals and match recommendations,” Management Science, 66(5), 2020 (also in EC 2017).

• I. Feigenbaum, I. Lo, Y. Kanoria and J. Sethuraman, “Dynamic Matching in School Choice: Efficient Seat Reallocation After Late Cancellations,” to appear in Management Science.

• I. Ashlagi, Y. Kanoria and J. Leshno, “Unbalanced random matching markets: the stark effect of competition,” Journal of Political Economy, 125(1), 2017 (also in EC 2013). (talk video)

• R. Johari, V. Kamble and Y. Kanoria, “Matching while learning,” to appear in Operations Research (appeared in EC 2017).

• Y. Kanoria and H. Nazerzadeh, “Incentive-compatible Learning of Reserve Prices for Repeated Auctions,” to appear in Operations Research.

• Y. Kanoria, D. Saban and J. Sethuraman, “Convergence of the core in assignment markets,” Operations Research, 66(3):597-892, 2018 (also in SODA 2015).

• R. Anderson, I. Ashlagi, Y. Kanoria and D. Gamarnik, “Efficient dynamic barter exchange,” Operations Research, 65(6):1446-1459, 2017 (also in SODA 2015).

• N. Arnosti, R. Johari and Y. Kanoria, “Managing Congestion in Matching Markets,” to appear in Manufacturing and Service Operations Management (also in EC 2014).

• S. Baswana, P. P. Chakrabarti, S. Chandran, Y. Kanoria and U. Patange, “Centralized admissions for engineering colleges in India,” INFORMS Journal on Applied Analytics, 49(5), special issue for finalists for the Wagner Prize for Excellence in OR Practice 2018 (also in EC 2019). (Wagner finalist talk video)

• M. Bayati, C. Borgs, J. Chayes, Y. Kanoria and A. Montanari, “Bargaining dynamics in exchange networks,” Journal of Economic Theory, 156, 2015 (also in SODA 2011).

• M. Ibrahimi, Y. Kanoria, M. Kraning and A. Montanari, “The Set of Solutions of Random XORSAT Formulae,” Annals of Applied Probability, Vol. 25, No. 5, 2015 (also in SODA 2012).

• Y. Kanoria and A. Montanari, “Majority dynamics on trees and the dynamic cavity method,” Annals of Applied Probability, Vol. 21, No. 5, 2011.

• Y. Kanoria and A. Montanari, “Optimal Coding for the Binary Deletion Channel With Small Deletion Probability,” IEEE Transactions on Information Theory, Vol. 59, No. 10, 2013. Also in ISIT 2010, Student Paper award.

• Y. Kanoria and O. Tamuz, “Tractable Bayesian Social Learning on Trees,” IEEE Journal on Selected Areas in Communications, Vol. 31, No. 4, 2013. Also in ISIT 2012.

Working papers:

• S. Banerjee, Y. Kanoria and Pengyu Qian, “Dynamic Assignment Control of a Closed Queueing Network under Complete Resource Pooling,” major revision at Operations Research (appeared in SIGMETRICS 2018).

• Y. Kanoria and Pengyu Qian, “Blind Dynamic Resource Allocation in Closed Networks via Mirror Backpressure,” appeared in ACM EC 2020.

• Y. Kanoria, S. Min, and P. Qian, “Which random matching markets exhibit a stark effect of competition?” submitted.

• Y. Kanoria, I. Lobel and Jiaqi Lu, “Managing Customer Churn Via Service Mode Control,” submitted.

• Y. Kanoria, J. Gan, and X. Zhang, “Local algorithms for dynamic optimization in networks,” work in progress.

• N. Immorlica, Y. Kanoria, and J. Lu, “When does competition and costly information acquisition lead to a deadlock?” work in progress.

Other conference papers:

• Y. Kanoria and H. Nazerzadeh, “Dynamic Reserve Prices for Repeated Auctions: Learning from Bids,” Web and Internet Economics (WINE), 2014.

• Y. Kanoria, A. Montanari, D. Tse and B. Zhang, “Distributed Storage for Intermittent Energy Sources: Control Design and Performance Limits,” Annual Allerton Conference on Communication, Control, and Computing, 2011.

• M. Ibrahimi, A. Javanmard, Y. Kanoria and A. Montanari, “Robust max-product belief propagation,” Asilomar Conference on Signals, Systems and Computers, 2011 (Invited).

• Y. Kanoria and A. Montanari, “Subexponential convergence for information aggregation on regular trees,” (long version) IEEE Conf. on Decision and Control and European Control Conference (CDC-ECC), 2011.

• Y. Kanoria, “An FPTAS for Bargaining Networks with Unequal Bargaining Powers,” Workshop on Internet & Network Economics (WINE), 2010.

• Y. Kanoria, S. Mitra and A. Montanari, “Statistical Static Timing Analysis using Markov Chain Monte Carlo,” Design, Automation & Test in Europe (DATE), 2010.

• C. Dutta, Y. Kanoria, D. Manjunath and J. Radhakrishnan, “A Tight Lower Bound for Parity in Noisy Communication Networks,” ACM-SIAM Symp. on Discrete Alg. (SODA), 2008.

• Y. Kanoria and D. Manjunath, “On Distributed Computation in Noisy Random Planar Networks,” IEEE Intl. Symp. on Information Theory (ISIT), 2007.