The paper settles the computational complexity of Quoridor and related games by reducing them to Reisch's planar graph-Hex.

The paper introduces FinBoardBench, a novel evaluation suite using financial board games to demonstrate that current LLMs, despite strong static reasoning, fail at complex, dynamic wealth management a…

The paper introduces PTCG-Bench, a new benchmark using the Pokémon TCG to evaluate LLM agents' strategic decision-making and ability to self-evolve, finding that sustained self-evolution remains chall…

This paper studies the NP-completeness and provides a polynomial-time algorithm for the disjoint separators problem in planar graphs when all sizes are equal to one.

The paper proves XNLP-hardness of Directed Edge Geography and Undirected Edge Geography when parameterized by pathwidth, and shows their fixed-parameter tractability when parameterized by treewidth an…

This paper characterizes Pure Nash Equilibria and presents a polynomial-time algorithm for finding them in the Intermittent Strategic Cooperation-Based Two-Agent Path Planning game.

This paper presents new polynomial-time algorithms for determining the winner of the unbiased triangle game on the edge set of general graphs using the edge-triangle incidence graph.

The paper introduces FootsiesGym, an open-source environment for learning in a two-player, zero-sum, imperfect-information game, providing a vectorized simulator for efficient analysis.

The paper presents a complete, moderatorless protocol for playing Werewolf using only ordinary playing cards, eliminating the need for a trusted third party or digital devices.

This paper proves that a majority of filled-in Sudoku grids require a logarithmic fraction of cells to be filled by clues, and constructs grids requiring 18 and 80 clues for 9x9 and 16x16 Sudoku, resp…

This paper introduces a new way to represent finite posets as subwords of finite words in categories, and characterizes the monic categories that admit this representation.

The paper introduces Mindgames, a comprehensive multi-game arena for evaluating LLM agents' sustained social and strategic reasoning, demonstrating that current evaluations are limited by structural s…

This paper studies a variant of the quantum XOR game model, called tilted XOR games, and shows that approximating their quantum value to constant precision is RE-complete.

This paper studies the complexity of the Flood-It game on various graph classes and provides polynomial-time algorithms for Free Flood-It on graphs free of certain jewels, while proving NP-completenes…

The paper proposes using GUI agents, both as objective evaluators and subjective playtesters, to significantly improve the generation of playable games from prompts, demonstrating a 66.8% rubric pass-…

This paper investigates the convergence and stability of equilibria in bimatrix two-player games using the optimistic exponential weights method, allowing step sizes to differ.

This paper analyzes the computational complexity of evaluating recurrent functions, showing that the complexity depends heavily on how the input offsets are encoded and the structure of the recurrence…