Jennifer Tour Chayes is Distinguished Scientist and Managing Director of Microsoft Research New England in Cambridge, Massachusetts, which she co-founded in 2008, and Microsoft Research New York City, which she co-founded in 2012. Chayes was Research Area Manager for Mathematics, Theoretical Computer Science and Cryptography at Microsoft Research Redmond until 2008. Chayes joined Microsoft Research in 1997, when she co-founded the Theory Group. Her research areas include phase transitions in discrete mathematics and computer science, structural and dynamical properties of self-engineered networks, and algorithmic game theory. She is the co-author of about 125 scientific papers and the co-inventor of about 30 patents.
Chayes has many ties to the academic community. She was for many years Professor of Mathematics at UCLA. She serves on numerous institute boards, advisory committees and editorial boards, including the Turing Award Selection Committee of the Association for Computing Machinery, the Board of Trustees of the Mathematical Sciences Research Institute and the Institute for Computational and Experimental Research in Mathematics, the Advisory Boards of the Center for Discrete Mathematics and Computer Science, the Howard Hughes Medical Institute Janelia Farm Research Campus, and Women Entrepreneurs in Science and Technology. Chayes is a past Chair of the Mathematics Section of the American Association for the Advancement of Science, and a past Vice-President of the American Mathematical Society.
Chayes received her B.A. in biology and physics at Wesleyan University, where she graduated first in her class, and her Ph.D. in mathematical physics at Princeton. She did her postdoctoral work in the mathematics and physics departments at Harvard and Cornell. She is the recipient of a National Science Foundation Postdoctoral Fellowship, a Sloan Fellowship, and the UCLA Distinguished Teaching Award. Chayes has recently been the recipient of many leadership awards including the Leadership Award of Women Entrepreneurs in Science and Technology, the Leading Women Award of the Girl Scouts of Eastern Massachusetts, the Women to Watch Award of the Boston Business Journal, and the Women of Leadership Vision Award of the Anita Borg Institute. She has twice been a member of the Institute for Advanced Study in Princeton. Chayes is a Fellow of the American Association for the Advancement of Science the Fields Institute, the Association for Computing Machinery, the American Mathematical Society, and a National Associate of the National Academies.
Chayes is well known for her work on phase transitions, in particular for laying the foundation for the study of phase transitions in problems in discrete mathematics and theoretical computer science; this study is now giving rise to some of the fastest known algorithms for fundamental problems in combinatorial optimization. She is also one of the world's experts in the modeling and analysis of random, dynamically growing graphs, which are used to model the Internet, the World Wide Web and a host of other technological and social networks. Among Chayes' contributions to Microsoft technologies are the development of methods to analyze the structure and behavior of various networks, the design of auction algorithms, and the design and analysis of various business models for the online world.
Chayes lives with her husband, Christian Borgs, who also happens to be her principal scientific collaborator. In her spare time, she enjoys overworking.
Directed scale-free graphs (with B. Bollobas, C. Borgs and O. Riordan) Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 132-139 (2003). | |
Degree distribution of the FKP network model (with N. Berger, B. Bollobas, C. Borgs and O. Riordan) Proceedings of the 30th International Colloquium on Automata, Languages and Programming (ICALP), 725-738, Lecture Notes in Computer Science 2719 (2003). | |
Exploring the community structure of newsgroups (with C. Borgs, M. Mahdian and A. Saberi) Proceedings of the 10th ACM SIGKDD International Conference on Knowledge, Discovery and Data Mining (KKD), 783-787 (2004). | |
Newsgroup cluster data referred to in the above paper. | |
Competition-induced preferential attachment (with N. Berger, C. Borgs, R. D'Souza and R. D. Kleinberg) Proceedings of the 31st International Colloquium on Automata, Languages and Programming (ICALP), 208-221, Lecture Notes in Computer Science 3142 (2004) | |
Degree distribution of competition-induced preferential attachment graphs (with N. Berger, C. Borgs, R. D'Souza and R. D. Kleinberg) Combinatorics, Probability and Computing 14, 697-721 (2005). | |
Emergence of tempered preferential attachment from optimization (with N. Berger, C. Borgs, R. D'Souza and R. D. Kleinberg) Proceedings of the National Academy of Sciences (PNAS) 104, 6112-6117 (2007), cover article. | |
Fitting the WHOIS Internet data A short note with technical details left out in the above paper. | |
First to market is not Everything: An analysis of preferential attachment with fitness (with C. Borgs, C. Daskalakis and S.Roch) Proceedings of the 39th annual ACM Symposium on the Theory of Computing (STOC), 135-144 (2007). |
On the spread of viruses on the Internet (with N. Berger, C. Borgs and A. Saberi) Proceedings of the 16th ACM-SIAM Symposium on Discrete Algorithm (SODA), 301-310 (2005). | |
Local computation of pagerank contributions (with R. Andersen, C. Borgs, J. Hopcroft, V. Mirrokni and S. Teng) Proceedings of the 5th Workshop on Algorithms and Models for the Web Graph (WAW), 150-165 (2007). | |
Robust PageRank and locally computable spam detection features (with R. Andersen, C. Borgs, J. E. Hopcroft, K. Jain, V.S. Mirrokni and S.H. Teng) AIRWeb 2008, 69-76 (2008). | |
On the stability of web crawling and web search (with R. Andersen, C. Borgs, J. E. Hopcroft, V.S. Mirrokni and S.H. Teng) ISAAC 2008, 680-691 (2008). | |
How to distribute antidote to control epidemics (with C. Borgs, A. Ganesh, and A. Saberi) Random Struct. Algorithms 37, 204-222 (2010). | |
We know who you followed last summer: inferring social link creation times in twitter (with B. Meeder, B. Karrer, A. Sayedi, R. Ravi and C. Borgs) Proceedings of the 20th International World Wide Web Conference (WWW), 517-526 (2011). | |
A sublinear time algorithm for PageRank computations (with C. Borgs, M. Brautbar and S.-H. Teng) Proceedings of the 9th Workshop on Algorithms and Models for the Web Graph (WAW), 41-53 (2012). | |
The power of local information in social networks (with C. Borgs, M. Brautbar, S. Khanna, B. Lucier) Proceedings of the 8th International Workshop on Internet and Network Economics (WINE), 406 - 419 (2012). | |
Finding endogenously formed communities (with M.-F. Balcan, M. Braverman, C. Borgs and S.-H. Teng) 24th Annual ACM-SIAM Symposium on Discrete Algorithm (SODA), 767-783 (2013). | |
Multi-Scale Matrix Sampling and Sublinear-Time PageRank (with C. Borgs, M. Brautbar and S.-H. Teng) Preprint (2013), to appear in Internet Mathematics http://dx.doi.org/10.1080/15427951.2013.802752 (2013). | |
Maximizing social influence in nearly optimal time (with C. Borgs, M. Brautbar and B. Lucier) Proceedings of the 25nd Annual ACM-SIAM Symposium on Discrete Algorithm (SODA), 946-957 (2014). |
Multi-unit auctions with budget-constrained bidders (with C. Borgs, N. Immorlica, M. Mahdian and A. Saberi) Proceedings of the 6th ACM Conference on Electronic Commerce (EC), 44-51 (2005). |
Bid optimization in online advertisement auctions (with C. Borgs, O. Etesami, N. Immorlica and M. Mahdian) 2^{nd} Workshop on Sponsored Search Auctions (2006) and Proceedings of the 16th international conference on World Wide Web (WWW), 531-540 (2007). | |
The myth of the folk theorem (with C. Borgs, N. Immorlica, A. Kalai, V. Mirrokni and C. Papadimitriou) Proceedings of the 40th Annual ACM Symposium on the Theory of Computing (STOC) (2008). | |
Trust-based recommendation systems: An axiomatic approach (with R. Andersen, C. Borgs, U.Feige, A. Flaxman, A. Kalai, V. Mirrokni and M. Tennenholtz) Proceedings of the 17th international conference on World Wide Web (WWW), 199-208 (2008). | |
A novel approach to propagating distrust (with C. Borgs, A. Kalai, A. Malekiany, M. Tennenholtz) Proceedings of the 6th International Workshop on Internet and Network Economics (WINE) 87-105 (2010). | |
Game-theoretic models of information overload in social networks (with C. Borgs, B. Karrer, B. Meeder, R. Ravi, R. Reagans and A. Sayedi) Proceedings of the 7th Workshop on Algorithms and Models for the Web Graph (WAW) 146-161 (2010). | |
Fast convergence of natural bargaining dynamics in exchange networks (with Y. Kanoria, M. Bayati, C. Borgs and A. Montanari) Proceedings of the 22nd ACM-SIAM Symposium on Discrete Algorithm (SODA) 1518-1537 (2011). | |
The hitchhiker's guide to affiliation networks: A game-theoretic approach (with C. Borgs, J. Ding and B. Lucier) Proceedings of the 2nd Symposium on Innovations in Computer Science (ICS) 389-400 (2011). | |
Pricing and queuing (with C. Borgs, S. Doroudi, M. Harchol-Balter, K. Xu) ACM SIGMETRICS Performance Evaluation Review 40(3): 71-73 (2012). | |
Optimal multi-period pricing with service guarantees (with O. Candogan, C. Borgs, I. Lobel, and H. Nazerzadeh) to appear in Management Science http://dx.doi.org/10.1287/mnsc.2013.1839 (2013). | |
Priority pricing in queues with a continuous distribution of customer valuations (S. Doroudi, M. Akan, M. Harchol-Balter, J. Karp, C. Borgs, J.T. Chayes) Preprint 2013 | |
The optimal admission threshold in observable queues with state dependent pricing (with C. Borgs, S. Doroudi, M. Harchol-Balter, K. Xu) Probability in the Engineering and Informational Sciences 28, 101-110 (2014). | |
Bargaining dynamics in exchange networks (with M. Bayati, C. Borgs, Y. Kanoria and A. Montanari) to appear in J. Econ. Theory, http://dx.doi.org/10.1016/j.jet.2014.02.007 (2014). |