World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
55
Citations
13851
World Ranking
4269
National Ranking
2011

Research.com Recognitions

  • 2019 - AAAI Distinguished Service Award For his sustained and conscientious service and leadership both to AAAI as a councilor and conference committee chair, and to the broader AI community, as the president of ICAPS.
  • 2011 - Fellow of the Association for the Advancement of Artificial Intelligence (AAAI) For significant contributions to decision-theoretic reasoning, resource-bounded reasoning, automated planning, decentralized decision making and multiagent systems.

Overview

Shlomo Zilberstein is affiliated with the University of Massachusetts Amherst in the United States. Their research primarily spans the field of Computer Science, with a focus on Artificial Intelligence, which constitutes the majority of their work. Other subfields of study in their research portfolio include Management Science and Operations Research, Computer Vision and Pattern Recognition, Social Psychology, and Information Systems.

The scientist's work engages with several key topics within their fields of study. These include:

  • AI-based Problem Solving and Planning
  • Reinforcement Learning in Robotics
  • Adversarial Robustness in Machine Learning
  • Logic, Reasoning, and Knowledge
  • Human-Automation Interaction and Safety
  • Bayesian Modeling and Causal Inference
  • Robotic Path Planning Algorithms

Shlomo Zilberstein has published extensively, with a number of recent papers contributing to various areas of artificial intelligence research. Notable works include:

  • "A Survey of Opponent Modeling in Adversarial Domains", 2022, Journal of Artificial Intelligence Research
  • "Ethically Compliant Sequential Decision Making", 2021, Proceedings of the AAAI Conference on Artificial Intelligence
  • "Lagrangian Relaxation Techniques for Scalable Spatial Conservation Planning", 2021, Proceedings of the AAAI Conference on Artificial Intelligence
  • "Computing Applicability Conditions for Plans with Loops", 2021, Proceedings of the International Conference on Automated Planning and Scheduling
  • "Tuning the Hyperparameters of Anytime Planning: A Metareasoning Approach with Deep Reinforcement Learning", 2022, Proceedings of the International Conference on Automated Planning and Scheduling

The primary publication venues for this researcher reflect their focus and include:

  • arXiv (Cornell University)
  • Proceedings of the AAAI Conference on Artificial Intelligence
  • Journal of Artificial Intelligence Research
  • Proceedings of the International Conference on Automated Planning and Scheduling
  • Proceedings of the International Symposium on Combinatorial Search

Frequent collaborators in research with Shlomo Zilberstein include:

  • Justin Svegliato
  • Samer B. Nashed
  • Sandhya Saisubramanian
  • Saaduddin Mahmud
  • Connor Basich

Among the recognitions received, Shlomo Zilberstein was awarded the AAAI Distinguished Service Award in 2019 for their service and leadership within AAAI and the broader AI community. Additionally, they were named a Fellow of the Association for the Advancement of Artificial Intelligence in 2011, acknowledging their contributions in decision-theoretic reasoning, resource-bounded reasoning, automated planning, decentralized decision making, and multiagent systems.

Best Publications

  • The Complexity of Decentralized Control of Markov Decision Processes

    Daniel S. Bernstein;Robert Givan;Neil Immerman;Shlomo Zilberstein

  • Using anytime algorithms in intelligent systems

    Shlomo Zilberstein

  • LAO: a heuristic search algorithm that finds solutions with loops

    Eric A. Hansen;Shlomo Zilberstein

  • Dynamic programming for partially observable stochastic games

    Eric A. Hansen;Daniel S. Bernstein;Shlomo Zilberstein

  • Solving transition independent decentralized Markov decision processes

    Raphen Becker;Shlomo Zilberstein;Victor Lesser;Claudia V. Goldman

  • Decentralized control of cooperative systems: categorization and complexity analysis

    Claudia V. Goldman;Shlomo Zilberstein

  • The complexity of decentralized control of Markov decision processes

    Daniel S. Bernstein;Shlomo Zilberstein;Neil Immerman

  • Optimizing information exchange in cooperative multi-agent systems

    Claudia V. Goldman;Shlomo Zilberstein

  • Communication decisions in multi-agent cooperation: model and experiments

    Ping Xuan;Victor Lesser;Shlomo Zilberstein

  • Optimal composition of real-time systems

    Shlomo Zilberstein;Stuart Russell

  • Formal models and algorithms for decentralized decision making under uncertainty

    Sven Seuken;Shlomo Zilberstein

  • Operational rationality through compilation of anytime algorithms

    Shlomo Zilberstein

  • Composing real-time systems

    Stuart J. Russell;Shlomo Zilberstein

  • MAA*: a heuristic search algorithm for solving decentralized POMDPs

    Daniel Szer;François Charpillet;Shlomo Zilberstein

  • Bounded policy iteration for decentralized POMDPs

    Daniel S. Bernstein;Eric A. Hansen;Shlomo Zilberstein

  • Transition-independent decentralized markov decision processes

    Raphen Becker;Shlomo Zilberstein;Victor Lesser;Claudia V. Goldman

  • Memory-bounded dynamic programming for DEC-POMDPs

    Sven Seuken;Shlomo Zilberstein

  • Monitoring and control of anytime algorithms: a dynamic programming approach

    Eric A. Hansen;Shlomo Zilberstein

  • Anytime Sensing, Planning and Action: A Practical Model for Robot Control

    Shlomo Zilberstein;Stuart J. Russell

  • Approximate Reasoning Using Anytime Algorithms

    Shlomo Zilberstein;Stuart Russell

  • Optimizing fixed-size stochastic controllers for POMDPs and decentralized POMDPs

    Christopher Amato;Daniel S. Bernstein;Shlomo Zilberstein

Frequent Co-Authors

Neil Immerman
Neil Immerman University of Massachusetts Amherst
Victor Lesser
Victor Lesser University of Massachusetts Amherst
Donald L. Fisher
Donald L. Fisher University of Massachusetts Amherst
Roderic A. Grupen
Roderic A. Grupen University of Massachusetts Amherst
Allen R. Hanson
Allen R. Hanson University of Massachusetts Amherst
Marc Toussaint
Marc Toussaint Technical University of Berlin
Avigdor Gal
Avigdor Gal Technion – Israel Institute of Technology
Edward M. Riseman
Edward M. Riseman University of Massachusetts Amherst
Eric Horvitz
Eric Horvitz Microsoft (United States)
Hoong Chuin Lau
Hoong Chuin Lau Singapore Management University

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Studying Computer Science in the USA can open doors to a variety of advanced online degree options and career pathways. For professionals looking to step into management or leadership roles, an executive online mba can equip you with business and strategic skills that complement your tech background.

Those interested in data organization, information management, or digital archiving might consider the most affordable online mlis programs (Master of Library and Information Science). These programs blend technology and organization—key competencies in today’s digital workplace.

If affordability is a top concern, exploring the cheapest online masters degree options can help you gain advanced qualifications without significant financial strain. Many of these degrees allow you to specialize or broaden your skill set across technology and related fields.

Finally, for those aiming for top leadership and research roles, a phd in organizational leadership can position you for high-level positions in academia, business, or tech-driven organizations.

Best Scientists Citing Shlomo Zilberstein

Trending Scientists