Related papers: Characterizing Solution Concepts in Terms of Commo…

We study the problem of computing all Nash equilibria of a subclass of finite normal form games. With algebraic characterization of the games, we present a method for computing all its Nash equilibria. Further, we present a method for…

Chance-constrained correlated equilibrium enables coordination of noncooperative agents under cost uncertainty through probabilistic incentive-compatibility guarantees. However, computing such equilibria becomes intractable in large-scale…

In game theory, the concept of Nash equilibrium reflects the collective stability of some individual strategies chosen by selfish agents. The concept pertains to different classes of games, e.g. the sequential games, where the agents play…

We solve the equivariant generalized Nash problem for any non-rational normal variety with torus action of complexity one. Namely, we give an explicit combinatorial description of the Nash order on the set of equivariant divisorial…

Computational tractability and social welfare (aka. efficiency) of equilibria are two fundamental but in general orthogonal considerations in algorithmic game theory. Nevertheless, we show that when (approximate) full efficiency can be…

The Perfectly Transparent Equilibrium is algorithmically defined, for any game in normal form with perfect information and no ties, as the iterated deletion of non-individually-rational strategy profiles until at most one remains. In this…

Sequential equilibrium is one of the most fundamental refinements of Nash equilibrium for games in extensive form. However, it is not defined for extensive-form games in which a player can choose among a continuum of actions. We define a…

In this paper we review our earlier work on quantum computing and the Nash Equilibrium, in particular, tracing the history of the discovery of new Nash Equilibria and then reviewing the ways in which quantum computing may be expected to…

The Generalized Nash Equilibrium Problem refers to the question of the existence of a Nash equilibrium in an abstract economy. This model is due to Kenneth J. Arrow and Gerard Debreu in their pioneering work from 1954. An abstract economy…

We study a particular class of mean field games whose solutions can be formally connected to a scalar transport equation on the Wasserstein space of measures. For this class, we construct some interesting explicit examples of non-uniqueness…

In this work, we present a novel characterization of approximate Nash equilibria in a class of convex games over the simplex. To achieve this, we regularize the utility functions using the Shannon entropy term, connect the solutions to the…

Temporal commonsense reasoning refers to the ability to understand the typical temporal context of phrases, actions, and events, and use it to reason over problems requiring such knowledge. This trait is essential in temporal natural…

We define generalized quantum games by introducing the coherent payoff operators and propose a simple scheme to illustrate it. The scheme is implemented with a single spin qubit system and two entangled qubit system. The Nash Equilibrium…

This article is devoted to various methods (optimal transport, fixed-point, ordinary differential equations) to obtain existence and/or uniqueness of Cournot-Nash equilibria for games with a continuum of players with both attractive and…

Methods of exploring Nash equilibrium in quantum games are studied. Analytical conditions of the existence, the uniqueness or the multiplicity of the equilibria are found.

This paper presents the concepts of exact, null, and approximate controllability in the Stackelberg-Nash sense for abstract forward and backward stochastic evolution equations, involving two types of controls: leaders and followers. We…

Generalized structural equations models (GSEMs) [Peters and Halpern 2021], are, as the name suggests, a generalization of structural equations models (SEMs). They can deal with (among other things) infinitely many variables with infinite…

Strategic games admit a multi-graph representation, in which two kinds of relations, accessibility, and preferences, are used to describe how the players compare the possible outcomes. A category of games with a fixed set of players…

In 2016 Aussel, Sultana and Vetrivel developed the concept of projected solution for quasi-variational inequality problems and projected Nash equilibrium. We introduce a new concept of solution for quasi-equilibrium problems and we study…

In this paper, we examine the robustness of Nash equilibria in continuous games, under both strategic and dynamic uncertainty. Starting with the former, we introduce the notion of a robust equilibrium as those equilibria that remain…