Safe Subgame Resolving in Multiplayer Games

arXiv:2611.25981v1 Announce Type: cross
Abstract: Poker and other games with hidden information are too large to solve in one pass. Strong systems compute a complete blueprint strategy offline and refine it in real time inside the reached subgame. In 2p0s games, a safety theorem guarantees that subgame resolving never increases how much an adversary can gain by exploiting the resolved strategy

[…]
Content was trimmed to protect the source. Please visit the original article for the full text.

This article has been indexed from cs.AI updates on arXiv.org

Read today’s AI news roundups »