English
Related papers

Related papers: Cautious Belief and Iterated Admissibility

200 papers

This work contains the mathematical exploration of a few prototypical games in which central concepts from statistics and probability theory naturally emerge. The first two kinds of games are termed Fisher and Bayesian games, which are…

Statistics Theory · Mathematics 2024-02-27 Jozsef Konczer

Hierarchies of conditional beliefs (Battigalli and Siniscalchi 1999) play a central role for the epistemic analysis of solution concepts in sequential games. They are practically modelled by type structures, which allow the analyst to…

Computer Science and Game Theory · Computer Science 2023-07-13 Nicodemo De Vito

The notion of argumentation and the one of belief stand in a problematic relation to one another. On the one hand, argumentation is crucial for belief formation: as the outcome of a process of arguing, an agent might come to (justifiably)…

Logic in Computer Science · Computer Science 2021-06-23 Alfredo Burrieza , Antonio Yuste-Ginel

The dominant theories of rational choice assume logical omniscience. That is, they assume that when facing a decision problem, an agent can perform all relevant computations and determine the truth value of all relevant logical/mathematical…

Artificial Intelligence · Computer Science 2023-07-12 Caspar Oesterheld , Abram Demski , Vincent Conitzer

This paper studies implications of the consistency conditions among prior, posteriors, and information sets on introspective properties of qualitative belief induced from information sets. The main result reformulates the consistency…

Computer Science and Game Theory · Computer Science 2019-07-23 Satoshi Fukuda

We study strategic interaction in data-driven games where players face uncertainty about payoff distributions inferred from finite samples. To model calibrated attitudes toward such uncertainty, we formulate distributionally robust games…

Computer Science and Game Theory · Computer Science 2026-05-28 Bharat Gangwani , Arunesh Sinha

We unify standard frameworks for approachability both in full or partial monitoring by defining a new abstract game, called the "purely informative game", where the outcome at each stage is the maximal information players can obtain,…

Computer Science and Game Theory · Computer Science 2013-01-17 Vianney Perchet , Marc Quincampoix

This paper presents a plausible reasoning system to illustrate some broad issues in knowledge representation: dualities between different reasoning forms, the difficulty of unifying complementary reasoning styles, and the approximate nature…

Artificial Intelligence · Computer Science 2013-03-26 Wray L. Buntine

Evolutionary game theory has proven to be an elegant framework providing many fruitful insights in population dynamics and human behaviour. Here, we focus on the aspect of behavioural plasticity and its effect on the evolution of…

Populations and Evolution · Quantitative Biology 2020-09-29 M. Kleshnina , K. Kaveh , K. Chatterjee

Choice functions constitute a simple, direct and very general mathematical framework for modelling choice under uncertainty. In particular, they are able to represent the set-valued choices that typically arise from applying decision rules…

Artificial Intelligence · Computer Science 2018-06-05 Jasper De Bock , Gert de Cooman

The Poison Game is a two-player game played on a graph in which one player can influence which edges the other player is able to traverse. It operationalizes the notion of existence of credulously admissible sets in an argumentation…

Logic in Computer Science · Computer Science 2019-02-20 Davide Grossi , Simon Rey

Many real-world situations of ethical relevance, in particular those of large-scale social choice such as mitigating climate change, involve not only many agents whose decisions interact in complicated ways, but also various forms of…

Theoretical Economics · Economics 2020-07-16 Jobst Heitzig , Sarah Hiller

We present a logical framework that enables us to define a formal theory of computational trust in which this notion is analysed in terms of epistemic attitudes towards the possible objects of trust and in relation to existing evidence in…

Logic in Computer Science · Computer Science 2025-06-19 Francesco A. Genco

In the context of strategic games, we provide an axiomatic proof of the statement Common knowledge of rationality implies that the players will choose only strategies that survive the iterated elimination of strictly dominated strategies.…

Computer Science and Game Theory · Computer Science 2010-06-28 Jonathan A. Zvesper , Krzysztof R. Apt

According to the standard imitation protocol, a less successful player adopts the strategy of the more successful one faithfully for future success. This is the cornerstone of evolutionary game theory that explores the vitality of competing…

Physics and Society · Physics 2019-09-27 Attila Szolnoki , Xiaojie Chen

Sequential hypothesis testing asks for decision rules that update as data arrive. A natural goal is \emph{eventual correctness}: the rule may change its mind early on, but it should make only finitely many wrong decisions almost surely.…

Information Theory · Computer Science 2026-05-05 Amir Leshem

Recent theories from complexity science argue that complex dynamics are ubiquitous in social and economic systems. These claims emerge from the analysis of individually simple agents whose collective behavior is surprisingly complicated.…

Adaptation and Self-Organizing Systems · Physics 2013-04-19 Seth Frey , Robert L. Goldstone

We define a modification of the standard Kripke model, called the ordered Kripke model, by introducing a linear order on the set of accessible states of each state. We first show this model can be used to describe the lexicographic belief…

Econometrics · Economics 2018-01-29 Shuige Liu

Motivated by the search for forms of distributed belief that do not collapse in the face of conflicting information, this paper introduces the notions of cautious and bold distributed belief. Both notions rely on maximally consistent…

Logic in Computer Science · Computer Science 2024-08-21 John Lindqvist , Fernando R. Velázquez-Quesada , Thomas Ågotnes

This paper presents a soundness and completeness proof for propositional intuitionistic calculus with respect to the semantics of computability logic. The latter interprets formulas as interactive computational problems, formalized as games…

Logic in Computer Science · Computer Science 2011-04-15 Giorgi Japaridze