cs.GT · 2026-06-25 · No. 34

Computer Science and Game Theory, 2026-06-25.

1 new papers in cs.GT. Titles, authors, abstracts. Links to arXiv. Want this in your inbox every morning? Subscribe →

01 — The papers

1 entries
  1. 01

    Variable Bound Tightening for Nash Equilibrium Computation in Multiplayer Imperfect-Information Games

    Sam Ganzfried

    cs.GT · cs.AI · cs.MA · econ.TH · math.OC

    There has been significant recent progress in algorithms for approximation of Nash equilibrium in large two-player zero-sum imperfect-information games and exact computation of Nash equilibrium in multiplayer strategic-form games. While counterfactual regret minimization and fictitious play are scalable to large games and have convergence guarantees in two-player zero-sum games, they do not guarantee convergence to Nash equilibrium in...

    arxiv.org/abs/2606.25997 · PDF

This edition is part of The Daily Abstract — cs.GT archive. Subscribe to receive these in your inbox each morning, automatically translated to Spanish, with reply-to-PDF: arxivdaily.ignorelist.com.

Colophon Set in Georgia, with system sans for interface chrome and a monospaced stack for code and paper identifiers. Sole accent: amber #D99C5E. Built and served on an always-free VM. The masthead is set 14% letterspaced because newspapers do that and it works.