相关论文: Uniform Value for Recursive Games with Compact Act…

We obtain global, non-asymptotic convergence guarantees for independent learning algorithms in competitive reinforcement learning settings with two agents (i.e., zero-sum stochastic games). We consider an episodic setting where in each…

We consider a finite state, finite action, zero-sum stochastic games with data defining the game lying in the ordered field of algebraic numbers. In both the discounted and the limiting average versions of these games we prove that the…

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…

In this note we prove the uniqueness of solutions to a class of Mean Field Games systems subject to possibly degenerate individual noise. Our results hold true for arbitrary long time horizons and for general non-separable Hamiltonians that…

This paper introduces the concept of perfect monotone equilibrium in Bayesian games, which refines the standard monotone equilibrium by accounting for the possibility of unintended moves (trembling hand) and thereby enhancing robustness to…

We study minority games in efficient regime. By incorporating the utility function and aggregating agents with similar strategies we develop an effective mesoscale notion of state of the game. Using this approach, the game can be…

We consider game theory from the perspective of quantum algorithms. Strategies in classical game theory are either pure (deterministic) or mixed (probabilistic). We introduce these basic ideas in the context of a simple example, closely…

Complex reasoning problems are most clearly and easily specified using logical rules, but require recursive rules with aggregation such as count and sum for practical applications. Unfortunately, the meaning of such rules has been a…

We consider concurrent games played on graphs. At every round of a game, each player simultaneously and independently selects a move; the moves jointly determine the transition to a successor state. Two basic objectives are the safety…

A retrospective analysis process for the mean field games system (MFGS) is considered. For the first time, Carleman estimates are applied to the analysis of the MFGS. Two new Carleman estimates are derived. They allow to obtain the…

We consider a class of nonlocal games that are related to binary constraint systems (BCSs) in a manner similar to the games implicit in the work of Mermin [N.D. Mermin, "Simple unified form for the major no-hidden-variables theorems," Phys.…

We study two-player zero-sum repeated games with incomplete information on one side, where the payoff function is tail measurable (and not necessarily the long-run average payoff). We show that the maxmin value equals the concavification of…

We introduce a contractive abstract dynamic programming framework and related policy iteration algorithms, specifically designed for sequential zero-sum games and minimax problems with a general structure. Aside from greater generality, the…

I discuss classical and quantum recurrence theorems in a unified manner, treating both as generalisations of the fact that a system with a finite state space only has so many places to go. Along the way I prove versions of the recurrence…

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…

Game theory provides a mathematical framework for analysing strategic situations involving at least two players. Normal-form games model situations where the players simultaneously pick their moves. In this thesis we explore the strategic…

We define and analyze the notion of variational Wardrop equilibrium for nonatomic aggregative games with an infinity of players types. These equilibria are characterized through an infinite-dimensional variational inequality. We show, under…

We prove that the family of embezzlement states defined by van Dam and Hayden [vanDamHayden2002] is universal for both quantum and classical entangled two-prover non-local games with an arbitrary number of rounds. More precisely, we show…

Consider a very simple class of (finite) games: after an initial move by nature, each player makes one move. Moreover, the players have common interests: at each node, all the players get the same payoff. We show that the problem of…

We present a strong parallel repetition theorem for the entangled value of multi-player, one-round free games (games where the inputs come from a product distribution). Our result is the first parallel repetition theorem for entangled games…