English
Related papers

Related papers: Unattainability of Common Knowledge in Asymmetric …

200 papers

The aim of this paper is to investigate the interplay between knowledge shared by a group of agents and its coalition ability. We investigate this relation in the standard context of imperfect information concurrent game. We assume that…

Artificial Intelligence · Computer Science 2016-11-28 Guifei Jiang , Dongmo Zhang , Laurent Perrussel

When learning in strategic environments, a key question is whether agents can overcome uncertainty about their preferences to achieve outcomes they could have achieved absent any uncertainty. Can they do this solely through interactions…

Computer Science and Game Theory · Computer Science 2024-11-21 Nivasini Ananthakrishnan , Nika Haghtalab , Chara Podimata , Kunhe Yang

In this paper we study the problem of information sharing among rational self-interested agents as a dynamic game of asymmetric information. We assume that the agents imperfectly observe a Markov chain and they are called to decide whether…

Computer Science and Game Theory · Computer Science 2021-03-30 Konstantinos Ntemos , George Pikramenos , Nicholas Kalouptsidis

Infinite games where several players seek to coordinate under imperfect information are deemed to be undecidable, unless the information is hierarchically ordered among the players. We identify a class of games for which joint winning…

Computer Science and Game Theory · Computer Science 2015-07-29 Dietmar Berwanger , Anup Basil Mathew

We investigate quantum games in which the information is asymmetrically distributed among the players, and find the possibility of the quantum game outperforming its classical counterpart depends strongly on not only the entanglement, but…

Quantum Physics · Physics 2007-05-23 Jiangfeng Du , Hui Li , Chenyong Ju

Common knowledge is crucial for safe group coordination. In its absence, humans must rely on shared knowledge, which is inherently limited in depth and therefore prone to coordination failures, because any finite-order knowledge attribution…

Multiagent Systems · Computer Science 2025-11-12 Thomas Bolander , Robin Engelhardt , Thomas S. Nicolet

A general model for zero-sum stochastic games with asymmetric information is considered. In this model, each player's information at each time can be divided into a common information part and a private information part. Under certain…

Systems and Control · Electrical Eng. & Systems 2019-12-25 Dhruva Kartik , Ashutosh Nayyar

Standard game theory assumes that the structure of the game is common knowledge among players. We relax this assumption by considering extensive games where agents may be unaware of the complete structure of the game. In particular, they…

Computer Science and Game Theory · Computer Science 2007-05-23 Joseph Y. Halpern , Leandro C. Rêgo

We study a model of games that combines concurrency, imperfect information and stochastic aspects. Those are finite states games in which, at each round, the two players choose, simultaneously and independently, an action. Then a successor…

Formal Languages and Automata Theory · Computer Science 2011-08-31 Vincent Gripon , Olivier Serre

This paper examines strategic trading under incomplete information, where firms lack full knowledge of key aspects of their competitors' trading strategies such as target sizes and market impact models. We extend previous work on…

Trading and Market Microstructure · Quantitative Finance 2025-03-25 Neil A. Chriss

Infinite games with imperfect information are known to be undecidable unless the information flow is severely restricted. One fundamental decidable case occurs when there is a total ordering among players, such that each player has access…

Computer Science and Game Theory · Computer Science 2016-07-19 Dietmar Berwanger , Anup Basil Mathew , Marie van den Bogaard

Developing autonomous agents that can strategize and cooperate with humans under information asymmetry is challenging without effective communication in natural language. We introduce a shared-control game, where two players collectively…

Artificial Intelligence · Computer Science 2024-06-04 Shenghui Chen , Daniel Fried , Ufuk Topcu

We study the value and the optimal strategies for a two-player zero-sum optimal stopping game with incomplete and asymmetric information. In our Bayesian set-up, the drift of the underlying diffusion process is unknown to one player…

Probability · Mathematics 2020-07-15 Tiziano De Angelis , Erik Ekström , Kristoffer Glover

Information asymmetry in games enables players with the information advantage to manipulate others' beliefs by strategically revealing information to other players. This work considers a double-sided information asymmetry in a Bayesian…

Computer Science and Game Theory · Computer Science 2023-08-29 Tao Li , Quanyan Zhu

This paper considers an infinitely repeated three-player Bayesian game with lack of information on two sides, in which an informed player plays two zero-sum games simultaneously at each stage against two uninformed players. This is a…

Theoretical Economics · Economics 2023-03-10 Lucas Pahl

Though a lot of work in multi-agent systems is focused on reasoning about knowledge and beliefs of artificial agents, an explicit representation and reasoning about the presence/absence of agents, especially in the scenarios where agents…

Multiagent Systems · Computer Science 2020-01-23 Shikha Singh , Deepak Khemani

We consider two simple variants of a framework for reasoning about knowledge amongst communicating groups of players. Our goal is to clarify the resulting epistemic issues. In particular, we investigate what is the impact of common…

Logic in Computer Science · Computer Science 2009-07-03 Krzysztof R. Apt , Andreas Witzel , Jonathan A. Zvesper

We consider a class of two-player dynamic stochastic nonzero-sum games where the state transition and observation equations are linear, and the primitive random variables are Gaussian. Each controller acquires possibly different dynamic…

Systems and Control · Computer Science 2014-01-21 Abhishek Gupta , Ashutosh Nayyar , Cedric Langbort , Tamer Basar

We consider two-player games with imperfect information and the synthesis of a randomized strategy for one player that ensures the objective is satisfied almost-surely (i.e., with probability 1), regardless of the strategy of the other…

Computer Science and Game Theory · Computer Science 2024-07-30 Laurent Doyen , Thomas Soullard

Blameworthiness of an agent or a coalition of agents is often defined in terms of the principle of alternative possibilities: for the coalition to be responsible for an outcome, the outcome must take place and the coalition should have had…

Artificial Intelligence · Computer Science 2019-03-28 Pavel Naumov , Jia Tao
‹ Prev 1 2 3 10 Next ›