This article was accepted into the corpus but its outbound wikilinks were never NER-processed — typical at the deepest BFS hop or when the run's entity cap was reached. No expansion funnel to show.
| Ehud Friedgut | |
|---|---|
| Name | Ehud Friedgut |
Ehud Friedgut is a scholar noted for contributions to computational social choice, algorithmic game theory, and combinatorial optimization. He has worked at academic institutions and research centers, publishing on topics that intersect computer science, economics, and applied mathematics. His work connects with communities around theoretical computer science, operations research, and decision theory.
Friedgut was born and raised in a context that connected him to Israeli academic institutions and the international research community in Israel. He completed undergraduate and graduate studies at universities affiliated with prominent departments such as Technion – Israel Institute of Technology, Hebrew University of Jerusalem, or institutions comparable in the region, where he encountered scholars from Tel Aviv University and collaborators with ties to Princeton University and Massachusetts Institute of Technology. His doctoral training included coursework and research influenced by faculty associated with Stanford University, Harvard University, and European centers like University of Cambridge and École Polytechnique. During his doctoral studies he engaged with topics linked to conferences such as STOC, FOCS, and SODA and learned from advisors and mentors connected to organizations like the Association for Computing Machinery and the Institute of Electrical and Electronics Engineers.
Friedgut held academic appointments and research positions spanning departments and institutes including computer science, applied mathematics, and economics. He has worked at universities that collaborate with labs such as Microsoft Research, Google Research, and institutes like the Weizmann Institute of Science and Bar-Ilan University. His career paths involved visiting positions and sabbaticals at centers including Institute for Advanced Study, Simons Institute for the Theory of Computing, and partnerships with industry research groups tied to IBM Research and Bell Labs. He participated in program committees for conferences such as ICML, NeurIPS, and AAAI and contributed to workshops sponsored by funding agencies like the European Research Council and National Science Foundation.
Friedgut’s research spans theoretical foundations and applied methods in areas related to voting theory, mechanism design, complexity theory, and probabilistic combinatorics. He produced work engaging with classical results influenced by scholars associated with John von Neumann, Kenneth Arrow, Amartya Sen, and modern researchers at Cornell University, University of California, Berkeley, and New York University. His publications address problems studied at venues including Journal of the ACM, SIAM Journal on Computing, and Annals of Applied Probability. Key themes include aggregation of preferences, approximation algorithms connected to Knapsack problem and Set Cover problem, and stability notions related to Nash equilibrium and Pareto efficiency. He also contributed to analytical techniques drawing on notions from Boolean function analysis, stochastic processes studied at Los Alamos National Laboratory, and spectral methods used at institutions like ETH Zurich.
Friedgut received recognition from professional societies and academic institutions. His honors include fellowships or awards connected to entities such as the Simons Foundation, prizes administered by the European Association for Theoretical Computer Science, and grants from the Israel Science Foundation. He was invited to give keynote or plenary talks at international meetings like COLT, ICALP, and WINE and received distinction in teaching or research award programs at departments akin to Weizmann Institute of Science and Technion – Israel Institute of Technology.
Representative publications by Friedgut have appeared in leading journals and conference proceedings. Titles and venues include contributions to Proceedings of the ACM Symposium on Theory of Computing, Proceedings of the IEEE Symposium on Foundations of Computer Science, and articles in Discrete Mathematics and Combinatorica. His work often appears alongside collaborators from Princeton University, University of Chicago, and Carnegie Mellon University, and engages with problems originally formulated by figures such as Alfred Aho and Donald Knuth.
In his teaching role, Friedgut supervised graduate students and postdoctoral researchers who later joined faculties at universities including Stanford University, Harvard University, Columbia University, and research labs at Microsoft Research and Google Research. He taught courses that align with curricula in departments of Computer Science and Mathematics at institutions comparable to Tel Aviv University, covering subjects relevant to competitive exams and seminars for conferences like STOC and SODA. His mentorship emphasized rigorous proof techniques, cross-disciplinary collaboration with scholars at Princeton University and ETH Zurich, and preparation for academic careers funded by bodies like the European Research Council.
Friedgut’s personal life reflects connections to academic networks across Israel, United States, and Europe, with ties to cultural and scientific institutions such as the Weizmann Institute of Science and the Institute for Advanced Study. His legacy includes a body of work that influenced subsequent research in computational social choice, algorithmic game theory, and probabilistic combinatorics, informing projects at centers like the Simons Institute for the Theory of Computing and shaping curricula at leading universities including Massachusetts Institute of Technology and University of Cambridge.