Yash Kanoria

Updated 10/24/2016

Employment Assistant Professor, Decision, Risk and Operations Division, Since July 2013
Graduate School of Business, Columbia University, New York, NY.

Schramm postdoctoral fellow Aug 2012 - June 2013
Microsoft Research New England, Cambridge, MA.

Contact Uris Hall Phone: (650) 353-0476
Columbia University ykanoria@columbia.edu
New York, NY 10027 http://www.columbia.edu/~yk2577

Education Stanford University, Stanford, CA (GPA 4.14) Sep 2007 - Aug 2012
iixPhD in Electrical Engineering
iixAdviser: Andrea Montanari
iixThesis title: Learning in social and economic networks

Indian Institute of Technology Bombay, India (CPI 10.00/10.00) Jul 2003 - May 2007
iixBachelor of Technology in Electrical Engineering

Research Matching markets, design and operation of marketplaces and platforms
Distinctions 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 2008
Examination 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 R. Anderson, I. Ashlagi, Y. Kanoria and D. Gamarnik, “Efficient dynamic barter exchange,” Imme-
diate revision at Operations Research.

I. Ashlagi, Y. Kanoria and J. Leshno, “Unbalanced random matching markets: the stark effect of
competition,” to appear in the Journal of Political Economy.

M. Bayati, C. Borgs, J. Chayes, Y. Kanoria, and A. Montanari, “Bargaining dynamics in exchange
networks,” 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 XORSAT
Formulae,” 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,” Annals
of 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.

Kanoria and H. “Unbalanced random matching markets.” Major Revision at Operations Research. Nazerzadeh. Saban and J. Y. N.” Annual Allerton Conf. M. Kanoria. I. Y. Kanoria. Kanoria and J. Y. Johari and Y. on Discrete Algorithms (SODA). April 2013. “Robust max-product belief propaga- tion. Kanoria and A. D. and Y. Johari and Y. 2011. I. Kanoria and H. on Decision and Control and European Control Conf. “Dynamic Reserves For Repeated Auctions: Learning from Bids. Working papers Y. Y. Kanoria. Arnosti. Tamuz. A. R. on Communication. Irene Lo and Jay Sethuraman. Braverman. “Tractable Bayesian Social Learning.” Major Revision at Operations Research. “Dynamic Matching in School Choice: Efficient Seat Reallocation After Late Cancellations.” Asilomar Conference on Signals.” IEEE Intl. on Discrete Algorithms (SODA). 2015. Kanoria. (CDC-ECC). Y. Leshno. Kanoria and P. Kraning and A. A. Ashlagi. Ibrahimi.” ACM-SIAM Symp. M. “The size of the core in random assignment markets. 2012. N. 2014. 2013.) Itai Feigenbaum. Y. No. Papers Y. Kanoria and O. 31. Montanari.” in preparation. “Communication Requirements and Informative Signaling in Matching Markets. Ashlagi. D. M. 2014. R. Y. Systems and Computers. Nazerzadeh. “Tractable Bayesian Social Learning on Trees. Saban.” ACM Conference on Economics and Computation (EC). Ibrahimi. R. 2012. Refereed Y. Vol. D.” IEEE Conf. Arnosti.” conference ACM-SIAM Symp. Symposium on Information Theory (ISIT). “Matching while Learning. Y. V. Tamuz. Johari. Kanoria. Montanari. .” in preparation. “Dynamic Reserves For Repeated Auctions: Learning from Bids. Control and Computing. “The paradox of choice in matching: How can platforms facilitate the search for partners?” in preparation.” in preparation. Montanari. 2011 (Invited). Kanoria and A. D.” (Resulting from a Major Revision at Management Science for a previous related submission.” Workshop on Internet and Network Economics (WINE). Kamble. Kanoria. Shi. Y. Javanmard. “Distributed Storage for Intermittent Energy Sources: Control Design and Performance Limits. Kanoria. 756-765. “The Set of Solutions of Random XORSAT Formulae. Yash Kanoria. Saban and J. 2011. Kanoria and D. “The size of the core in random assignment markets. M.” IEEE Journal on Selected Areas in Communication. pp. “Frictions in Two-Sided Markets: Equilibrium. Efficiency. “Subexponential convergence for information aggregation on regular trees. Sethuraman. Y.” ACM Conference on Economics and Computation (EC). Montanari. Kanoria and O. Tse and B. Zhang. Sethuraman. and Revenue. 4. “Managing search in decentralized matching markets.

Internet Mathematics. Eco- nomic Theory.” IEEE Intl. Operations Research. Symposium on Information Theory (ISIT). Annals of Applied Probability. “On the deletion channel with small deletion probability. Performance. 2007. Y. ACM-SIAM Symp. on Discrete Algorithms. IEEE Trans. “Fast Convergence of Natural Bargaining Dynamics in Exchange Networks. J. 2011. Symp. IEEE Conf.” IEEE Intl. India & New York. Radhakrishnan. Borgs. Kanoria. and Intl. on Communications. Workshop on Internet and Network Economics. Stochas- tic Systems. Y. Kanoria. Student Paper Award. Conf. Fall 2015. Service Meritorious Service Award. Reviewer for Management Science.E. Mathematics of Operations Research. on Information Theory. 2015.” ACM-SIAM Symp. Shaw & Co. Symp. 2010. Random Structures and Algorithms. “A FPTAS for Bargaining Networks with Unequal Bargaining Powers. Cambridge. on Theory of Computing. Y. Operations Research. 2008. Symp. MA Summer 2010. Y.” ACM-SIAM Symposium on Discrete Algorithms (SODA). Montanari. Kanoria. C. on VLSI design. 2010. Games. ACM Transactions on Algorithms. on Automatic Control. Organizer of “Learning and market design” seminar series at Simons Institute. 2010. as part of Economics and Computation program. Manjunath and J. S. IEEE Trans. as part of Economics and Computation program. 2011 Experience iixWorked on bargaining in networks (2010) iixWorked on social learning and social targeting of online advertisements (2011) D. at Simons Institute. Kanoria. Mitra and A. CA Summer 2008 iixWorked with high speed trades group on P&L attribution Goldman Sachs Group. Bangalore. IEEE Trans. on Computers and IEEE Trans. on Information Theory. “A Tight Lower Bound for Parity in Noisy Communication Networks. Kanoria and D. “Statistical Static Timing analysis using Markov chain Monte Carlo. ACM Symp. ACM-SIAM Symp. 2016. M. and ACM Con- ference on Economics and Computation. on Decision and Control. IEEE Intl. C. . on Algorithmic Game Theory. Probability Theory and Related Fields. Y. Kanoria and A. SIAM Journal on Discrete Mathematics. Program Committee member for the World Wide Web conference (WWW). Electronic Journal of Probability. Bayati. Operations Research. Cupertino. Chayes and A. Automatica. Workshop on Algorithms and Computation. Inc. D. Industry Microsoft Research New England. Montanari. Intl. Manjunath.” Design. Organizer of “Reverse Field Trip” involving speakers from local companies on Nov 9. “On Distributed Computation in Noisy Random Planar Networks. on Information Theory (ISIT). 2013. Information Theory Workshop. Montanari.” Workshop on Internet and Network Economics (WINE). on Discrete Algorithms (SODA). NY Summer 2007 iixWorked on a model for limit order execution times Professional Associate Editor (since Aug 2016).. Information. 2013. on Economics and Computation. Y. and Networks area. Dutta. Automation and Test in Europe (DATE).

Minnesota May 2015 iixCS seminar. New York Nov 2013 iixIIT Bombay. Mumbai. Montreal. India Jul 2015 iixINFORMS Applied Probability Society Conference. Jerome A. Implemented successfully in summer 2015. Statistical Inference. Member of the Technical committee. San Francisco Sep 2015 iixEconometric Society World Congress. and with further improvements suggested by me in 2016. Columbia Business School. Fall 2013 and Fall 2014. Canada Aug 2015 iixTata Institute of Fundamental Research. Columbia University Dec 2013 iixGoogle Algorithms seminar.Teaching Computing for Business Research. Stanford Graduate School of Business Nov 2015 Matching markets: structure. India Jul 2013 iixStochastics and Applications seminar. National Institutes of Technology etc. UC Berkeley Oct 2015 Managing congestion in dynamic matching markets iixColumbia Business School Alumni Club of the Bay Area. Columbia University Mar 2016 Competition and choice in matching markets iixOR seminar. IMA. responsible for the mechanism and algorithm for joint seat alloca- tion/admissions for over 30. India Jan 2015 iixOM seminar. IIT Kharagpur. Google. Spring 2015.000 seats at 88 centrally funded engineering colleges in India including the Indian Institutes of Technology. NYU Stern School of Business Sep 2014 iixNYC Market design workshop. & Algorithms. Chazen Institute of International Business grant entitled “Central- ized seat allocation for engineering colleges in India. Columbia Business School. Business Analytics. India Aug 2013 iixTata Institute of Fundamental Research. USC Marshall School of Business Oct 2016 Multiarmed bandits with capacity constraints iixINFORMS Revenue Management conference Jun 2016 iixDRO Brown bag lunch. Outside activities Successfully proposed new method for seat allocation in engineering colleges in India. Caltech HSS Nov 2014 Unbalanced random matching markets iixWorkshop on Graphical Models.” Amount of $10. Columbia University Sep 2014 iixOM seminar. Mumbai. MIT Apr 2013 iixMicrosoft Research Theory Group Seminar. Rotman School of Management Oct 2014 iixCS-Econ seminar. Mumbai. Invited Talks The paradox of choice in matching: How can platforms facilitate the search for part- ners? iixOperations Management Seminar. Grants Principal Investigator. Turkey Jul 2015 iixNYCE (NY Computer Science and Economics) Day Dec 2014 iixTheory seminar. WA Mar 2013 . USC Economics Nov 2014 iixBray Theory Workshop. dynamics and design (survey) iixEconCS survey seminar. Redmond. Columbia Business School Mar 2016 iixStatistics student seminar. Simons Institute. Duke University Oct 2014 iixCS Theory seminar. Istanbul.000 from the Chazen Global Research fund.

Redmond. Cornell Mar 2012 iixEE seminar. MIT Mar 2010 iixCS Theory Lunch. UC Berkeley Apr 2010 iixAlgorithms and Complexity seminar. India Jan 2011 iixTheory lunch. NC Nov 2011 iixIEOR seminar. India Jan 2011 iixEcon-CS seminar. UPenn Nov 2011 iixINFORMS Annual meeting. UCSD Mar 2012 iixECE seminar. Mumbai. Charlotte. MIT Sloan Jan 2012 iixNCD seminar. IIT Bombay. Phoenix. Brown University Feb 2013 iixStanford probability seminar Oct 2012 iixMIT probability seminar Sep 2012 Bargaining dynamics in exchange networks iixECE seminar. New York Oct 2012 iixPOMS Annual conference April 2012 The set of solutions of random XORSAT formulae iixProbability seminar. EECS. Princeton Feb 2012 iixORIE. UC Berkeley Jan 2012 iixMicrosoft Research India Jan 2012 iixECE. Banff. Columbia GSB Jan 2012 iixMSR Redmond Jan 2012 iixMSR New England Jan 2012 iixOR seminar. WA Dec 2010 iixMicrosoft Research New England Colloquium. Decisions and Algorithms meeting. Stanford Oct 2011 iixAllerton conference. U Washington. Microsoft Research Redmond. Stanford Feb 2011 iixWorkshop on Recent Trends in Social Networks. Seattle Jun 2014 iixColumbia Statistics student seminar Nov 2013 iixProbability seminar. UIUC Sep 2011 Social learning and the dynamic cavity method iixINFORMS Applied Probability Society meeting. Sweden Jul 2011 iixResearch on Algorithms for the Internet (RAIN) seminar. Canada Mar 2013 An internet experiment on bargaining iixINFORMS Annual meeting. MA Nov 2010 . TIFR. University of Maryland Nov 2011 iixMarkets & Social Systems Engineering seminar. AZ Oct 2012 iixInformation. Stanford Jan 2010 Distributed storage for intermittent energy sources iixINFORMS Annual meeting. University of Chicago Nov 2013 iixINFORMS Annual Meeting Oct 2013 iixWorkshop on Asymptotics of Large Scale Networks. Phoenix. Stanford Economics Dec 2015 iixMSOM Conference. Cambridge. BIRS. Cornell Feb 2012 iixDRO seminar.Efficient dynamic barter exchange iixMarket design seminar. Stockholm. AZ Oct 2012 iixWorkshop on Computational & Applied Social Science. UIUC Feb 2012 iixELE/Applied Math seminar.

of Electrical Engineering. Banff. India Jun 2009 iixTata Institute of Fundamental Research. IIT Bombay. Mumbai. Phase Transitions and Hard Combinatorial Jun 2008 iixiixProblems.Majority dynamics on trees and the dynamic cavity method iixDept. Canada . BIRS. India Jun 2008 iixWorkshop on Message Passing.