101 citations · 332 across the 32 of their papers we have counts for
1 paper · 1 filter
Marek Petrik, Shlomo Zilberstein
Multiagent planning and coordination problems are common and known to be computationally hard. We show that a wide range of two-agent problems can be formulated as bilinear program…