Tootfinder

Scale-Invariant Regret Matching and Online Learning with Optimal Convergence: Bridging Theory and Practice in Zero-Sum Games
Brian Hu Zhang, Ioannis Anagnostides, Tuomas Sandholm
https://arxiv.org/abs/2510.04407

Scale-Invariant Regret Matching and Online Learning with Optimal Convergence: Bridging Theory and Practice in Zero-Sum Games
A considerable chasm has been looming for decades between theory and practice in zero-sum game solving through first-order methods. Although a convergence rate of $T^{-1}$ has long been established since Nemirovski's mirror-prox algorithm and Nesterov's excessive gap technique in the early 2000s, the most effective paradigm in practice is *counterfactual regret minimization*, which is based on *regret matching* and its modern variants. In particular, the state of the art across most benchmarks …

A Game-Theoretic Framework for Network Formation in Large Populations
Gokce Dayanikli, Mathieu Lauriere
https://arxiv.org/abs/2508.03847 https://arxiv.org/…

A Game-Theoretic Framework for Network Formation in Large Populations
In this paper, we study a model of network formation in large populations. Each agent can choose the strength of interaction (i.e. connection) with other agents to find a Nash equilibrium. Different from the recently-developed theory of graphon games, here each agent's control depends not only on her own index but also on the index of other agents. After defining the general model of the game, we focus on a special case with piecewise constant graphs and we provide optimality conditions through…

Zero-Error Nash Equilibrium: Harnessing Nonlocal Correlation in Incomplete Information Games
Ambuj, Tushar, Siddharth R. Pandey, Ram Krishna Patra, Anandamay Das Bhowmik, Kuntal Som, Amit Mukherjee
https://arxiv.org/abs/2509.02947

Zero-Error Nash Equilibrium: Harnessing Nonlocal Correlation in Incomplete Information Games
Claude Shannon's zero-error communication paradigm reshaped our understanding of fault-tolerant information transfer. Here, we adapt this notion into game theory with incomplete information. We ask: can players with private information coordinate on a Nash equilibrium with zero probability of error? We identify Bayesian games in which such coordination is impossible classically, yet achievable by harnessing Bell nonlocal correlations. We formalize this requirement as zero-error Nash equilibrium…

Replaced article(s) found for cs.GT. https://arxiv.org/list/cs.GT/new
[1/1]:
- Optimal Modified Feedback Strategies in LQ Games under Control Imperfections
Mahdis Rabbani, Navid Mojahed, Shima Nazari

Conversational Implicatures: Modelling Relevance Theory Probabilistically
Christoph Unger, Hendrik Buschmeier
https://arxiv.org/abs/2509.22354 https://arxi…

Conversational Implicatures: Modelling Relevance Theory Probabilistically
Recent advances in Bayesian probability theory and its application to cognitive science in combination with the development of a new generation of computational tools and methods for probabilistic computation have led to a 'probabilistic turn' in pragmatics and semantics. In particular, the framework of Rational Speech Act theory has been developed to model broadly Gricean accounts of pragmatic phenomena in Bayesian terms, starting with fairly simple reference games and covering ever more compl…

Crosslisted article(s) found for cs.FL. https://arxiv.org/list/cs.FL/new
[1/1]:
- Mean-payoff and Energy Discrete Bidding Games
Guy Avni, Suman Sadhukhan
https://…

Koalas vs. Crows: An Evolutionary Theory of #Software
https://ajmoon.com/posts/koalas-vs-crows-an-evolutionary-theory-of-software

Various Diamond Properties in Combinatorial Game Theory
Keiichirou Kusakari, Tomoaki Abuku
https://arxiv.org/abs/2509.21744 https://arxiv.org/pdf/2509.2174…

Various Diamond Properties in Combinatorial Game Theory
We investigate conditions under which positions in combinatorial games admit simple values. We introduce a unified diamond framework, the $\Diamond_A$-property ($A\in\{\mathbb{Z},\mathbb{D}$), for sets of positions closed under options. Under certain conditions, this framework guarantees that all values are integers, dyadic rationals, or pairs $\{m|n\}$ (on $\mathbb{Z}$ or $\mathbb{D}$). As an application, we establish that every position in \textsc{Yashima} game on bipartite graphs has an…

Bayesimax Theory: Selecting Priors by Minimizing Total Information
Sitaram Vangala
https://arxiv.org/abs/2508.15976 https://arxiv.org/pdf/2508.15976…

Bayesimax Theory: Selecting Priors by Minimizing Total Information
We introduce Bayesimax theory, a paradigm for objective Bayesian analysis which selects priors by applying minimax theory to prior disclosure games. In these games, the uniquely optimal strategy for a Bayesian agent upon observing the data is to reveal their prior. As such, the prior chosen by minimax theory is, in effect, the implicit prior of minimax agents. Since minimax analysis disregards prior information, this prior is arguably noninformative. We refer to minimax solutions of certain pri…

The Universal Theory of Locally Universal Tracial von Neumann Algebras is not Computable
Jananan Arulseelan, Aareyan Manzoor
https://arxiv.org/abs/2508.21709 https://

The Universal Theory of Locally Universal Tracial von Neumann Algebras is not Computable
Building on Lin's breakthrough MIP$^{co}$ = coRE and an encoding of non-local games as universal sentences in the language of tracial von Neumann algebras, we show that locally universal tracial von Neumann algebras have undecidable universal theories. This implies that no such algebra admits a computable presentation. Our results also provide, for the first time, explicit examples of separable II$_1$ factors without computable presentations, and in fact yield a broad family of them, including …

Second blog post: what if the Ennies reviewed games from two years ago?
https://seedlinggames.com/blogging/discourse/ennies_past.html
Basically, my theory is that it isn't really possible to evaluate the quality of games in general that came out in a given …

Proceedings of the Sixteenth International Symposium on Games, Automata, Logics, and Formal Verification
Giorgio Bacci (Aalborg University, Denmark), Adrian Francalanza (University of Malta)
https://arxiv.org/abs/2509.13258

Proceedings of the Sixteenth International Symposium on Games, Automata, Logics, and Formal Verification
This volume contains the proceedings of GandALF 2025, the Sixteenth International Symposium on Games, Automata, Logics, and Formal Verification. GandALF 2025 took place on 16-17th September 2025, in Valletta, Malta. The aim of GandALF 2025 is to bring together researchers from academia and industry who are actively working in the fields of Games, Automata, Logics, and Formal Verification. The idea is to cover an ample spectrum of themes, ranging from theory to applications, and stimulate cross-…

A Strongly Polynomial-Time Combinatorial Algorithm for the Nucleolus in Convex Games
Giacoomo Maggiorano, Alessandro Sosso, Gautier Stauffer
https://arxiv.org/abs/2509.02380 htt…

A Strongly Polynomial-Time Combinatorial Algorithm for the Nucleolus in Convex Games
The nucleolus is a fundamental solution concept in cooperative game theory, yet computing it is NP-hard in general. In convex games-where players' marginal contributions grow with coalition size-the only existing polynomial-time algorithm relies on the ellipsoid method. We re-examine a reduced game approach, refuting a previously claimed polynomial-time implementation and clarifying why it fails. By developing new algorithmic ideas and exploiting the structure of least core polyhedra, we show t…

Replaced article(s) found for math.NT. https://arxiv.org/list/math.NT/new
[1/1]:
- Black Hole Zeckendorf Games
Caroline Cashman, Steven J. Miller, Jenna Shuffleton, Daeyoung Son

A non-sequential arithmetical theory with pairing
Juvenal Murwanashyaka
https://arxiv.org/abs/2509.15191 https://arxiv.org/pdf/2509.15191

A non-sequential arithmetical theory with pairing
Albert Visser has shown that Robinson's $ \mathsf{Q} $ and Gregorczyk's $ \mathsf{TC} $ are not sequential by showing that these theories are not even poly-pair theories, which, in a strong sense, means these theories lack pairing. In this paper, we use Ehrenfeucht-Fraïssé games to show that the theory $ \mathsf{Q} + Θ$ we obtain by extending Robinson's $ \mathsf{Q} $ with an axiom $ Θ$ which says that the map $ π(x, y ) = (x+y)^2 + x $ is a pairing function is not sequential; in fact, we …

"In a broader sense, however, today’s ruling is of a piece with this Court’s recent tendencies. “[R]ight when the Judiciary should be hunkering down to do all it can to preserve the law’s constraints,” the Court opts instead to make vindicating the rule of law and preventing manifestly injurious Government action as difficult as possible….. This is Calvinball jurisprudence with a twist. Calvinball has only one rule: There are no fixed rules. We seem to have two: that one, and this Admin…

Justice Jackson Correctly Defines The John Roberts Supreme Court As The Calvinball Court
In theory, the nice thing about having a Supreme Court is that it provides some level of legal certainty. You know how the system works: lower courts make decisions based on law and precedent, part…

Co-Investment with Payoff-Sharing Mechanism for Cooperative Decision-Making in Network Design Games
Mingjia He, Andrea Censi, Emilio Frazzoli, Gioele Zardini
https://arxiv.org/abs/2508.12059

Co-Investment with Payoff-Sharing Mechanism for Cooperative Decision-Making in Network Design Games
Network-based systems are inherently interconnected, with the design and performance of subnetworks being interdependent. However, the decisions of self-interested operators may lead to suboptimal outcomes for users and the overall system. This paper explores cooperative mechanisms that can simultaneously benefit both operators and users. We address this challenge using a game-theoretical framework that integrates both non-cooperative and cooperative game theory. In the non-cooperative stage, w…

Fast and the Furious: Hot Starts in Pursuit-Evasion Games
Gabriel Smithline, Scott Nivison
https://arxiv.org/abs/2510.10830 https://arxiv.org/pdf/2510.1083…

Fast and the Furious: Hot Starts in Pursuit-Evasion Games
Effectively positioning pursuers in pursuit-evasion games without prior knowledge of evader locations remains a significant challenge. A novel approach that combines game-theoretic control theory with Graph Neural Networks is introduced in this work. By conceptualizing pursuer configurations as strategic arrangements and representing them as graphs, a Graph Characteristic Space is constructed via multi-objective optimization to identify Pareto-optimal configurations. A Graph Convolutional Netwo…

Grouped Satisficing Paths in Pure Strategy Games: a Topological Perspective
Yanqing Fu, Chao Huang, Chenrun Wang, Zhuping Wang
https://arxiv.org/abs/2509.23157 https://

Grouped Satisficing Paths in Pure Strategy Games: a Topological Perspective
In game theory and multi-agent reinforcement learning (MARL), each agent selects a strategy, interacts with the environment and other agents, and subsequently updates its strategy based on the received payoff. This process generates a sequence of joint strategies $(s^t)_{t \geq 0}$, where $s^t$ represents the strategy profile of all agents at time step $t$. A widely adopted principle in MARL algorithms is "win-stay, lose-shift", which dictates that an agent retains its current strategy if it ac…

Nonlocal Games Through Communication Complexity and Quantum Cryptography
Pierre Botteron
https://arxiv.org/abs/2510.09457 https://arxiv.org/pdf/2510.09457

Nonlocal Games Through Communication Complexity and Quantum Cryptography
This thesis explores foundational aspects of quantum information theory and quantum cryptography. First, we investigate quantum correlations in interactive settings, including the CHSH and graph isomorphism games. We aim to distinguish quantum correlations from non-signaling correlations by leveraging the principle of communication complexity. To this end, we employ techniques such as distributed computation, majority-function-based distillation protocols, the algebraic and geometric properti…

Evolution of social behaviors in noisy environments
Guocheng Wang, Qi Su, Long Wang, Joshua B. Plotkin
https://arxiv.org/abs/2510.05521 https://arxiv.org/p…

Evolution of social behaviors in noisy environments
Evolutionary game theory offers a general framework to study how behaviors evolve by social learning in a population. This body of theory can accommodate a range of social dilemmas, or games, as well as real-world complexities such as spatial structure or behaviors conditioned on reputations. Nonetheless, this approach typically assumes a deterministic payoff structure for social interactions. Here, we extend evolutionary game theory to account for random changes in the social environment, so t…

First- and Zeroth-Order Learning in Asynchronous Games
Zifan Wang, Xinlei Yi, Michael M. Zavlanos, Karl H. Johansson
https://arxiv.org/abs/2508.09111 https://

First- and Zeroth-Order Learning in Asynchronous Games
This paper investigates the discrete-time asynchronous games in which noncooperative agents seek to minimize their individual cost functions. Building on the assumption of partial asynchronism, i.e., each agent updates at least once within a fixed-length time interval, we explore the conditions to ensure convergence of such asynchronous games. The analysis begins with a simple quadratic game from which we derive tight convergence conditions through the lens of linear control theory. Then, we pr…

Cooperation in Bilateral Generalized Network Creation
Hans Gawendowicz, Pascal Lenzner, Lukas Weyand
https://arxiv.org/abs/2510.00239 https://arxiv.org/pdf…

Cooperation in Bilateral Generalized Network Creation
Studying the impact of cooperation in strategic settings is one of the cornerstones of algorithmic game theory. Intuitively, allowing more cooperation yields equilibria that are more beneficial for the society of agents. However, for many games it is still an open question how much cooperation is actually needed to ensure socially good equilibria. We contribute to this research endeavor by analyzing the benefits of cooperation in a network formation game that models the creation of communicatio…

Crosslisted article(s) found for cs.FL. https://arxiv.org/list/cs.FL/new
[1/1]:
- Emerson-Lei and Manna-Pnueli Games for LTLf and PPLTL Synthesis
Hausmann, Zhu, Parretti, Weinhuber, De Giacomo, Piterman

Evolutionary dynamics of memory-based strategies in repeated and structured social interactions
Ketian Sun, Qi Su, Long Wang
https://arxiv.org/abs/2509.10820 https://

Evolutionary dynamics of memory-based strategies in repeated and structured social interactions
Human social life is shaped by repeated interactions, where past experiences guide future behavior. In evolutionary game theory, a key challenge is to identify strategies that harness such memory to succeed in repeated encounters. Decades of research have identified influential one-step memory strategies (such as Tit-for-Tat, Generous Tit-for-Tat, and Win-Stay Lose-Shift) that promote cooperation in iterated pairwise games. However, these strategies occupy only a small corner of the vast strate…

Replaced article(s) found for cs.GT. https://arxiv.org/list/cs.GT/new
[1/1]:
- Algorithms and Complexity for Computing Nash Equilibria in Adversarial Team Games
Anagnostides, Kalogiannis, Panageas, Vlatakis-Gkaragkounis, McAleer

Replaced article(s) found for cs.GT. https://arxiv.org/list/cs.GT/new
[1/1]:
- Learning in Repeated Multi-Objective Stackelberg Games with Payoff Manipulation
Phurinut Srisawad, Juergen Branke, Long Tran-Thanh

Temporal Cooperative Games
Ashwin Goyal, Drashthi Doshi, Swaprava Nath
https://arxiv.org/abs/2510.11255 https://arxiv.org/pdf/2510.11255

Temporal Cooperative Games
Classical cooperative game theory assumes that the worth of a coalition depends only on the set of agents involved, but in practice, it may also depend on the order in which agents arrive. Motivated by such scenarios, we introduce temporal cooperative games (TCG), where the worth $v$ becomes a function of the sequence of agents $π$ rather than just the set $S$. This shift calls for rethinking the underlying axioms. A key property in this temporal framework is the incentive for optimal arrival …

Crosslisted article(s) found for cs.GT. https://arxiv.org/list/cs.GT/new
[1/1]:
- Learning in Stackelberg Markov Games
Jun He, Andrew L. Liu, Yihsu Chen
https://

Replaced article(s) found for cs.GT. https://arxiv.org/list/cs.GT/new
[1/1]:
- A Stable-Set Bound and Maximal Numbers of Nash Equilibria in Bimatrix Games
Constantin Ickstadt, Thorsten Theobald, Bernhard von Stengel

Extending Games beyond the Finite Horizon
Kiri Sakahara, Takashi Sato
https://arxiv.org/abs/2510.08453 https://arxiv.org/pdf/2510.08453

Extending Games beyond the Finite Horizon
This paper argues that the finite horizon paradox, where game theory contradicts intuition, stems from the limitations of standard number systems in modelling the cognitive perception of infinity. To address this issue, we propose a new framework based on Alternative Set Theory (AST). This framework represents different cognitive perspectives on a long history of events using distinct topologies. These topologies define an indiscernibility equivalence that formally treats huge, indistinguishabl…

Replaced article(s) found for cs.GT. https://arxiv.org/list/cs.GT/new
[1/1]:
- Instability and Efficiency of Non-cooperative Games
Jianfeng Zhang
https://

Crosslisted article(s) found for cs.GT. https://arxiv.org/list/cs.GT/new
[1/1]:
- Private Markovian Equilibrium in Stackelberg Markov Games for Smart Grid Demand Response
Siying Huang, Yifen Mu, Ge Chen

Crosslisted article(s) found for cs.GT. https://arxiv.org/list/cs.GT/new
[1/1]:
- GRPO-GCC: Enhancing Cooperation in Spatial Public Goods Games via Group Relative Policy Optimizat...
Zhaoqilin Yang, Chanchan Li, Tianqi Liu, Hongxin Zhao, Youliang Tian

Crosslisted article(s) found for cs.GT. https://arxiv.org/list/cs.GT/new
[1/1]:
- Understanding Economic Tradeoffs Between Human and AI Agents in Bargaining Games
Crystal Qian, Kehang Zhu, John Horton, Benjamin S. Manning, Vivian Tsai, James Wexler, Nithum Thain

Replaced article(s) found for cs.GT. https://arxiv.org/list/cs.GT/new
[1/1]:
- Solving Football by Exploiting Equilibrium Structure of 2p0s Differential Games with One-Sided In...
Mukesh Ghimire, Lei Zhang, Zhe Xu, Yi Ren

Crosslisted article(s) found for cs.GT. https://arxiv.org/list/cs.GT/new
[1/1]:
- Alignment Games
Pedro Cesar Lopes Gerum, Thomas Lidbetter
https://

Replaced article(s) found for cs.GT. https://arxiv.org/list/cs.GT/new
[1/1]:
- Multi-weighted Reachability Games and Their Application to Permissiveness
Thomas Brihaye, Aline Goeminne