English
Related papers

Related papers: Synthesising Full-Information Protocols

200 papers

Secure equilibrium is a refinement of Nash equilibrium, which provides some security to the players against deviations when a player changes his strategy to another best response strategy. The concept of secure equilibrium is specifically…

Computer Science and Game Theory · Computer Science 2014-05-08 Julie De Pril , János Flesch , Jeroen Kuipers , Gijs Schoenmakers , Koos Vrieze

We study information design in games where players choose from a continuum of actions and have continuously differentiable payoffs. We show that an information structure is optimal when the equilibrium it induces can also be implemented in…

Theoretical Economics · Economics 2026-04-23 Alex Smolin , Takuro Yamashita

In settings with incomplete information, players can find it difficult to coordinate to find states with good social welfare. For example, in financial settings, if a collection of financial firms have limited information about each other's…

Computer Science and Game Theory · Computer Science 2014-09-01 Avrim Blum , Jamie Morgenstern , Ankit Sharma , Adam Smith

This paper investigates the implementation and performance of a decentralized information transmission mechanism in game with complete or incomplete games. We propose a mechanism that realizes irrational correlated equilibria or irrational…

Theoretical Economics · Economics 2025-11-12 Shitong Wang

Covert planning refers to a class of constrained planning problems where an agent aims to accomplish a task with minimal information leaked to a passive observer to avoid detection. However, existing methods of covert planning often…

Multiagent Systems · Computer Science 2023-11-02 Haoxiang Ma , Chongyang Shi , Shuo Han , Michael R. Dorothy , Jie Fu

We study two-player security games which can be viewed as sequences of nonzero-sum matrix games played by an Attacker and a Defender. The evolution of the game is based on a stochastic fictitious play process. Players do not have access to…

Computer Science and Game Theory · Computer Science 2010-03-16 Kien C. Nguyen , Tansu Alpcan , Tamer Basar

We study the problem of synthesizing strategies for a mobile sensor network to conduct surveillance in partnership with static alarm triggers. We formulate the problem as a multi-agent reactive synthesis problem with surveillance objectives…

Artificial Intelligence · Computer Science 2019-02-08 Suda Bharadwaj , Rayna Dimitrova , Ufuk Topcu

We introduce a "high probability" framework for repeated games with incomplete information. In our non-equilibrium setting, players aim to guarantee a certain payoff with high probability, rather than in expected value. We provide a high…

Computer Science and Game Theory · Computer Science 2015-09-30 Payam Delgosha , Amin Gohari , Mohammad Akbarpour

In the timeline-based approach to planning, the evolution over time of a set of state variables (the timelines) is governed by a set of temporal constraints. Traditional timeline-based planning systems excel at the integration of planning…

Artificial Intelligence · Computer Science 2024-09-04 Renato Acampora , Luca Geatti , Nicola Gigante , Angelo Montanari , Valentino Picotti

We introduce and study an evolutionary complementarity game where in each round a player of population 1 is paired with a member of population 2. The game is symmetric, and each player tries to obtain an advantageous deal, but when one of…

Adaptation and Self-Organizing Systems · Physics 2015-06-26 Juergen Jost , Wei Li

We study a two-player, zero-sum, dynamic game with incomplete information where one of the players is more informed than his opponent. We analyze the limit value as the players play more and more frequently. The more informed player…

Optimization and Control · Mathematics 2015-09-14 Fabien Gensbittel

In dynamic games with asymmetric information structure, the widely used concept of equilibrium is perfect Bayesian equilibrium (PBE). This is expressed as a strategy and belief pair that simultaneously satisfy sequential rationality and…

Computer Science and Game Theory · Computer Science 2016-09-15 Abhinav Sinha , Achilleas Anastasopoulos

Consider a two-player game repeated N times. Player 1 can choose between two styles (for interpretability, offensive and defensive), whereas Player 2 uses a single fixed style. Let X N\,:= \#wins -\#losses for Player 1 after N games, and…

Computer Science and Game Theory · Computer Science 2026-04-20 Jonatha ANSELMI , Bruno Gaujal

Robots and autonomous systems must interact with one another and their environment to provide high-quality services to their users. Dynamic game theory provides an expressive theoretical framework for modeling scenarios involving multiple…

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

In this paper, we consider the problem of synthesis of maximally permissive covert damage-reachable attackers in the setup where the model of the supervisor is unknown to the adversary but the adversary has recorded a (prefix-closed) finite…

Systems and Control · Electrical Eng. & Systems 2021-06-24 Ruochen Tai , Liyong Lin , Yuting Zhu , Rong Su

We study a general class of dynamic multi-agent decision problems with asymmetric information and non-strategic agents, which includes dynamic teams as a special case. When agents are non-strategic, an agent's strategy is known to the other…

Multiagent Systems · Computer Science 2018-12-05 Hamidreza Tavafoghi , Yi Ouyang , Demosthenis Teneketzis

Synthesis of bulletproof strategies in imperfect information scenarios is a notoriously hard problem. In this paper, we suggest that it is sometimes a viable alternative to aim at "reasonably good" strategies instead. This makes sense not…

Multiagent Systems · Computer Science 2023-10-26 Wojciech Jamroga , Damian Kurpiewski

Recently, in [K.R. Apt and S. Simon: Well-founded extensive games with perfect information, TARK21], we studied well-founded games, a natural extension of finite extensive games with perfect information in which all plays are finite. We…

Computer Science and Game Theory · Computer Science 2023-07-18 Krzysztof R. Apt , Sunil Simon

The sequential equilibrium is a standard solution concept for extensive-form games with imperfect information that includes an explicit representation of the players' beliefs. An assessment consisting of a strategy and a belief is a…

Computer Science and Game Theory · Computer Science 2024-02-08 Moritz Graf , Thorsten Engesser , Bernhard Nebel