Metraipolis › archive › dc_2d33ae44479b

IFlowNets: Extending Generative Samplers to Learn Strategies in Incomplete Information Games — arXiv:2608.05422

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.05422
License (as archived)
CC0-1.0
Archived
2026-10-25T20:52:21.463Z
SHA-256 of the archived text
04698e2812827079b6e1dd95c6f71f0e3df742b98d14ff579b285ba9d370a08c
Stable URL of this page
https://metraipolis.com/documento/dc_2d33ae44479b

How to cite

IFlowNets: Extending Generative Samplers to Learn Strategies in Incomplete Information Games — arXiv:2608.05422 — arXiv (en), https://arxiv.org/abs/2608.05422 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_2d33ae44479b (Metraipolis archive dc_2d33ae44479b, sha256 04698e2812827079b6e1dd95c6f71f0e3df742b98d14ff579b285ba9d370a08c)
BibTeX
@misc{dc2d33ae44479b,
  title = {IFlowNets: Extending Generative Samplers to Learn Strategies in Incomplete Information Games — arXiv:2608.05422},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.05422},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_2d33ae44479b; sha256 04698e2812827079b6e1dd95c6f71f0e3df742b98d14ff579b285ba9d370a08c},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.05422. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

While many algorithms blend reinforcement learning (RL) with counterfactual regret (CFR) methods to leverage tradeoffs in computational speed and performance, there are fewer investigations into generative sampling frameworks in game theoretic applications in incomplete information games. We extend a generative flow network framework, Adversarial Flow Networks (AFlowNets), to incomplete information games, called Information Flow Networks (IFNs). We prove that previously established constraints for generative flow networks in complete information games are inadmissible for obtaining valid densities (corresponding to player strategies) and a valid training objective. We show that our proposed generalization, IFlowNets, alleviates this issue and strictly generalizes AFlowNets. In preliminary results for three standard game environments, IFlowNets perform comparably to or better than Outcome Sampling Monte Carlo Counterfactual Regret (OSMCCFR) and standard RL-based methods in performance and speed.

Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-08-07 in cs.MA).
Categorie arXiv: Machine Learning (cs.LG) ; Multiagent Systems (cs.MA).
Pagina del lavoro: https://arxiv.org/abs/2608.05422 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-25T20:47:44.141Z dalla pagina https://arxiv.org/catchup/cs.MA/2026-08-07?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).