Skip to content
Hot storyWatching

Conditional safety theorem proved for multi-player subgame re-solving

1 report1 sourceUpdated 3 d ago

What happened

AI overview

The paper proposes and proves a conditional safety theorem for non-correlated multi-player subgame re-solving. The authors call it the first theorem of its kind for this direction: for re-solving in games with three or more players who act independently, it decomposes the upper bound on the best-response gap of the re-solved strategy into four terms. The authors also give an a posteriori certificate for checking any update that is actually submitted; the code has been released publicly on GitHub. The results apply to hidden-information games such as three-player Leduc and multi-player Kuhn poker. The authors point out that the extra cost term (the "tax") among the four terms is zero in sum games, including all rake-free poker variants; in other words, this zero-cost conclusion holds only for those games.

AI-written from the coverage · updated 2 d ago

Coverage timeline

Follow the coverage to see the story from different sides.

Nov 19
  1. arXiv Board & Classic Game AIPick
    Paper proposes conditional safety theorem and a posteriori certificate for subgame solving in multiplayer games

    The paper proposes a conditional safety theorem for subgame solving in multiplayer games with three or more players acting independently, decomposes the best-response gap upper bound of the post-solve strategy into four terms, and gives an a posteriori certificate that can check any submitted update.

Heat trend for this story

Current (comparable)
3
Peak (comparable)
6Nov 20 12:00
24-hour change
-50%

The trend only compares participants observed continuously and completely, so it may cover fewer than the current heat count. Hover over or tap the chart to see each hour's heat; with a keyboard, use the left and right arrow keys.