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.

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 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 proves that winner determination under Stable Voting and Simple Stable Voting is PSPACE-complete.

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…

This paper introduces the Value Causal Markov Condition (v-CMC) for linking causality and utility, and develops its foundations.

This paper improves an algorithm for computing lower bounds on the margin of a Single Transferable Vote (STV) election, making risk-limiting audits more practical.

This paper shows that standard optimal control in Markov Decision Processes (MDPs) with an absorbing catastrophic state naturally generates behavioral signatures mimicking prospect theory, even withou…

The paper introduces Safe Equilibrium Policy Optimization (σepo{}) to train language models for multi-agent strategic tasks, achieving improved safety and robustness across various game domains.

This paper develops a convergence theory and runtime bound for closed-loop generative selection in computational drug discovery, showing that elitism makes the search absorbing and proving almost-sure…

This paper provides non-asytotic sample complexity guarantees for the Navigate and Stop algorithm in online tabular Reinforcement Learning, identifying additional attributes that affect the overall sa…

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 settles the computational complexity of Quoridor and related games by reducing them to Reisch's planar graph-Hex.

This paper studies the tension between speed and safety in technological races using a framed behavioral experiment on artificial intelligence development.

This paper introduces an activation hierarchy and proves a Predictor-Impossibility Theorem, showing that no effective predictor family can determine all stage languages. It also establishes a slice th…