Shlomo Zilberstein
Artificial Intelligence · 1996–2013
A researcher in the Science corpus: 11 papers; trusts 21 researchers and is trusted by 64 researchers here, as inferred from the citation graph.
Subfields
- Artificial Intelligence — 35 citations into it; #3,856 of 36,961 by trust here, #5,641 by citations
- Management Science and Operations Research — 19 citations into it; #2,119 of 12,201 by trust here, #2,826 by citations
- Reinforcement Learning — 19 citations into it; #561 of 2,250 by trust here, #665 by citations
- Computational Theory and Mathematics — 6 citations into it; #1,516 of 12,489 by trust here, #985 by citations
- Computer Networks and Communications — 5 citations into it; #695 of 9,996 by trust here, #761 by citations
Whom Shlomo Zilberstein trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Eric Horvitz
- Sven Seuken
- Daniel S. Bernstein
- Eric A. Hansen
- Richard S. Sutton
- Nils J. Nilsson
- Leonid Peshkin
- Muthu Dayalan
- Jilles Steeve Dibangoye
- Andrew Barto
Who trusts Shlomo Zilberstein overall
- Frans Adriaan Oliehoek
- Chris Amato
- Matthijs T. J. Spaan
- Manuel López-Ibáñez
- Blai Bonet
- Philip Bachman
- Feng Wu
- Jilles Steeve Dibangoye
- Sven Seuken
- Shayegan Omidshafiei
Papers from Shlomo Zilberstein's perspective
Ordered by how strongly the researchers Shlomo Zilberstein trusts endorse each paper. Same corpus, a different order for every researcher.
- Reinforcement Learning: An Introduction
- Markov Games as a Framework for Multi-Agent Reinforcement Learning
- Planning and Acting in Partially Observable Stochastic Domains
- Deep Residual Learning for Image Recognition (Computer Vision and Pattern Recognition)
- The Optimal Control of Partially Observable Markov Processes over a Finite Horizon
- Sequential Optimality and Coordination in Multiagent Systems
- ImageNet classification with deep convolutional neural networks
- Dynamic Programming for Partially Observable Stochastic Games
- Solving Transition Independent Decentralized Markov Decision Processes
- Learning to Cooperate via Policy Search
Their papers
- The Complexity of Decentralized Control of Markov Decision Processes (2000) — 1,758 citations
- Solving Transition Independent Decentralized Markov Decision Processes (2004) — 278 citations
- Improved Memory-Bounded Dynamic Programming for Decentralized POMDPs (2007) — 146 citations
- A new representation and associated algorithms for generalized planning (2011) — 101 citations
- LAO*: A heuristic search algorithm that finds solutions with loops (2001) — 510 citations
- Rollout Sampling Policy Iteration for Decentralized POMDPs (2010) — 29 citations
- Incremental Policy Generation for Finite-Horizon DEC-POMDPs (2009) — 81 citations
- Monte-Carlo Expectation Maximization for Decentralized POMDPs (2013) — 50 citations
- Memory-Bounded Dynamic Programming for DEC-POMDPs (2007) — 182 citations
- Dynamic Programming for Partially Observable Stochastic Games (2004) — 681 citations
- Using Anytime Algorithms in Intelligent Systems (1996)