Christian Borgs is a professor of Computer Science in the EECS department at the University of California, Berkeley, a member of the Berkeley Artificial Intelligence Research (BAIR) Lab, and director of the Bakar Institute of Digital Materials for the Planet (BIDMaP).
He graduated in Physics at the University of Munich, and holds a Ph.D. in Mathematical Physics from the the University of Munich and the Max-Planck-Institute for Physics, as well as a Habilitation in Mathematical Physics from the Free University in Berlin. He was the C4 chair of Statistical Mechanics at the University of Leipzig, before joining Microsoft Reseach in 1997 to co-found the Theory Group. He was manager of the Theory Group until 2008, when he co-founded Microsoft Research New England in Cambridge, Massachusetts, a lab that brings together traditional CS and statistics research with economics as well as qualitative social science research. Borgs was Deputy Managing Director of this lab from 2008 until he left Microsoft for Berkeley in 2020.
Among the honors he has received are the Karl-Scheel Prize of the German Physical Society, and the Heisenberg Fellowship of the German Research Council. Borgs has twice been a member of the Institute for Advanced Study in Princeton. He is a a Fellow of the American Mathematical Society, and the Association of the Advancement of Science. He served or serves on several editorial boards, prize committees, and governing boards, including the Board of Trustees of the Institute for Pure and Applied Mathematics (IPAM), the Governing Board of the Institute for Mathematics and its Applications (IMA) where he was chair from 2017 until 2019, the Adivosry Board of the Harvard Insitute for Applied Computer Science (IACS) and the External Advisory Board for Computing at NYU.
Christian Borgs has authored almost 140 research papers and is named as coinventor of over 30 patents. His current research focuses on the science of networks, including mathematical foundations, particularly the theory of graph limits (which he co-invented about 15 years ago), graph processes, graph algorithms, and applications of graph theory from economics to systems biology. Borgs is also well known for his earlier work on mathematical statistical physics, including the theory of first-order phase transitions and finite-size effects. He was one of the first to apply methods from mathematical statistical physics to problems in theoretical computer science, including phase transitions in combinatorial optimization, and the study of Markov chains. He has recently begun to work on aspects of responsible AI, from differential privacy to questions of bias in automatic decision making.
Christian Borgs is married to Jennifer Chayes, who also works at Bekeley, and with whom he collaborates on most of his scientific work. In his spare time, he enjoys art, theatre and classical music, as well as skiing and swimming.
Multi-unit auctions with budget-constrained bidders (with J. T. Chayes, 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 J. T. Chayes, 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 J. T. Chayes, N. Immorlica, A. Kalai, V. Mirrokni and C. Papadimitriou). Proceedings of the 40st Annual ACM Symposium on the Theory of Computing (STOC), 365-372 (2008). | |
Trust-based recommendation systems: An axiomatic approach (with R. Andersen, J. T. Chayes, 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 J. T. Chayes, 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 J. T. Chayes, 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, J. T. Chayes, and A. Montanari). Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithm (SODA), 1518-1537 (2011). | |
The hitchhiker's guide to affiliation networks: A game-theoretic approach (with J. T. Chayes, J. Ding and B. Lucier). Proceedings of the 2nd Symposium on Innovations in Computer Science (ICS), 389-400 (2011). | |
Pricing and queuing (with J.T. Chayes, S. Doroudi, M. Harchol-Balter, K. Xu). ACM SIGMETRICS Performance Evaluation Review 40(3): 71-73 (2012). | |
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). CMU technical report CMU-CS-13-109 (2013). | |
The optimal admission threshold in observable queues with state dependent pricing (with J.T. Chayes, S. Doroudi, M. Harchol-Balter, K. Xu). Probability in the Engineering and Informational Sciences 28, 101-110 (2014). | |
Optimal multi-period pricing with service guarantees (with O. Candogan, J.T. Chayes, I. Lobel, and H. Nazerzadeh). Management Science 60, 1792-1811 (2014). | |
Bargaining dynamics in exchange networks (with M. Bayati, J.T. Chayes, Y. Kanoria and A. Montanari). J. Econ. Theory 156, 417-454 (2015) | |
An axiomatic approach to community detection (with C. Borgs, A. Marple, and S.-H. Teng). Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science (ITCS '16), 135-146 (2016). | |
Thy friend is my friend: iterative collaborative filtering for sparse matrix estimation (with J.T. Chayes, C.E. Lee, D.Shah). Advances in Neural Information Processing Systems (NIPS) 30, 4718–4729, (2017). | |
Iterative collaborative filtering for sparse matrix estimation (with J.T. Chayes, C.E. Lee, D.Shah). Operations Research published online “ahead of print”, https://doi.org/10.1287/opre.2021.2193 (2021).. |
Directed scale-free graphs (with B. Bollobas, J. T. Chayes 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, J. T. Chayes 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 J. T. Chayes, 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, J. T. Chayes, 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, J. T. Chayes, 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, J. T. Chayes, 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 J. T. Chayes, C. Daskalakis and S.Roch). Proceedings of the 39rd annual ACM Symposium on the Theory of Computing (STOC), 135-144 (2007). |