AINeutralarXiv – CS AI · 6h ago6/10
🧠
Variable Bound Tightening for Nash Equilibrium Computation in Multiplayer Imperfect-Information Games
Researchers have developed an improved algorithm for computing Nash equilibrium in multiplayer imperfect-information games by deriving tighter variable bounds for nonlinear complementarity problems. This enhancement significantly accelerates spatial branch-and-bound solvers, enabling exact solution of previously intractable game theory problems like three-player Kuhn poker.