Yash Kanoria
Updated Jan 2018
Employment Associate Professor (without tenure) From July 2017Assistant Professor July 2013 - June 2017Decision, Risk and Operations Division,Graduate School of Business, Columbia University, New York, NY.
Schramm postdoctoral fellow Aug 2012 - June 2013Microsoft Research New England, Cambridge, MA.
Contact Uris Hall Phone: (650) 353-0476Columbia University ykanoria AT columbia POINT edu
New York, NY 10027 http://www.columbia.edu/~yk2577
Education Stanford University, Stanford, CA Sep 2007 - Aug 2012iixPhD in Electrical EngineeringiixAdviser: Andrea MontanariiixThesis title: Learning in social and economic networks
Indian Institute of Technology Bombay, India (CPI 10.00/10.00) Jul 2003 - May 2007iixBachelor of Technology in Electrical Engineering
ResearchInterests
Matching markets, design and operations of marketplaces and platforms
Distinctions NSF CAREER Award 2017
Simons-Berkeley Research Fellowship Fall 2015
INFORMS JFIG Junior Faculty Paper Award (second prize) 2014
Student Paper Award at IEEE Intl. Symposium on Information Theory 2010
Numerical Technologies Founders’ Prize for top score on the EE PhD Qualifying 2008Examination at Stanford
President of India Gold Medal at IIT Bombay for standing first in the institute 2007
Gold Medal and second overall at the International Physics Olympiad (IPhO) 2003
Gold Medal and second overall at the International Chemistry Olympiad (IChO) 2003
Ranked 2nd at the All India IIT Joint Entrance Examination 2003
Journal Papers Y. Kanoria, D. Saban and J. Sethuraman, “The size of the core in random assignment markets,” toappear in Operations Research.
R. Anderson, I. Ashlagi, Y. Kanoria and D. Gamarnik, “Efficient dynamic barter exchange,” Oper-ations Research, 65(6), 1446-1459, 2017.
I. Ashlagi, Y. Kanoria and J. Leshno, “Unbalanced random matching markets: the stark effect ofcompetition,” Journal of Political Economy, 125(1), Feb 2017.
M. Bayati, C. Borgs, J. Chayes, Y. Kanoria, and A. Montanari, “Bargaining dynamics in exchangenetworks,” Journal of Economic Theory, Vol. 156, pp. 417454, March 2015.
M. Ibrahimi, Y. Kanoria, M. Kraning and A. Montanari, “The Set of Solutions of Random XORSATFormulae,” to appear in the Annals of Applied Probability, Vol. 25, No. 5, Sep 2015.
Y. Kanoria and A. Montanari, “Majority dynamics on trees and the dynamic cavity method,” Annalsof Applied Probability, Vol. 21, No. 5, Oct 2011.
Y. Kanoria and A. Montanari, “Optimal coding for the deletion channel with small deletion proba-bility,” IEEE Transactions on Information Theory, Vol. 59, No. 10, pp. 6192-6219, Oct. 2013.
Y. Kanoria and O. Tamuz, “Tractable Bayesian Social Learning,” IEEE Journal on Selected Areasin Communication, Vol. 31, No. 4, pp. 756-765, April 2013.
Working papers Y. Kanoria and H. Nazerzadeh, “Dynamic Reserves For Repeated Auctions: Learning from Bids,”major revision at Operations Research, submitted.
Itai Feigenbaum, Yash Kanoria, Irene Lo and Jay Sethuraman, “Dynamic Matching in School Choice:Efficient Seat Reallocation After Late Cancellations,” major revision at Management Science.
R. Johari, V. Kamble, and Y. Kanoria, “Matching while Learning,” major revision at OperationsResearch.
I. Ashlagi, M. Braverman, Y. Kanoria and P. Shi, “Communication Requirements and InformativeSignaling in Matching Markets”
Y. Kanoria and D. Saban, “Facilitating the search for partners on matching platforms: restrictingagent actions”
N. Arnosti, R. Johari and Y. Kanoria, “Managing congestion in matching markets”
S. Banerjee, Y. Kanoria and P. Qian (2017), “The Value of State Dependent Control in Ride-sharingSystems,” work in progress.
Y. Kanoria, I. Lobel and J. Lu (2017), “Dynamic Decision Making under Customer AbandonmentRisk,” work in progress.
RefereedconferencePapers
R. Johari, V. Kamble, and Y. Kanoria, “Matching while Learning,” ACM Conference on Economicsand Computation (EC), 2017.
I. Ashlagi, M. Braverman, Y. Kanoria and P. Shi, “Communication Requirements and InformativeSignaling in Matching Markets,” ACM Conference on Economics and Computation (EC), 2017.
Y. Kanoria and D. Saban, “Facilitating the search for partners on matching platforms: restrictingagent actions,” ACM Conference on Economics and Computation (EC), 2017.
Itai Feigenbaum, Yash Kanoria, Irene Lo and Jay Sethuraman, “Dynamic Matching in School Choice:Efficient Seat Reallocation After Late Cancellations,” Workshop on Internet and Network Economics(WINE), 2016.
Y. Kanoria, D. Saban and J. Sethuraman, “The size of the core in random assignment markets.”ACM-SIAM Symp. on Discrete Algorithms (SODA), 2015.
Y. Kanoria and H. Nazerzadeh, “Dynamic Reserves For Repeated Auctions: Learning from Bids,”Workshop on Internet and Network Economics (WINE), 2014.
N. Arnosti, R. Johari and Y. Kanoria, “Managing search in decentralized matching markets,” ACMConference on Economics and Computation (EC), 2014.
I. Ashlagi, Y. Kanoria and J. D. Leshno, “Unbalanced random matching markets,” ACM Conferenceon Economics and Computation (EC), 2013.
Y. Kanoria and O. Tamuz, “Tractable Bayesian Social Learning on Trees,” IEEE Intl. Symposiumon Information Theory (ISIT), 2012.
M. Ibrahimi, Y. Kanoria, M. Kraning and A. Montanari, “The Set of Solutions of Random XORSATFormulae,” ACM-SIAM Symp. on Discrete Algorithms (SODA), 2012.
M. Ibrahimi, A. Javanmard, Y. Kanoria and A. Montanari, “Robust max-product belief propaga-tion,” Asilomar Conference on Signals, Systems and Computers, 2011 (Invited).
Y. Kanoria, A. Montanari, D. Tse and B. Zhang, “Distributed Storage for Intermittent EnergySources: Control Design and Performance Limits,” Annual Allerton Conf. on Communication,Control and Computing, 2011.
Y. Kanoria and A. Montanari, “Subexponential convergence for information aggregation on regulartrees,” IEEE Conf. on Decision and Control and European Control Conf. (CDC-ECC), 2011.
Y. Kanoria, “A FPTAS for Bargaining Networks with Unequal Bargaining Powers,” Workshop onInternet and Network Economics (WINE), 2010.
Y. Kanoria, M. Bayati, C. Borgs, J. Chayes and A. Montanari, “Fast Convergence of NaturalBargaining Dynamics in Exchange Networks,” ACM-SIAM Symp. on Discrete Algorithms (SODA),2011.
Y. Kanoria and A. Montanari, “On the deletion channel with small deletion probability,” IEEE Intl.Symposium on Information Theory (ISIT), 2010, Student Paper Award.
Y. Kanoria, S. Mitra and A. Montanari, “Statistical Static Timing analysis using Markov chainMonte Carlo,” Design, Automation and Test in Europe (DATE), 2010.
C. Dutta, Y. Kanoria, D. Manjunath and J. Radhakrishnan, “A Tight Lower Bound for Parity inNoisy Communication Networks,” ACM-SIAM Symposium on Discrete Algorithms (SODA), 2008.
Y. Kanoria and D. Manjunath, “On Distributed Computation in Noisy Random Planar Networks,”IEEE Intl. Symp. on Information Theory (ISIT), 2007.
IndustryExperience
Microsoft Research New England, Cambridge, MA Summer ’10, ’11, Aug ’12 - Jun ’13
D.E. Shaw & Co, Cupertino, CA Summer 2008
iixWorked with high speed trades group
Goldman Sachs Group, Inc., Bangalore, India & New York, NY Summer 2007
iixWorked on limit order execution times
ProfessionalService
Associate Editor (since Aug 2016), Operations Research.
Meritorious Service Award, 2013, Operations Research.
Program Committee member for the World Wide Web conference (WWW), 2013, and ACM Con-ference on Economics and Computation, 2016, 2017 and 2018.
Reviewer for Management Science, Operations Research, Mathematics of Operations Research,Econometrica, Review of Economic Studies, Probability Theory and Related Fields, Random Struc-tures and Algorithms, Stochastic Systems, Annals of Applied Probability, Economic Theory, Gamesand Economic Behavior, Theoretical Economics, Automatica, SIAM Journal on Discrete Mathemat-ics, IEEE Trans. on Information Theory, IEEE Trans. on Automatic Control, ACM Transactions onAlgorithms, Electronic Journal of Probability, Internet Mathematics, IEEE Trans. on Computers
and IEEE Trans. on Communications. ACM-SIAM Symp. on Economics and Computation, ACMSymp. on Theory of Computing, ACM-SIAM Symp. on Discrete Algorithms, Workshop on Internetand Network Economics, Symp. on Algorithmic Game Theory, IEEE Intl. Symp. on InformationTheory, Information Theory Workshop, Performance, IEEE Conf. on Decision and Control, Intl.Conf. on VLSI design, and Intl. Workshop on Algorithms and Computation.
Co-organizer of weekly DRO-IEOR seminar at Columbia since Spring 2017.
Organizer of “Learning and market design” seminar series at Simons Institute, Fall 2015, as part ofEconomics and Computation program.
Organizer of “Reverse Field Trip” involving speakers from local companies on Nov 9, 2015, at SimonsInstitute, as part of Economics and Computation program.
Teaching Computing for Business Research, Fall 2013 and Fall 2014, Columbia Business School.
Business Analytics, Spring 2015, Spring 2016, Spring 2017 and Fall 2017, Columbia Business School.
Co-taught a PhD class “Engineering online matching markets” with Jay Sethuraman in Spring 2017.
Outside activitiesSuccessfully proposed new method for seat allocation in engineering colleges in India. Memberof the Technical committee, responsible for the mechanism and algorithm for joint seat alloca-tion/admissions for over 30,000 seats at 88 centrally funded engineering colleges in India includingthe Indian Institutes of Technology, National Institutes of Technology etc. Implemented successfullyin summer 2015, and again, with further improvements suggested by me, in 2016. I continue to beinvolved.
Regular conversations with data scientists at Airbnb, Upwork, Uber, Lyft and other sharing economyplatforms. Also, the New York City Department of Education regarding school choice.
Grants NSF CAREER Award 2017. Funding runs until 2022.
Principal Investigator, Jerome A. Chazen Institute of International Business grant entitled “Cen-tralized seat allocation for engineering colleges in India,” 2015-16.
Invited Talks Dynamic Reserves For Repeated Auctions: Learning from Bids
iixINFORMS Annual meeting, Houston, TX Oct 2017
iixMarket Algorithms seminar, Google, NYC Jul 2017
iixAlgorithmic Game Theory and Data Science workshop, Cambridge, MA Jun 2017
iixMarketplace Innovation Workshop, Stanford, CA Jun 2017
Facilitating the search for partners on matching platforms: restricting agent actions
iixINFORMS Annual meeting, Houston, TX Oct 2017
iixINFORMS Applied Probability Society Conference, Northwestern U Jul 2017
iixMSOM Conference, UNC Chapel Hill Jun 2017
iixChicago Booth Operations Workshop May 2017
iixMarket Design workshop, Columbia University Mar 2017
iixDRO Brown bag lunch, Columbia Business School Mar 2017
iixMIT ORC seminar Feb 2017
iixNetworks, Matching, and Platforms workshop, Denver, CO Jan 2017
iixOperations Management Seminar, USC Marshall School of Business Oct 2016
Communication Requirements and Informative Signaling in Matching Markets
iixINFORMS Applied Probability Society Conference, Northwestern U Jul 2017
iixRutgers/DIMACS theory seminar Feb 2017
iixINFORMS Annual Meeting, Nashville, TN Nov 2016
Matching while Learning
iixINFORMS Revenue Management conference Jun 2016
iixDRO Brown bag lunch, Columbia Business School Mar 2016
iixStatistics student seminar, Columbia University Mar 2016
Competition and choice in matching markets
iixOR seminar, Stanford Graduate School of Business Nov 2015
Matching markets: structure, dynamics and design (survey)
iixEconCS survey seminar, Simons Institute, UC Berkeley Oct 2015
Unbalanced random matching markets
iixWorkshop on Graphical Models, Statistical Inference, & Algorithms, IMA, Minnesota May 2015
iixCS seminar, IIT Kharagpur, India Jan 2015
iixOM seminar, Rotman School of Management Oct 2014
iixCS-Econ seminar, Duke University Oct 2014
iixCS Theory seminar, Columbia University Sep 2014
iixOM seminar, NYU Stern School of Business Sep 2014
iixNYC Market design workshop, Columbia University Dec 2013
iixGoogle Algorithms seminar, Google, New York Nov 2013
iixIIT Bombay, Mumbai, India Aug 2013
iixTata Institute of Fundamental Research, Mumbai, India Jul 2013
iixStochastics and Applications seminar, MIT Apr 2013
iixMicrosoft Research Theory Group Seminar, Redmond, WA Mar 2013
Dynamic Matching in School Choice: Efficient Seat Reallocation After Late Cancella-tions
iixINFORMS Annual meeting, Philadelphia, PA Nov 2015
Managing congestion in dynamic matching markets
iixColumbia Business School Alumni Club of the Bay Area, San Francisco Sep 2015
iixEconometric Society World Congress, Montreal, Canada Aug 2015
iixTata Institute of Fundamental Research, Mumbai, India Jul 2015
iixINFORMS Applied Probability Society Conference, Istanbul, Turkey Jul 2015
iixNYCE (NY Computer Science and Economics) Day Dec 2014
iixTheory seminar, USC Economics Nov 2014
iixBray Theory Workshop, Caltech HSS Nov 2014
Efficient dynamic barter exchange
iixMarket design seminar, Stanford Economics Dec 2015
iixMSOM Conference, U Washington, Seattle Jun 2014
iixColumbia Statistics student seminar Nov 2013
iixProbability seminar, University of Chicago Nov 2013
iixINFORMS Annual Meeting Oct 2013
iixWorkshop on Asymptotics of Large Scale Networks, BIRS, Banff, Canada Mar 2013
An internet experiment on bargaining
iixINFORMS Annual meeting, Phoenix, AZ Oct 2012
iixWorkshop on Computational & Applied Social Science, New York Oct 2012
iixPOMS Annual conference Apr 2012
The set of solutions of random XORSAT formulae
iixProbability seminar, Brown University Feb 2013
iixStanford probability seminar Oct 2012
iixMIT probability seminar Sep 2012
Bargaining dynamics in exchange networks
iixECE seminar, UCSD Mar 2012
iixECE seminar, Cornell Mar 2012
iixEE seminar, UIUC Feb 2012
iixELE/Applied Math seminar, Princeton Feb 2012
iixORIE, Cornell Feb 2012
iixDRO seminar, Columbia GSB Jan 2012
iixMSR Redmond Jan 2012
iixMSR New England Jan 2012
iixOR seminar, MIT Sloan Jan 2012
iixNCD seminar, EECS, UC Berkeley Jan 2012
iixMicrosoft Research India Jan 2012
iixECE, University of Maryland Nov 2011
iixMarkets & Social Systems Engineering seminar, UPenn Nov 2011
iixINFORMS Annual meeting, Charlotte, NC Nov 2011
iixIEOR seminar, IIT Bombay, India Jan 2011
iixEcon-CS seminar, UC Berkeley Apr 2010
iixAlgorithms and Complexity seminar, MIT Mar 2010
iixCS Theory Lunch, Stanford Jan 2010
Distributed storage for intermittent energy sources
iixINFORMS Annual meeting, Phoenix, AZ Oct 2012
iixInformation, Decisions and Algorithms meeting, Stanford Oct 2011
iixAllerton conference, UIUC Sep 2011
Social learning and the dynamic cavity method
iixINFORMS Applied Probability Society meeting, Stockholm, Sweden Jul 2011
iixResearch on Algorithms for the Internet (RAIN) seminar, Stanford Feb 2011
iixWorkshop on Recent Trends in Social Networks, TIFR, Mumbai, India Jan 2011
iixTheory lunch, Microsoft Research Redmond, Redmond, WA Dec 2010
iixMicrosoft Research New England Colloquium, Cambridge, MA Nov 2010
Majority dynamics on trees and the dynamic cavity method
iixDept. of Electrical Engineering, IIT Bombay, India Jun 2009
iixTata Institute of Fundamental Research, Mumbai, India Jun 2008
iixWorkshop on Message Passing, Phase Transitions and Hard Combinatorial Jun 2008iixiixProblems, BIRS, Banff, Canada