The paper classifies LTC problems in Dec-POMDPs by information structures, identifies conditions preserving quasi-classical structure after sharing, and gives provable quasi-polynomial planning and learning algorithms for compliant cases.
Furthermore, the communication cost and reward functions can be decoupled as Kh(za h) =Pn i=1 Ki,h(za i,h),R h(sh, ah) =Pn i=1 Ri,h(si,h, ai,h)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
eess.SY 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Principled Learning-to-Communicate with Quasi-Classical Information Structures
The paper classifies LTC problems in Dec-POMDPs by information structures, identifies conditions preserving quasi-classical structure after sharing, and gives provable quasi-polynomial planning and learning algorithms for compliant cases.