Related papers: Bistable Probabilities: A Unified Framework for St…
From the standpoint of game theory, dominoes is a game that has not received much attention (specially the variety known as draw). It is usually thought that this game is already solved, given general results in game theory. However, the…
Given that the assumption of perfect rationality is rarely met in the real world, we explore a graded notion of rationality in socioecological systems of networked actors. We parametrize an actors' rationality via their place in a social…
A classic model to study strategic decision making in multi-agent systems is the normal-form game. This model can be generalised to allow for an infinite number of pure strategies leading to continuous games. Multi-objective normal-form…
The overall aim of our research is to develop techniques to reason about the equilibrium properties of multi-agent systems. We model multi-agent systems as concurrent games, in which each player is a process that is assumed to act…
In a satisficing equilibrium each agent $i$ plays one of her top $k_i$ actions in response to the actions of the other agents. Our concept unifies models of bounded rationality and yields predictions that differ from canonical solution…
Observable games are game situations that reach one of possibly many Nash equilibria. Before an instance of the game starts, an external observer does not know, a priori, what is the exact profile of actions that will occur; thus, he…
In the traditional game-theoretic set up, where agents select actions and experience corresponding utilities, an equilibrium is a configuration where no agent can improve their utility by unilaterally switching to a different action. In…
We consider a 3-player game in the normal form, in which each player has two actions. We assume that the game is symmetric and repeated infinitely many times. At each stage players make their choices knowing only the average payoffs from…
We propose a logical framework combining a game-theoretic study of abilities of agents to achieve quantitative objectives in multi-player games by optimizing payoffs or preferences on outcomes with a logical analysis of the abilities of…
This paper addresses a mathematically tractable model of the Prisoner's Dilemma using the framework of active inference. In this work, we design pairs of Bayesian agents that are tracking the joint game state of their and their opponent's…
We study the applicability of quantum algorithms in computational game theory and generalize some results related to Subtraction games, which are sometimes referred to as one-heap Nim games. In quantum game theory, a subset of Subtraction…
Quantum game theory is a multidisciplinary field which combines quantum mechanics with game theory by introducing non-classical resources such as entanglement, quantum operations and quantum measurement. By transferring two-player-two…
Game theory, as an analytical tool, is frequently utilized to analyze human behavior in social science research. With the high alignment between the behavior of Large Language Models (LLMs) and humans, a promising research direction is to…
We present a computational formulation for the approximate version of several variational inequality problems, investigating their computational complexity and establishing PPAD-completeness. Examining applications in computational game…
For some well-known games, such as the Traveler's Dilemma or the Centipede Game, traditional game-theoretic solution concepts--and most notably Nash equilibrium--predict outcomes that are not consistent with empirical observations. In this…
In the same sense as classical logic is a formal theory of truth, the recently initiated approach called computability logic is a formal theory of computability. It understands (interactive) computational problems as games played by a…
An abstraction of normal form games is proposed, called Feasibility/Desirability Games (or FD Games in short). FD Games can be seen from three points of view: as a new presentation of games in which Nash equilibria can be found, as choice…
Examples of games between two partners with mixed strategies, calculated by the use of the probability amplitude as some vector in Hilbert space are given. The games are macroscopic, no microscopic quantum agent is supposed. The reason for…
Games with incomplete information are formulated in a multi-sector probability matrix formalism that can cope with quantum as well as classical strategies. An analysis of classical and quantum strategy in a multi-sector extension of the…
We present multilinear and mixed-integer multilinear programs to find a Nash equilibrium in multi-player noncooperative games. We compare the formulations to common algorithms in Gambit, and conclude that a multilinear feasibility program…