Reasoning about Causality in Games

• URL: http://arxiv.org/abs/2301.02324v2
• Date: Mon, 17 Apr 2023 14:24:53 GMT
• Title: Reasoning about Causality in Games
• Authors: Lewis Hammond, James Fox, Tom Everitt, Ryan Carey, Alessandro Abate, Michael Wooldridge
• Abstract summary: Causal reasoning and game-theoretic reasoning are fundamental topics in artificial intelligence. We introduce mechanised games, which encode dependencies between agents' decision rules and the distributions governing the game. We describe correspondences between causal games and other formalisms, and explain how causal games can be used to answer queries that other causal or game-theoretic models do not support.
• Score: 63.930126666879396
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Causal reasoning and game-theoretic reasoning are fundamental topics in artificial intelligence, among many other disciplines: this paper is concerned with their intersection. Despite their importance, a formal framework that supports both these forms of reasoning has, until now, been lacking. We offer a solution in the form of (structural) causal games, which can be seen as extending Pearl's causal hierarchy to the game-theoretic domain, or as extending Koller and Milch's multi-agent influence diagrams to the causal domain. We then consider three key questions: i) How can the (causal) dependencies in games - either between variables, or between strategies - be modelled in a uniform, principled manner? ii) How may causal queries be computed in causal games, and what assumptions does this require? iii) How do causal games compare to existing formalisms? To address question i), we introduce mechanised games, which encode dependencies between agents' decision rules and the distributions governing the game. In response to question ii), we present definitions of predictions, interventions, and counterfactuals, and discuss the assumptions required for each. Regarding question iii), we describe correspondences between causal games and other formalisms, and explain how causal games can be used to answer queries that other causal or game-theoretic models do not support. Finally, we highlight possible applications of causal games, aided by an extensive open-source Python library.

Related papers

• Imperfect-Recall Games: Equilibrium Concepts and Their Complexity [74.01381499760288]
  We investigate optimal decision making under imperfect recall, that is, when an agent forgets information it once held before. In the framework of extensive-form games with imperfect recall, we analyze the computational complexities of finding equilibria in multiplayer settings.
  arXiv  Detail & Related papers  (2024-06-23T00:27:28Z)
• Characterising Interventions in Causal Games [1.2289361708127877]
  Causal games are probabilistic graphical models that enable causal queries to be answered in multi-agent settings. We demonstrate applications to the design of safe AI systems by considering causal mechanism design and commitment.
  arXiv  Detail & Related papers  (2024-06-13T16:55:07Z)
• Emergence and Causality in Complex Systems: A Survey on Causal Emergence and Related Quantitative Studies [12.78006421209864]
  Causal emergence theory employs measures of causality to quantify emergence. Two key problems are addressed: quantifying causal emergence and identifying it in data. We highlighted that the architectures used for identifying causal emergence are shared by causal representation learning, causal model abstraction, and world model-based reinforcement learning.
  arXiv  Detail & Related papers  (2023-12-28T04:20:46Z)
• Causal Question Answering with Reinforcement Learning [0.3499042782396683]
  Causal questions inquire about causal relationships between different events or phenomena. In this paper, we aim to answer causal questions with a causality graph. We introduce an Actor-Critic-based agent which learns to search through the graph to answer causal questions.
  arXiv  Detail & Related papers  (2023-11-05T20:33:18Z)
• The M\"obius game and other Bell tests for relativity [0.0]
  We derive multiparty games that, if the winning chance exceeds a certain limit, prove the incompatibility of the parties' causal relations with any partial order. We discuss these games as device-independent tests of spacetime's dynamical nature in general relativity.
  arXiv  Detail & Related papers  (2023-09-27T16:08:13Z)
• Emergent Communication: Generalization and Overfitting in Lewis Games [53.35045559317384]
  Lewis signaling games are a class of simple communication games for simulating the emergence of language. In these games, two agents must agree on a communication protocol in order to solve a cooperative task. Previous work has shown that agents trained to play this game with reinforcement learning tend to develop languages that display undesirable properties.
  arXiv  Detail & Related papers  (2022-09-30T09:50:46Z)
• A general framework for cyclic and fine-tuned causal models and their compatibility with space-time [2.0305676256390934]
  Causal modelling is a tool for generating causal explanations of observed correlations. Existing frameworks for quantum causality tend to focus on acyclic causal structures that are not fine-tuned. Cyclist causal models can be used to model physical processes involving feedback. Cyclist causal models may also be relevant in exotic solutions of general relativity.
  arXiv  Detail & Related papers  (2021-09-24T18:00:08Z)
• Systematic Evaluation of Causal Discovery in Visual Model Based Reinforcement Learning [76.00395335702572]
  A central goal for AI and causality is the joint discovery of abstract representations and causal structure. Existing environments for studying causal induction are poorly suited for this objective because they have complicated task-specific causal graphs. In this work, our goal is to facilitate research in learning representations of high-level variables as well as causal structures among them.
  arXiv  Detail & Related papers  (2021-07-02T05:44:56Z)
• Causal Expectation-Maximisation [70.45873402967297]
  We show that causal inference is NP-hard even in models characterised by polytree-shaped graphs. We introduce the causal EM algorithm to reconstruct the uncertainty about the latent variables from data about categorical manifest variables. We argue that there appears to be an unnoticed limitation to the trending idea that counterfactual bounds can often be computed without knowledge of the structural equations.
  arXiv  Detail & Related papers  (2020-11-04T10:25:13Z)
• From Checking to Inference: Actual Causality Computations as Optimization Problems [79.87179017975235]
  We present a novel approach to formulate different notions of causal reasoning, over binary acyclic models, as optimization problems. We show that both notions are efficiently automated. Using models with more than $8000$ variables, checking is computed in a matter of seconds, with MaxSAT outperforming ILP in many cases.
  arXiv  Detail & Related papers  (2020-06-05T10:56:52Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.