Related papers: Quantitative Reductions and Vertex-Ranked Infinite…

Theory of Mind benchmarks for large language models typically produce aggregate scores without theoretical grounding, making it unclear whether high performance reflects strategic reasoning or surface-level heuristics. We introduce a…

We introduce a new class of population games that we call monotropic; these are games characterized by the presence of a unique globally neutrally stable Nash equilibrium. Monotropic games generalize strictly concave potential games and…

We propose a game-based formulation for learning dimensionality-reducing representations of feature vectors, when only a prior knowledge on future prediction tasks is available. In this game, the first player chooses a representation, and…

In this work the properties of multi choice minority games are studied by means of extensive computational simulations. We have considered several ways of rewarding the strategies of the players and compared the resulting behaviours of the…

We present a new model of incomplete information games without private information in which the players use a distributionally robust optimization approach to cope with the payoff uncertainty. With some specific restrictions, we show that…

We study games with finitely many participants, each having finitely many choices. We consider the following categories of participants: (I) populations: sets of nonatomic agents, (II) atomic splittable players, (III) atomic non splittable…

Regret minimization is a powerful tool for solving large-scale extensive-form games. State-of-the-art methods rely on minimizing regret locally at each decision point. In this work we derive a new framework for regret minimization on…

We propose a simple yet rich model to extend the notions of Nash equilibria and correlated equilibria of strategic games to the quantum setting, in which we then study the relations between classical and quantum equilibria. Unlike the…

Decision making in modern large-scale and complex systems such as communication networks, smart electricity grids, and cyber-physical systems motivate novel game-theoretic approaches. This paper investigates big strategic (non-cooperative)…

Two-player graph games have found numerous applications, most notably in the synthesis of reactive systems from temporal specifications, but also in verification. The relevance of infinite-state systems in these areas has lead to…

We reason about possible future development of quantum game theory and its impact on information processing and the emerging information society. Two of the authors have recently proposed a quantum description of financial market in terms…

We introduce an evolutionary game with feedback between perception and reality, which we call the reality game. It is a game of chance in which the probabilities for different objective outcomes (e.g., heads or tails in a coin toss) depend…

With increasing game size, a problem of computational complexity arises. This is especially true in real world problems such as in social systems, where there is a significant population of players involved in the game, and the complexity…

We study algorithmic complexity of solving subtraction games in a~fixed dimension with a finite difference set. We prove that there exists a game in this class such that any algorithm solving the game runs in exponential time. Also we prove…

This paper investigates the problem of computing the equilibrium of competitive games, which is often modeled as a constrained saddle-point optimization problem with probability simplex constraints. Despite recent efforts in understanding…

The interplay between exploration and exploitation in competitive multi-agent learning is still far from being well understood. Motivated by this, we study smooth Q-learning, a prototypical learning model that explicitly captures the…

We study the effectiveness of iterated elimination of strictly-dominated actions in random games. We show that dominance solvability of games is vanishingly small as the number of at least one player's actions grows. Furthermore,…

This work studies an algorithm, which we call magnetic mirror descent, that is inspired by mirror descent and the non-Euclidean proximal gradient algorithm. Our contribution is demonstrating the virtues of magnetic mirror descent as both an…

A binary constraint system game is a two-player one-round non-local game defined by a system of Boolean constraints. The game has a perfect quantum strategy if and only if the constraint system has a quantum satisfying assignment [R. Cleve…

We introduce a new class of totally balanced cooperative TU games, namely p -additive games. It is inspired by the class of inventory games that arises from inventory situations with temporary discounts (Toledo, 2002) and contains the class…