A Bilinear Programming Approach for Multiagent Planning

DOI10.1613/jair.2673zbMath1184.68534arXiv1401.3461OpenAlexW2119843853MaRDI QIDQ3651464

Marek Petrik, Shlomo Zilberstein

Publication date: 10 December 2009

Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1401.3461

zbMATH Keywords

bilinear programssuccessive approximation algorithmtwo-agent problems

Mathematics Subject Classification ID

Approximation algorithms (68W25) Agent technology and artificial intelligence (68T42)

Related Items (3)

A mixed-integer linear programming reduction of disjoint bilinear programs via symbolic variable elimination ⋮ Algorithms for recursive delegation ⋮ A Sufficient Statistic for Influence in Structured Multiagent Environments

This page was built for publication: A Bilinear Programming Approach for Multiagent Planning