No open-access location is known for this record yet.
No open-access location is known for this record yet.
In this paper, we consider finite model approximations of a large class of static and dynamic team problems where these models are constructed through uniform quantization of the observation and action spaces of the agents. The strategies obtained from these finite models are shown to approximate the optimal cost with arbitrary precision under mild technical assumptions. In particular, quantized team policies are asymptotically optimal. This result is then applied to the Gaussian relay channel problem. This result also applies to Witsenhausen's counterexample, which we had studied individually earlier.
Loading…
Stored only when both papers are in the corpus — 33 citations exist upstream.
Papers that cite the same references — the relational fallback while embeddings are still backfilling.
Imported from OpenAlex (CC0) — nothing here is generated.