English
Related papers

Related papers: Dealing with imperfect information in Strategy Log…

200 papers

In imperfect information games, the evaluation of a game state not only depends on the observable world but also relies on hidden parts of the environment. As accessing the obstructed information trivialises state evaluations, one approach…

Artificial Intelligence · Computer Science 2024-07-15 Timo Bertram , Johannes Fürnkranz , Martin Müller

In their seminal work, Nayyar et al. (2013) showed that imperfect information can be abstracted away from common-payoff games by having players publicly announce their policies as they play. This insight underpins sound solvers and…

Computer Science and Game Theory · Computer Science 2023-08-02 Samuel Sokota , Ryan D'Orazio , Chun Kai Ling , David J. Wu , J. Zico Kolter , Noam Brown

Alternating-time temporal logics (ATL/ATL*) represent a family of modal logics for reasoning about agents' strategic abilities in multiagent systems (MAS). The interpretations of ATL/ATL* over the semantic model Concurrent Game Structures…

Artificial Intelligence · Computer Science 2018-11-28 Yedi Zhang , Fu Song , Taolue Chen

We analyze different ways of pairing agents in a bipartite matching problem, with regard to its scaling properties and to the distribution of individual ``satisfactions''. Then we explore the role of partial information and bounded…

Statistical Mechanics · Physics 2009-11-10 Paolo Laureti , Yi-Cheng Zhang

This paper studies the synthesis of control policies for an agent that has to satisfy a temporal logic specification in a partially observable environment, in the presence of an adversary. The interaction of the agent (defender) with the…

Systems and Control · Computer Science 2019-03-19 Bhaskar Ramasubramanian , Andrew Clark , Linda Bushnell , Radha Poovendran

We propose "semantic labelling" as a novel ingredient for solving games in the context of LTL synthesis. It exploits recent advances in the automata-based approach, yielding more information for each state of the generated parity game than…

Logic in Computer Science · Computer Science 2019-07-30 Jan Křetínský , Alexander Manta , Tobias Meggendorfer

Limited lookahead has been studied for decades in perfect-information games. We initiate a new direction via two simultaneous deviation points: generalization to imperfect-information games and a game-theoretic approach. We study how one…

Computer Science and Game Theory · Computer Science 2020-03-20 Christian Kroer , Tuomas Sandholm

When creating policies, plans, or designs for people, it is challenging for designers to foresee all of the ways in which people may reason and behave. Recently, Large Language Models (LLMs) have been shown to be able to simulate human…

Human-Computer Interaction · Computer Science 2024-07-03 Karthik Sreedhar , Lydia Chilton

It is desirable for an agent to be able to solve a rich variety of problems that can be specified through language in the same environment. A popular approach towards obtaining such agents is to reuse skills learned in prior tasks to…

Machine Learning · Computer Science 2024-03-19 Geraud Nangue Tasse , Devon Jarvis , Steven James , Benjamin Rosman

This paper presents a comprehensive survey of the current status and opportunities for Large Language Models (LLMs) in strategic reasoning, a sophisticated form of reasoning that necessitates understanding and predicting adversary actions…

Computation and Language · Computer Science 2024-04-02 Yadong Zhang , Shaoguang Mao , Tao Ge , Xun Wang , Adrian de Wynter , Yan Xia , Wenshan Wu , Ting Song , Man Lan , Furu Wei

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

We describe an algorithm for computing best response strategies in a class of two-player infinite games of incomplete information, defined by payoffs piecewise linear in agents' types and actions, conditional on linear comparisons of…

Computer Science and Game Theory · Computer Science 2012-07-19 Daniel Reeves , Michael P. Wellman

Model checking of strategic abilities is a notoriously hard problem, even more so in the realistic case of agents with imperfect information, acting in a stochastic environment. Assume-guarantee reasoning can be of great help here,…

Multiagent Systems · Computer Science 2025-11-17 Wojciech Jamroga , Damian Kurpiewski , Łukasz Mikulski

We introduce some new logics of imperfect information by adding atomic formulas corresponding to inclusion and exclusion dependencies to the language of first order logic. The properties of these logics and their relationships with other…

Logic · Mathematics 2011-06-14 Pietro Galliani

Researchers have started using LLM agents in place of human subjects in behavioural and political-science experiments, often as a cheaper substitute for laboratory pools. The substitution does not hold up in strategic settings: humans and…

General Economics · Economics 2026-05-27 Po Han Teo

In this paper we investigate a game of optimal stopping with incomplete information. There are two players of which only one is informed about the precise structure of the game. Observing the informed player the uninformed player is given…

Optimization and Control · Mathematics 2012-07-11 Christine Grün

The article introduces a notion of a stochastic game with failure states and proposes two logical systems with modality "coalition has a strategy to transition to a non-failure state with a given probability while achieving a given goal."…

Artificial Intelligence · Computer Science 2019-10-11 Pavel Naumov , Kevin Ros

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

Dynamic Epistemic Logic (DEL) is a logical framework in which one can describe in great detail how actions are perceived by the agents, and how they affect the world. DEL games were recently introduced as a way to define classes of games…

Logic in Computer Science · Computer Science 2020-01-22 Bastien Maubert , Aniello Murano , Sophie Pinchinat , François Schwarzentruber , Silvia Stranieri

Temporal stream logic (TSL) extends LTL with updates and predicates over arbitrary function terms. This allows for specifying data-intensive systems for which LTL is not expressive enough. In the semantics of TSL, functions and predicates…

Logic in Computer Science · Computer Science 2022-01-26 Bernd Finkbeiner , Philippe Heim , Noemi Passing
‹ Prev 1 3 4 5 6 7 10 Next ›