560 citations · 2k across the 22 of their papers we have counts for
5 papers · 1 filter
Approximate Planning for Factored POMDPs using Belief State Simplification
David A. McAllester, Satinder Singh
We are interested in the problem of planning for factored POMDPs. Building on the recent results of Kearns, Mansour and Ng, we provide a planning algorithm for factored POMDPs that…
On the Complexity of Policy Iteration
Yishay Mansour, Satinder Singh
Decision-making problems in uncertain or stochastic domains are often formulated as Markov decision processes (MDPs). Policy iteration (PI) is a popular algorithm for searching ove…
Nash Convergence of Gradient Dynamics in Iterated General-Sum Games
Satinder Singh, Michael Kearns, Yishay Mansour
Multi-agent games are becoming an increasing prevalent formalism for the study of electronic commerce and auctions. The speed at which transactions can take place and the growing c…
Fast Planning in Stochastic Games
Michael Kearns, Yishay Mansour, Satinder Singh
Stochastic games generalize Markov decision processes (MDPs) to a multiagent setting by allowing the state transitions to depend jointly on all player actions, and having rewards d…
Graphical Models for Game Theory
Michael Kearns, Michael L. Littman, Satinder Singh
In this work, we introduce graphical modelsfor multi-player game theory, and give powerful algorithms for computing their Nash equilibria in certain cases. An n-player game is give…