Related papers: From Quasi-Dominions to Progress Measures

According to Shapley's game-theoretical result, there exists a unique game value of finite cooperative games that satisfies axioms on additivity, efficiency, null-player property and symmetry. The original setting requires symmetry with…

In this article, we consider generalized Nash games where the associated constraint map is not necessarily self. The classical Nash equilibrium may not exist for such games and therefore we introduce the notion of best approximate solution…

The purpose of this paper is to prove the existence of solutions of quasi-equilibrium problems without any generalized monotonicity assumption. Additionally, we give an application to quasi-optimization problems.

The so-called measurement problem of quantum theory (QT) is still lacking a satisfactory, or at least widely agreed upon, solution. A number of theories, known as interpretations of quantum theory, have been proposed and found differing…

We construct several definitions of imbalance and playability, both of which are related to the existence of dominated strategies. Specifically, a maximally balanced game and a playable game cannot have dominated strategies for any player.…

In the time since a merger of quantum mechanics and game theory was proposed formally in 1999, the two distinct perspectives apparent in this merger of applying quantum mechanics to game theory, referred to henceforth as the theory of…

This paper provides a new version of matrix semi-tensor product method based on adjacent transpositions to test symmetric games. The advantage of using adjacent transpositions lies in the great simplification of analysis of symmetric games.…

We propose a benchmark suite for parity games that includes all benchmarks that have been used in the literature, and make it available online. We give an overview of the parity games, including a description of how they have been…

Quantum games have gained much popularity in the last two decades. Many of these quantum games are a redefinition of iconic classical games to fit the quantum world, and they gain many different properties and solutions in this different…

This paper considers the problem of solving infinite two-player games over finite graphs under various classes of progress assumptions motivated by applications in cyber-physical system (CPS) design. Formally, we consider a game graph G, a…

Many real-world multi-party negotiations unfold as sequences of binding, action-level commitments rather than a single final outcome, yet this regime remains under-studied in existing benchmarks. We introduce a benchmark and evaluation…

We give an algorithm for solving stochastic parity games with almost-sure winning conditions on {\it lossy channel systems}, under the constraint that both players are restricted to finite-memory strategies. First, we describe a general…

Parikh's game logic is a PDL-like fixpoint logic interpreted on monotone neighbourhood frames that represent the strategic power of players in determined two-player games. Game logic translates into a fragment of the monotone…

This work proposes a novel distributed approach for computing a Nash equilibrium in convex games with restricted strongly monotone pseudo-gradients. By leveraging the idea of the centralized operator extrapolation method presented in [4] to…

In a recent work on quantum state preparation, S{\o}rensen and colleagues explore the possibility of using video games to help design quantum control protocols. The authors present a game called "Quantum Moves" in which gamers have to move…

We study strategic interaction in data-driven games where players face uncertainty about payoff distributions inferred from finite samples. To model calibrated attitudes toward such uncertainty, we formulate distributionally robust games…

We consider parity games on infinite graphs where configurations are represented by control-states and integer vectors. This framework subsumes two classic game problems: parity games on vector addition systems with states (vass) and…

Multi-leader multi-follower games are a class of hierarchical games in which a collection of leaders compete in a Nash game constrained by the equilibrium conditions of another Nash game amongst the followers. The resulting equilibrium…

A new and relatively elementary approach is proposed for solving the problem of fair division of a continuous resource (measurable space, pie, etc.) between several participants, the selection criteria of which are described by charges…

It is known that the generalized Nash equilibrium problem can be reformulated as a quasivariational inequality. Our aim in this work is to introduce a variational approach to study the existence of solutions for generalized ordinal Nash…