English
Related papers

Related papers: Information Compression in Dynamic Games

200 papers

We study finite-horizon two-player zero-sum differential games with one-sided payoff information ($G$), where the informed player (P1) knows the game payoff, while P2 only has a public belief over a finite set of possible payoffs. In this…

Computer Science and Game Theory · Computer Science 2026-05-06 Mukesh Ghimire , Zhe Xu , Yi Ren

We study a class of two-player repeated games with incomplete information and informational externalities. In these games, two states are chosen at the outset, and players get private information on the pair, before engaging in repeated…

Probability · Mathematics 2010-07-27 Dinah Rosenberg , Eilon Solan , Nicolas Vieille

This paper aims to solve two fundamental problems on finite or infinite horizon dynamic games with perfect or almost perfect information. Under some mild conditions, we prove (1) the existence of subgame-perfect equilibria in general…

Economics · Quantitative Finance 2015-04-01 Wei He , Yeneng Sun

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 study the computational complexity of solving stochastic games with mean-payoff objectives. Instead of identifying special classes in which simple strategies are sufficient to play $\epsilon$-optimally, or form $\epsilon$-Nash…

Computer Science and Game Theory · Computer Science 2024-05-16 Sougata Bose , Rasmus Ibsen-Jensen , Patrick Totzke

We study zero-sum differential games with state constraints and one-sided information, where the informed player (Player 1) has a categorical payoff type unknown to the uninformed player (Player 2). The goal of Player 1 is to minimize his…

Computer Science and Game Theory · Computer Science 2024-06-05 Mukesh Ghimire , Lei Zhang , Zhe Xu , Yi Ren

We consider imperfect information stochastic games where we require the players to use pure (i.e. non randomised) strategies. We consider reachability, safety, B\"uchi and co-B\"uchi objectives, and investigate the existence of…

Formal Languages and Automata Theory · Computer Science 2018-03-28 Arnaud Carayol , Christof Löding , Olivier Serre

The goal of agents in multi-agent environments is to maximize total reward against the opposing agents that are encountered. Following a game-theoretic solution concept, such as Nash equilibrium, may obtain a strong performance in some…

Computer Science and Game Theory · Computer Science 2026-01-05 Sam Ganzfried

We present a new model of incomplete information games without private information in which the players use a distributionally robust optimization approach to cope with the payoff uncertainty. With some specific restrictions, we show that…

Computer Science and Game Theory · Computer Science 2016-10-04 Nicolas Loizou

This paper analyzes a finite horizon dynamic signaling game motivated by the well-known strategic information transmission problems in economics. The mathematical model involves information transmission between two agents, a sender who…

Systems and Control · Computer Science 2016-11-17 Muhammed Sayin , Emrah Akyol , Tamer Basar

Dynamic zero-sum games are an important class of problems with applications ranging from evasion-pursuit and heads-up poker to certain adversarial versions of control problems such as multi-armed bandit and multiclass queuing problems.…

Computer Science and Game Theory · Computer Science 2015-06-12 Martin Haugh , Chun Wang

We propose a learning dynamics to model how strategic agents repeatedly play a continuous game while relying on an information platform to learn an unknown payoff-relevant parameter. In each time step, the platform updates a belief estimate…

Multiagent Systems · Computer Science 2023-11-02 Manxi Wu , Saurabh Amin , Asuman Ozdaglar

This paper investigates how an autonomous agent can transmit information through its motion in an adversarial setting. We consider scenarios where an agent must reach its goal while deceiving an intelligent observer about its destination.…

Systems and Control · Electrical Eng. & Systems 2025-06-17 Violetta Rostobaya , James Berneburg , Yue Guan , Michael Dorothy , Daigo Shishika

Bayesian rationality in strategic games presumes that it is possible to translate strategic uncertainty into imperfect information. Correlated equilibrium is guided by the idea that players are Bayes rational, have a common prior, and…

Computer Science and Game Theory · Computer Science 2016-02-02 Gabriel Frahm

This work considers a novel information design problem and studies how the craft of payoff-relevant environmental signals solely can influence the behaviors of intelligent agents. The agents' strategic interactions are captured by an…

Multiagent Systems · Computer Science 2021-02-16 Tao Zhang , Quanyan Zhu

Consider an analyst who models a strategic situation using an incomplete information game. The true game may involve correlated, duplicated belief hierarchies, but the analyst lacks knowledge of the correlation structure and can only…

Theoretical Economics · Economics 2026-03-13 Stephen Morris , Takashi Ui

Among the strategic choices made by today's economic actors are choices about algorithms and computational resources. Different access to computational resources may result in a kind of economic asymmetry analogous to information asymmetry.…

Computer Science and Game Theory · Computer Science 2012-06-14 Sebastian Benthall , John Chuang

There has been a recent surge of interest in the role of information in strategic interactions. Much of this work seeks to understand how the realized equilibrium of a game is influenced by uncertainty in the environment and the information…

Computer Science and Game Theory · Computer Science 2014-07-22 Shaddin Dughmi

Modeling the interaction between traffic agents is a key issue in designing safe and non-conservative maneuvers in autonomous driving. This problem can be challenging when multi-modality and behavioral uncertainties are engaged. Existing…

Robotics · Computer Science 2024-09-24 Zhenmin Huang , Tong Li , Shaojie Shen , Jun Ma

The classical, complete-information two-player games assume that the problem data (in particular the payoff matrix) is known exactly by both players. In a now famous result, Nash has shown that any such game has an equilibrium in mixed…

Computer Science and Game Theory · Computer Science 2015-12-11 Nicolas Loizou