Find Academic Supervisors

Vahab MirrokniView profile

Adjunct Associate Professor

• E-commerce
• Market Algorithms
• Distributed Optimization
• +5 more

Vahab Mirrokni is a distinguished scientist and research director at Google Research (New York) , leading the market algorithms, graph mining, and large-scale optimization research groups . He also holds an adjunct associate professor appointment at the Courant Institute of Mathematical Sciences, New York University . Education: PhD in Computer Science, Massachusetts Institute of Technology, 2005 B.Sc. in Computer Engineering, Sharif University of Technology Research Interests: E-commerce and Market Algorithms Distributed Optimization Algorithmic Game Theory Computational Economics Approximation Algorithms Combinatorial Optimization Scientific Awards: Best Paper Award, ACM Conference on Electronic Commerce (EC), 2008 Best Student Paper Award, Symposium on Discrete Algorithms (SODA), 2005 Prior Academic Affiliations: Theory Group, Microsoft Research Theory of Computation Group, MIT CSAIL Strategic Planning and Optimization Group, Amazon.com Contact: mirrokni@google.com, mirrokni@gmail.com. Office: 212-565-8949. Address: 111 8th Ave, 4th floor, New York, NY 10011.

• Operations and Supply Chain Management
• Market Studies
• Assessment and Optimization in Management
• +4 more

Raga Gopalakrishnan is an Assistant Professor of Operations Management at the Smith School of Business, Queen's University. His research bridges game theory, optimization, and stochastic modeling to analyze strategic interactions in service systems and market environments. He holds a Ph.D. in Computer Science from the California Institute of Technology (2013), preceded by an M.S. (2010) and B.Tech. (2008) from Caltech and IIT Madras, respectively. Professional Experience: Postdoctoral appointments include the University of Colorado Boulder (2013–2015) and Cornell University (2017–2019), with visiting roles at USC Marshall School of Business and Cornell ORIE. Prior to academia, he worked at Conduent Labs India (formerly Xerox RCI) in algorithms and optimization. Research Interests: Focuses on strategic trade-offs in service systems, market dynamics, mathematical optimization, and stochastic models. Key areas include bilevel optimization, game theory applications, and algorithmic mechanisms for resource allocation. Publications: Recent work addresses strategic server behavior in queueing systems, profit optimization in ridesharing, and distributed resource allocation. His research spans operations management, transportation systems, and multi-agent systems. Grants & Advising: No specific grants or advisees listed in the provided materials. Labs/Teams: Engaged with interdisciplinary teams at Cornell, CU Boulder, and industry collaborations through Conduent Labs.

Jerzy KonorskiView profile

Associate Professor

• Network Security
• Trust and Reputation Systems
• Wireless Networks
• +3 more

Dr. Jerzy Konorski serves as an Associate Professor in the Department of Teleinformatics at the Faculty of Electronics, Telecommunications and Informatics, Gdańsk University of Technology. His research addresses critical security and reliability challenges in modern networked systems. His primary research domains include: Network Security Trust and Reputation Systems Wireless Networks Quality of Service (QoS) Management Blockchain Applications Multi-Agent Systems Recent publications (2020-2023) reveal a consistent focus on adversarial scenarios in distributed systems. Key themes encompass computational trust mechanisms under virtual anonymity, mitigation of traffic remapping and content poisoning attacks in wireless and information-centric networks, and game-theoretic defenses against QoS abuse. His work bridges theoretical modeling with practical algorithmic solutions for security vulnerabilities. As principal investigator for the OPUS-funded project Reputation and trust building in computer communication systems under virtual anonymity and blind service provider selection (2017-2020, agreement UMO-2016/21/B/ST6/03146), he led research on trust dynamics in service-oriented architectures where provider selection occurs without identity disclosure. This work established foundational models for closed-loop trustworthiness computation in anonymous multi-agent environments.

Alok K. VermaView profile

Professor

• Lean Manufacturing
• Engineering Education
• STEM Outreach
• +1 more

Alok K. Verma is the Powell Chair Professor and Head of the Department of Marine Engineering Technology at Texas A&M University. His research focuses on lean manufacturing, engineering education, and STEM outreach. He holds a Ph.D. in Mechanical Engineering from Old Dominion University and a B.S. in Aeronautical Engineering from IIT Kanpur. Verma has secured over $2.5M in grants for projects like MarineTech (NSF) and developed lean enterprise simulations for shipbuilding. He received the 2019 Humanitarian Award and 2018 Isadore Davis Award for educational leadership. His publications span aquaculture optimization, geotechnical engineering, and cybersecurity. Humanitarian Award (2019) Isadore Davis Award (2018) John R. Broderick Diversity Champion Award (2014) He leads initiatives in workforce development for the blue economy and marine mechatronics education.

Sharon GoldbergView profile

Associate Professor

• Network Security
• Cryptography
• Game Theory
• +4 more

Sharon Goldberg is an Associate Professor in the Computer Science Department at Boston University. Her research focuses on network security, combining theoretical tools such as cryptography, game theory, and algorithms with networking methodologies like measurement, modeling, and simulation to address practical challenges. She holds a Ph.D. from Princeton University (2009) and a B.A.Sc. from the University of Toronto (2003). Prior to academia, she worked at IBM, Cisco, Microsoft, Bell Canada, and Hydro One Networks, and contributed to FCC and IETF working groups. Her research interests span network security, cryptography, and distributed systems. Notable contributions include work on BGP security, DNSSEC, and blockchain protocols like Tumblebit. She has received prestigious awards, including the IETF/IRTF Applied Networking Research Prize (2014), NSF CAREER Award, and Sloan Research Fellowship (2014). Her recent publications emphasize zero-trust authentication, verifiable random functions (VRFs), and securing protocols such as RADIUS/UDP and NTP. Goldberg’s work addresses critical gaps in internet infrastructure security, advocating for practical solutions to real-world network vulnerabilities. Her publications reflect a blend of theoretical rigor and applied engineering, with a focus on standards like RFCs and industry-relevant protocols. Awards: IETF/IRTF Applied Networking Research Prize (2014), NSF CAREER Award, Sloan Research Fellowship (2014) Key Research Themes: Network Security, Cryptographic Protocols, Blockchain, Interdomain Routing Professional Experience: IBM, Cisco, Microsoft, Bell Canada, Hydro One Networks

Ho Fai PoView profile

Lecturer

• Statistical Physics
• Bayesian Inference
• Principled Machine Learning
• +7 more

Ho Fai Po is a Lecturer in Applied Mathematics at Aston University, affiliated with the School of Engineering and Technology within the College of Engineering and Physical Sciences. His research lies at the intersection of statistical physics, Bayesian inference, and machine learning, focusing on modeling complex biological and disordered systems. Research Interests: His work centers on applying theoretical frameworks from statistical physics to understand emergent behaviors in complex systems. Key areas include cortical neuronal networks, spin glasses, energy landscapes, and optimization problems. He employs principled machine learning and combinatorial optimization to infer structure and function from data, with applications in computational neuroscience and systems biology. Publication Trends: His recent publications span journals like PNAS Nexus , Scientific Reports , and Physical Review E , reflecting a strong focus on statistical mechanics applied to both biological and engineered systems. The articles demonstrate a consistent theme of using physics-inspired methods to solve inference and optimization challenges in networked systems. Collaborations and Research Output: He actively collaborates with researchers such as D. Saad and C. H. Yeung. His work includes six research articles and two publicly available datasets related to neuronal network analysis. These contributions highlight his role in advancing data-driven modeling of complex systems. Academic Background: Bachelor’s in Mathematics and Economics Master’s in Mathematics PhD in Statistical Physics Professional Experience: Research Associate in Mathematics, Aston University Lectureship in Data Analytics, University of the West of England (UWE) Lecturer in Applied Mathematics, Aston University (July 2025–present)

Yossi AzarView profile

Professor

• ON-LINE ALGORITHMS
• APPROXIMATION METHODS
• LOAD BALANCING
• +3 more

Prof. Yossi Azar is a faculty member at the Blavatnik School of Computer Science, Tel-Aviv University, where he holds the academic rank of Professor. He is actively involved in research and teaching in theoretical computer science, particularly in online algorithms, approximation methods, and algorithmic game theory. University: Tel-Aviv University School: Blavatnik School of Computer Science Academic Rank: Professor Email: azar@tau.ac.il His research focuses on ON-LINE ALGORITHMS, APPROXIMATION METHODS, LOAD BALANCING, ROUTING SCHEMES, PROBABILISTIC METHODS, and ALGORITHMIC GAME THEORY . He has made significant contributions to the design and analysis of algorithms for scheduling, routing, and resource allocation under uncertainty and competitive settings. The recent articles reflect a strong trend in theoretical computer science, particularly in online and approximation algorithms, algorithmic game theory, and network optimization. His work often involves competitive analysis, mechanism design, and performance guarantees in scheduling and routing problems. The research spans subfields such as load balancing, unsplittable flow, truthful mechanisms, and network design, with applications in distributed systems and communication networks. Prof. Azar has supervised numerous PhD and MSc students, including prominent researchers such as Leah Epstein and Oded Regev. He teaches advanced courses like Online and Approximation Algorithms and Algorithmic Methods , and has served on program committees of top conferences including SODA, STOC, FOCS, and ESA, often as chair. PhD Students: Leah Epstein, Oded Regev, Yossi Richter, Amir Epstein, Shai Gutner, Iftah Gamzu, Ilan Cohen, Adi Vardi, Danny Vainstein, Noam Touitou, Shahar Lewkowicz, Or Vardi MSc Students: Includes many of his PhD advisees and additional names such as Amitai Armon, Nir Avrahami, Arik Litichevskey, and others. He is an active participant in the academic community, serving as a journal editor for Algorithmica and organizing the Advanced Algorithms Seminar at Tel-Aviv University, which fosters collaboration and dissemination of cutting-edge research in algorithms.

Marco CogoniView profile

Researcher

• Data Science
• Optimization Problems
• Big Data
• +5 more

Marco Cogoni is a Researcher at the Center for Research, Development and Advanced Studies in Sardinia (CRS4) , where he works in the Distributed Computing Group . He holds a PhD in Physics from the University of Cagliari (2003) and completed postdoctoral research at the University of Cagliari, University of Milan Bicocca, and CNRS LML Lille. His research spans: Computational physics (spin glasses, semiconductor defects) Renewable energy systems (concentrated solar power) Materials science (proton diffusion in polymers, reactive water potentials) Data-intensive computing (optimization, big data analytics) He coordinates the EMINET project and contributes to H2UB, TDM, and XDATA initiatives. His 2025 publication explores network routing behaviors using game-theoretic approaches. Awards include: Regional Postgraduate Fellowship (University of Paris Sud, 2000)

Herbert HamersView profile

Professor

• Game Theory
• Operations Research
• Mathematics
• +2 more

Herbert Hamers is a Full Professor of Game Theory and Operations Research at the Department of Econometrics and Operations Research of Tilburg University . His expertise spans both pure and applied research in Game Theory and Operations Research , with additional interests in Mathematics , Statistics , and Health Care Management . Education : Mathematics degree from University of Nijmegen; PhD in Operations Research from Tilburg University His research focuses on: Cooperative game theory applied to operations research problems (sequencing games, Chinese postman games, traveling salesman games, assignment games, lot sizing games, spanning tree games) Practical applications of game theory in cost allocation, logistics, development economics, and transportation networks Optimization problems involving time-consuming function evaluations using simulation tools (FEM, CFD) Recent publications show trends in: Game-theoretic analysis of network structures Approximation methods for complex optimization problems Applications to agriculture, security, and economics He has developed three textbooks and taught mathematics and statistics courses while contributing to educational program design.

• Algorithmic Game Theory
• Theoretical Computer Science
• Network Optimization
• +3 more

Tim Roughgarden is a distinguished academic and ACM Fellow (2023) renowned for his foundational contributions to algorithmic game theory and network optimization . His groundbreaking work on selfish routing and the price of anarchy has bridged computer science, economics, and network theory, providing critical insights into decentralized systems like the Internet. He received the ACM Grace Murray Hopper Award (2009) for his research connecting strategic behavior to network protocol design and the ACM Doctoral Dissertation Award (2002) for his thesis at Cornell University. Research Interests : Algorithmic game theory, network congestion modeling, incentive-aware protocol design, theoretical computer science Impact : His work enables provably efficient distributed systems by addressing how strategic users affect network performance. Awards : ACM Fellow (2023) ACM Grace Murray Hopper Award (2009) ACM Doctoral Dissertation Award (2002)

Éva TardosView profile

Professor

• Algorithmic Game Theory
• Algorithm Design
• Applied Mathematics
• +3 more

Éva Tardos is the Jacob Gould Schurman Professor at Cornell University, affiliated with the Department of Mathematics and multiple colleges including the Cornell Ann S. Bowers College of Computing and Information Science, College of Arts and Sciences, and College of Engineering. Her research focuses on algorithm design, particularly in algorithmic game theory, networks, and combinatorial optimization. She explores mechanisms for selfish users, network efficiency, and distributed systems. Her work bridges theoretical computer science and economics, addressing challenges like congestion games, mechanism design, and social network influence. Key contributions include analyzing selfish routing's inefficiency, bounding equilibrium inefficiencies, and designing approximation algorithms for facility location and network design problems. Tardos collaborates extensively with top researchers in computer science and mathematics, contributing foundational insights into modern algorithmic theory. Research interests include algorithmic game theory , network optimization , mechanism design , and approximation algorithms . Recent publications emphasize social network dynamics, collusion effects in congestion games, and fair resource allocation strategies. Her work has practical applications in traffic routing, telecommunications, and distributed computing systems. While no specific awards are listed, her sustained contributions to theoretical computer science have established her as a leading figure in the field. Advising and mentoring are integral to her role, though specific advisee names are not documented here. She is actively involved in Cornell’s academic and research initiatives across multiple interdisciplinary domains.

• Computer Science
• Machine Learning
• Operations Research
• +5 more

Sam O'Neill is a Lecturer in Computer Science at the College of Science and Engineering. His academic work focuses on applied computational methods across engineering and industrial domains, with strong affiliations to computer science and interdisciplinary research teams. Research interests span: Machine Learning & AI : Development of microservice frameworks for biomedical research and reinforcement learning systems Industrial & Nuclear Engineering : Modular reactor design, off-site construction optimization, and plant layout Operations Research : Network flow modeling, traffic equilibrium, and MILP applications Applied Mathematics : Algorithm design and sequence analysis Publication analysis reveals three primary thematic clusters: Recent focus (2021-2024) on modular nuclear systems and machine learning microservices Sustained work in optimization techniques (MILP formulations, network flows) Foundational research in algorithmic learning theory and mathematical sequences

Philip BrownView profile

Associate Professor

• Game Theory
• Multi-Agent Systems
• Cyber-Physical Systems
• +9 more

Philip Brown is an Associate Professor in the Department of Computer Science at the University of Colorado at Colorado Springs. He received his PhD in Electrical and Computer Engineering from the University of California, Santa Barbara in 2018 under the supervision of Jason R. Marden. His research focuses on the intersection of technology and society, utilizing game theory, optimization, and multiagent systems to study incentive mechanisms, cybersecurity, and smart infrastructure. Current Projects: CAREER: Endogenous Information Design for smart transportation networks AFOSR YIP: Robust multiagent coordination with randomized algorithms Deriving satellite maneuver intent via game theory Past Projects: Socially Networked Autonomy: Autonomous vehicle routing COVID-19 Policy Optimization: Localized decision frameworks Value-Based Access Control: Path security mechanisms Dynamic Aviation Routing: Weather-aware path selection Research Areas: Dr. Brown's work spans game theory applications in cyber-social systems, robust network games, and strategic security modeling. He explores how financial/informational incentives shape crowd behavior in smart cities, cybersecurity vulnerabilities from mis-modeled attackers, and the paradoxes of altruism in transportation networks. Publication Trends: His recent articles focus on endogenous Bayesian games for information design, altruism dynamics in congestion games, security modeling for autonomous systems, and pandemic policy analysis. Key subfields include network robustness, incentive mechanisms, and human-machine interaction in infrastructure systems. Scientific Awards: NSF CAREER award (2025) UCCS Outstanding Teacher Award (2024) AFOSR Young Investigator Award (2022) CCDC Best PhD Thesis Award (2018) Best Paper awards at EAI GameNets, IEEE conferences Advising: Dr. Brown has advised 2 PhD graduates (Joshua Seaton & Brandon Collins) and multiple Master's/undergraduate researchers. His lab (DeSCon) investigates decision-making mathematics in infrastructure, epidemiology, and multiagent systems.