Solving POMDPs using quadratically constrained linear programs

Christopher Amato, Daniel S. Bernstein, Shlomo Zilberstein. Solving POMDPs using quadratically constrained linear programs. In Hideyuki Nakashima, Michael P. Wellman, Gerhard Weiss, Peter Stone, editors, 5th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2006), Hakodate, Japan, May 8-12, 2006. pages 341-343, ACM, 2006. [doi]

@inproceedings{AmatoBZ06,
  title = {Solving POMDPs using quadratically constrained linear programs},
  author = {Christopher Amato and Daniel S. Bernstein and Shlomo Zilberstein},
  year = {2006},
  doi = {10.1145/1160633.1160694},
  url = {http://doi.acm.org/10.1145/1160633.1160694},
  researchr = {https://researchr.org/publication/AmatoBZ06},
  cites = {0},
  citedby = {0},
  pages = {341-343},
  booktitle = {5th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2006), Hakodate, Japan, May 8-12, 2006},
  editor = {Hideyuki Nakashima and Michael P. Wellman and Gerhard Weiss and Peter Stone},
  publisher = {ACM},
  isbn = {1-59593-303-4},
}