@conference {1508852,
	title = {SPIDER attack on a network of POMDPs: Towards quality bounded solutions },
	booktitle = {AAAI Spring Symposium 2007},
	year = {2007},
	abstract = {Distributed Partially Observable Markov Decision Problems (Distributed POMDPs)
are a popular approach for modeling multi-agent systems acting in uncertain domains. Given the significant computational complexity of solving distributed POMDPs,
one popular approach has focused on approximate solutions. Though this approach
provides for efficient computation of solutions, the algorithms within this approach
do not provide any guarantees on the quality of the solutions. A second less popular approach has focused on a global optimal result, but at considerable computational cost. This paper overcomes the limitations of both these approaches
by providing SPIDER (Search for Policies In Distributed EnviRonments), which
provides quality-guaranteed approximations for distributed POMDPs. SPIDER allows us to vary this quality guarantee, thus allowing us to vary solution quality
systematically. SPIDER and its enhancements employ heuristic search techniques
for finding a joint policy that satisfies the required bound on the quality of the
solution.},
	author = {Varakantham, Pradeep and Janusz Marecki and Tambe, Milind and Makoto Yokoo}
}
