English
Related papers

Related papers: A Sound, Complete and Effective Second Order Game …

200 papers

We introduce a new setting, the category of $\omega$PAP spaces, for reasoning denotationally about expressive differentiable and probabilistic programming languages. Our semantics is general enough to assign meanings to most practical…

Programming Languages · Computer Science 2023-05-29 Mathieu Huot , Alexander K. Lew , Vikash K. Mansinghka , Sam Staton

Infinite games (in the form of Gale-Stewart games) are studied where a play is a sequence of natural numbers chosen by two players in alternation, the winning condition being a subset of the Baire space $\omega^\omega$. We consider such…

Computer Science and Game Theory · Computer Science 2023-06-22 Benedikt Brütsch , Wolfgang Thomas

This paper presents a case study for the application of semiring semantics for fixed-point formulae to the analysis of strategies in B\"uchi games. Semiring semantics generalizes the classical Boolean semantics by permitting multiple truth…

Logic in Computer Science · Computer Science 2024-08-07 Erich Grädel , Niels Lücking , Matthias Naaf

We introduce a semantic approach to the study of logics for access control and dependency analysis, based on Game Semantics. We use a variant of AJM games with explicit justification (but without pointers). Based on this, we give a simple…

Logic in Computer Science · Computer Science 2014-01-22 Samson Abramsky , Radha jagadeesan

Logics of non-sense allow a third truth value to express propositions that are \emph{nonsense}. These logics are ideal formalisms to understand how errors are handled in programs and how they propagate throughout the programs once they…

Logic in Computer Science · Computer Science 2020-09-24 Can Başkent

This paper presents a case study for the application of semiring semantics for fixed-point formulae to the analysis of strategies in B\"uchi games. Semiring semantics generalizes the classical Boolean semantics by permitting multiple truth…

Logic in Computer Science · Computer Science 2021-09-20 Erich Grädel , Niels Lücking , Matthias Naaf

We develop a second-order extension of intuitionistic modal logic, allowing quantification over propositions, both syntactically and semantically. A key feature of second-order logic is its capacity to define positive connectives from the…

Logic in Computer Science · Computer Science 2026-02-09 Justus Becker , Anupam Das , Sonia Marin , Paaras Padhiar

In this paper we provide three new results axiomatizing the core of games in characteristic function form (not necessarily having transferable utility) obeying an innocuous condition (that the set of individually rational pay-off vectors is…

Theoretical Economics · Economics 2024-10-01 Anindya Bhattacharya

We present a model of pragmatic language understanding, where utterances are produced and understood by searching for regularized equilibria of signaling games. In this model (which we call ReCo, for Regularized Conventions), speakers and…

Computation and Language · Computer Science 2023-11-17 Athul Paul Jacob , Gabriele Farina , Jacob Andreas

We consider multi-agent systems where agents actions and beliefs are determined aleatorically, or "by the throw of dice". This system consists of possible worlds that assign distributions to independent random variables, and agents who…

Logic in Computer Science · Computer Science 2019-01-01 Tim French , Andrew Gozzard , Mark Reynolds

We study alternating good-for-games (GFG) automata, i.e., alternating automata where both conjunctive and disjunctive choices can be resolved in an online manner, without knowledge of the suffix of the input word still to be read. We show…

Formal Languages and Automata Theory · Computer Science 2020-02-19 Udi Boker , Denis Kuperberg , Karoliina Lehtinen , Michał Skrzypczak

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

I discuss two approaches to monotonic proof-theoretic semantics. In the first one, which I call SVA, consequence is understood in terms of existence of valid arguments. The latter involve the notions of argument structure and justification…

Logic · Mathematics 2025-01-20 Antonio Piccolomini d'Aragona

The rule "defeated(X) $\leftarrow$ attacks(Y,X), $\neg$ defeated(Y)" states that an argument is defeated if it is attacked by an argument that is not defeated. The rule "win(X) $\leftarrow$ move(X,Y), $\neg$ win(Y)" states that in a game a…

Logic in Computer Science · Computer Science 2023-09-14 Bertram Ludäscher , Yilin Xia

We study two-player games with alternating moves played on infinite trees. Our main focus is on the case where the trees are full (regular) and the winning set is open (with respect to the product topology on the tree). Gale and Stewart…

Optimization and Control · Mathematics 2026-02-17 Dean Kraizberg

We introduce a two-player game, in which each player extends a given sequence by picking a free element in a domain D of the real line. The aim of the players is to control the parity of the number of transpositions necessary to put the…

Combinatorics · Mathematics 2009-04-06 Elise Janvresse , Steve Kalikow , Thierry De La Rue

A description of the environment cognition process by intelligent systems with a fixed set of system goals is suggested. Such a system is represented by the set of its goals only without any models of the system elements or the environment.…

Artificial Intelligence · Computer Science 2019-01-03 Dmitry Maximov

We introduce the Prediction Advantage (PA), a novel performance measure for prediction functions under any loss function (e.g., classification or regression). The PA is defined as the performance advantage relative to the Bayesian risk…

Machine Learning · Computer Science 2017-05-30 Ran El-Yaniv , Yonatan Geifman , Yair Wiener

We characterize the critical parameter of oriented percolation on $\mathbb{Z}^2$ through the value of a zero-sum game. Specifically, we define a zero-sum game on a percolation configuration of $\mathbb{Z}^2$, where two players move a token…

Probability · Mathematics 2024-08-27 Avelio Sepúlveda , Bruno Ziliotto

Team semantics is a semantical framework for the study of dependence and independence concepts ubiquitous in many areas such as databases and statistics. In recent works team semantics has been generalised to accommodate also multisets and…

Logic in Computer Science · Computer Science 2018-03-07 Arnaud Durand , Miika Hannula , Juha Kontinen , Arne Meier , Jonni Virtema