English
Related papers

Related papers: Informational Robustness of Common Belief in Ratio…

200 papers

We investigate the degree to which human plausibility judgments of multiple-choice commonsense benchmark answers are subject to influence by (im)plausibility arguments for or against an answer, in particular, using rationales generated by…

Computation and Language · Computer Science 2026-02-25 Shramay Palta , Peter Rankel , Sarah Wiegreffe , Rachel Rudinger

At the beginning of a dynamic game, players may have exogenous theories about how the opponents are going to play. Suppose that these theories are commonly known. Then, players will refine their first-order beliefs, and challenge their own…

Computer Science and Game Theory · Computer Science 2017-07-28 Emiliano Catonini

Conformal predictors provide set or functional predictions that are valid under the assumption of randomness, i.e., under the assumption of independent and identically distributed data. The question asked in this paper is whether there are…

Machine Learning · Computer Science 2025-06-10 Vladimir Vovk

In real-world applications, knowledge bases consisting of all the information at hand for a specific domain, along with the current state of affairs, are bound to contain contradictory data coming from different sources, as well as data…

Logic in Computer Science · Computer Science 2014-01-08 Paulo Shakarian , Gerardo I. Simari , Marcelo A. Falappa

We study the problem of assessing the robustness of counterfactual explanations for deep learning models. We focus on $\textit{plausible model shifts}$ altering model parameters and propose a novel framework to reason about the robustness…

Machine Learning · Computer Science 2024-07-11 Luca Marzari , Francesco Leofante , Ferdinando Cicalese , Alessandro Farinelli

A common assumption in belief revision is that the reliability of the information sources is either given, derived from temporal information, or the same for all. This article does not describe a new semantics for integration but the…

Artificial Intelligence · Computer Science 2021-04-09 Paolo Liberatore

The accuracies for many pattern recognition tasks have increased rapidly year by year, achieving or even outperforming human performance. From the perspective of accuracy, pattern recognition seems to be a nearly-solved problem. However,…

Computer Vision and Pattern Recognition · Computer Science 2020-06-15 Xu-Yao Zhang , Cheng-Lin Liu , Ching Y. Suen

This paper proposes a belief-based framework for social norms in environments where individuals choose a single action. Relaxing the assumption that the appropriateness standard is common knowledge, the framework allows individuals to be…

Theoretical Economics · Economics 2026-04-30 Senran Lin

A fundamental question in causal inference is whether it is possible to reliably infer manipulation effects from observational data. There are a variety of senses of asymptotic reliability in the statistical literature, among which the most…

Artificial Intelligence · Computer Science 2012-12-12 Jiji Zhang , Peter L. Spirtes

We introduce a way of quantifying how informative a quantum measurement is, starting from a resource-theoretic perspective. This quantifier, which we call the robustness of measurement, describes how much `noise' must be added to a…

Quantum Physics · Physics 2019-04-17 Paul Skrzypczyk , Noah Linden

This paper provides an analysis of different formal representations of beliefs in epistemic game theory. The aim is to attempt a synthesis of different structures of beliefs in the presence of indeterminate probabilities. Special attention…

Computer Science and Game Theory · Computer Science 2013-09-09 Yang Liu

We introduce a robust belief-based measure of complexity. The idea is that task A is deemed more complex than task B if the probability of solving A correctly is smaller than the probability of solving B correctly regardless of the reward.…

Theoretical Economics · Economics 2025-01-17 Egor Bronnikov , Elias Tsakas

We define notions of cautiousness and cautious belief to provide epistemic conditions for iterated admissibility in finite games. We show that iterated admissibility characterizes the behavioral implications of "cautious rationality and…

Theoretical Economics · Economics 2023-05-25 Emiliano Catonini , Nicodemo De Vito

We study cautious reasoning in finite sequential games played by agents with perfect recall. Our contribution lies in formulating a definition of prudent rationalizability (Heifetz et al. 2021, BEJTE) as an iterative reduction procedure of…

Computer Science and Game Theory · Computer Science 2025-12-01 Nicodemo De Vito

A seller sells an object over time but is uncertain how the buyer learns their willingness-to-pay. We consider informational robustness under \textit{limited commitment}, where the seller offers a price \textit{each period} to maximize…

Theoretical Economics · Economics 2025-09-10 Zihao Li , Jonathan Libgober , Xiaosheng Mu

Attempts to replicate probabilistic reasoning in expert systems have typically overlooked a critical ingredient of that process. Probabilistic analysis typically requires extensive judgments regarding interdependencies among hypotheses and…

Artificial Intelligence · Computer Science 2013-04-15 Marvin S. Cohen

In many engineered systems, agents make decisions under incomplete information, creating opportunities for a planner to influence decentralized behavior through signaling. We study how such signaling can be designed in parallel-network,…

Computer Science and Game Theory · Computer Science 2026-04-14 Yuwei Hu , Bryce L. Ferguson

This chapter presents probability logic as a rationality framework for human reasoning under uncertainty. Selected formal-normative aspects of probability logic are discussed in the light of experimental evidence. Specifically, probability…

Artificial Intelligence · Computer Science 2019-10-16 Niki Pfeifer

In a recent work we have shown how to construct an information algebra of coherent sets of gambles defined on general possibility spaces. Here we analyze the connection of such an algebra with the set algebra of subsets of the possibility…

Logic in Computer Science · Computer Science 2021-05-28 Juerg Kohlas , Arianna Casanova , Marco Zaffalon

We introduce and study several notions of computability-theoretic reducibility between subsets of $\omega$ that are "robust" in the sense that if only partial information is available about the oracle, then partial information can be…

Logic · Mathematics 2014-06-12 Damir Dzhafarov , Gregory Igusa