Shlomo Zilberstein | |
|---|---|
 Shlomo Zilberstein | |
| Born | 1960 (age 63–64) Tel Aviv, Israel |
| Alma mater | |
| Known for | Anytime Algorithms Decentralized Partially Observable Markov Decision Processes |
| Scientific career | |
| Fields | |
| Institutions | University of Massachusetts, Amherst |
| Thesis | Operational Rationality Through Compilation of Anytime Algorithms (1993) |
| Doctoral advisor | Stuart J. Russell |
| Website | www |
Shlomo Zilberstein (Hebrew: שלמה זילברשטיין; born 1960) is an Israeli-American computer scientist. He is a Professor of Computer Science and Associate Dean for Research and Engagement in the College of Information and Computer Sciences at the University of Massachusetts, Amherst.[1] He graduated with a B.A. in Computer Science summa cum laude from Technion – Israel Institute of Technology in 1982, and received a Ph.D. in Computer Science from University of California at Berkeley in 1993, advised by Stuart J. Russell.[2][3] He is known for his contributions to artificial intelligence, anytime algorithms, multi-agent systems, and automated planning and scheduling algorithms, notably within the context of Markov decision processes (MDPs), Partially Observable MDPs (POMDPs), and Decentralized POMDPs (Dec-POMDPs).