English
Related papers

Related papers: Perfect Commuting-Operator Strategies for Linear S…

200 papers

Escalation is a typical feature of infinite games. Therefore tools conceived for studying infinite mathematical structures, namely those deriving from coinduction are essential. Here we use coinduction, or backward coinduction (to show its…

Computer Science and Game Theory · Computer Science 2011-12-16 Pierre Lescanne , Perrinel Matthieu

In this paper, the known deterministic linear-quadratic Stackelberg game is revisited, whose open-loop Stackelberg solution actually possesses the nature of time inconsistency. To handle this time inconsistency, {a two-tier game framework…

Optimization and Control · Mathematics 2022-03-09 Yuan-Hua Ni , Liping Liu , Xinzhen Zhang

We train a single, goal-conditioned policy that can solve many robotic manipulation tasks, including tasks with previously unseen goals and objects. We rely on asymmetric self-play for goal discovery, where two agents, Alice and Bob, play a…

In~[1],authors considered a general finite horizon model of dynamic game of asymmetric information, where N players have types evolving as independent Markovian process, where each player observes its own type perfectly and actions of all…

Computer Science and Game Theory · Computer Science 2020-07-09 Deepanshu Vasal

We introduce a class of fully nonlinear mean field games posed in $[0,T]\times\mathbb{R}^d$. We justify that they are related to controlled local or nonlocal diffusions, and more generally in our setting, to a new control interpretation…

Analysis of PDEs · Mathematics 2024-08-30 Indranil Chowdhury , Espen R. Jakobsen , Miłosz Krupski

Combinatorial game theory (CGT), as introduced by Berlekamp, Conway and Guy, involves two players who move alternately in a perfect information, zero-sum game, and there are no chance devices. Also the games have the finite descent property…

Combinatorics · Mathematics 2018-10-09 Melissa Huggan , Richard J. Nowakowski , Paul Ottaway

We consider the problem of how to manipulate the entanglement properties of a general two-particle pure state, shared between Alice and Bob, by using only local operations at each end and classical communication between Alice and Bob. A…

Quantum Physics · Physics 2009-10-31 Lucien Hardy

The set $\mathcal{Q}$ of quantum correlations is the collection of all possible probability distributions on measurement outcomes achievable by space-like separated parties sharing a quantum state. Since the original work of Tsirelson…

Quantum Physics · Physics 2026-03-31 Sacha Cerf , Harold Ollivier

We consider quantum XOR games, defined in [11], from the perspective of unitary correlations defined in [7]. We show that Connes' embedding problem has a positive answer if and only if every quantum XOR game has entanglement bias equal to…

Operator Algebras · Mathematics 2018-01-11 Samuel J. Harris

The class of totally balanced games is a class of transferable-utility coalitional games providing important models of cooperative behavior used in mathematical economics. They coincide with market games of Shapley and Shubik and every…

Combinatorics · Mathematics 2021-03-01 Tomáš Kroupa , Milan Studený

We study some ergodicity property of zero-sum stochastic games with a finite state space and possibly unbounded payoffs. We formulate this property in operator-theoretical terms, involving the solvability of an optimality equation for the…

Optimization and Control · Mathematics 2018-11-15 Antoine Hochart

We study the problem of finding equilibrium strategies in multi-agent games with incomplete payoff information, where the payoff matrices are only known to the players up to some bounded uncertainty sets. In such games, an ex-post…

Computer Science and Game Theory · Computer Science 2020-07-14 Wenshuo Guo , Mihaela Curmei , Serena Wang , Benjamin Recht , Michael I. Jordan

This paper proposes a new method for finding closed-loop saddle points in zero-sum linear-quadratic stochastic differential games by decoupling their inherent structure. Specifically, we develop a nested iterative scheme that constructs a…

Optimization and Control · Mathematics 2025-12-10 Yiyuan Wang

We prove a Tauberian theorem for nonexpansive operators, and apply it to the model of zero-sum stochastic game. Under mild assumptions, we prove that the value of the lambda-discounted game v_{lambda} converges uniformly when lambda goes to…

Optimization and Control · Mathematics 2015-02-24 Bruno Ziliotto

In this paper, we study a non-zero-sum game with two players, where each of the players plays what we call Bermudan strategies and optimizes a general non-linear assessment functional of the pay-off. By using a recursive construction, we…

Optimization and Control · Mathematics 2023-11-03 Miryana Grigorova , Marie-Claire Quenez , Yuan Peng

We investigate a new class of congestion games, called Totally Unimodular (TU) Congestion Games, where the players' strategies are binary vectors inside polyhedra defined by totally unimodular constraint matrices. Network congestion games…

Computer Science and Game Theory · Computer Science 2016-07-29 Alberto Del Pia , Michael Ferris , Carla Michini

Zero-sum stochastic games have found important applications in a variety of fields, from machine learning to economics. Work on this model has primarily focused on the computation of Nash equilibrium due to its effectiveness in solving…

Computer Science and Game Theory · Computer Science 2022-11-28 Denizalp Goktas , Jiayi Zhao , Amy Greenwald

This article examines mean-field-type game problems by means of a direct method. We provide various solvable examples beyond the classical linear-quadratic game problems. These include quadratic-quadratic games and games with power,…

Optimization and Control · Mathematics 2019-04-23 Julian Barreiro-Gomez , Tyrone E. Duncan , Bozenna Pasik-Duncan , Hamidou Tembine

The Stackelberg equilibrium solution concept describes optimal strategies to commit to: Player 1 (termed the leader) publicly commits to a strategy and Player 2 (termed the follower) plays a best response to this strategy (ties are broken…

Computer Science and Game Theory · Computer Science 2016-08-24 Branislav Bosansky , Simina Branzei , Kristoffer Arnsfelt Hansen , Peter Bro Miltersen , Troels Bjerre Sorensen

Mirror games were invented by Garg and Schnieder (ITCS 2019). Alice and Bob take turns (with Alice playing first) in declaring numbers from the set {1,2, ...2n}. If a player picks a number that was previously played, that player loses and…

Computational Complexity · Computer Science 2023-07-14 Roey Magen , Moni Naor
‹ Prev 1 4 5 6 7 8 10 Next ›