English
Related papers

Related papers: Relating Structure and Power: Extended Version

200 papers

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

Theoretical Economics · Economics 2023-12-08 Nicodemo De Vito

This paper extends the self-referential framework of Alpay Algebra into a multi-layered semantic game architecture where transfinite fixed-point convergence encompasses hierarchical sub-games at each iteration level. Building upon Alpay…

Computation and Language · Computer Science 2025-07-11 Bugra Kilictas , Faruk Alpay

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 propose a novel decision making framework for forming potential collaboration among otherwise competing agents in subsurface systems. The agents can be, e.g., groundwater, CO$_2$, or hydrogen injectors and extractors with conflicting…

Optimization and Control · Mathematics 2025-02-28 Per Pettersson , Sebastian Krumscheid , Sarah Gasda

We introduce the framework of LLM-Stackelberg games, a class of sequential decision-making models that integrate large language models (LLMs) into strategic interactions between a leader and a follower. Departing from classical Stackelberg…

Artificial Intelligence · Computer Science 2025-07-15 Quanyan Zhu

Correlated equilibria -- and their generalization $\Phi$-equilibria -- are a fundamental object of study in game theory, offering a more tractable alternative to Nash equilibria in multi-player settings. While computational aspects of…

Computer Science and Game Theory · Computer Science 2025-10-23 Martino Bernasconi , Matteo Castiglioni , Andrea Celli , Gabriele Farina

We investigate combinations of structures by families of structures relative to families of unary predicates and equivalence relations. Conditions preserving $\omega$-categoricity and Ehrenfeuchtness under these combinations are…

Logic · Mathematics 2016-01-05 Sergey V. Sudoplatov

The article introduces a ceteris paribus modal logic interpreted on the equivalence classes induced by sets of propositional atoms. This logic is used to embed two logics of agency and games, namely atemporal STIT and the coalition logic of…

Computer Science and Game Theory · Computer Science 2013-10-28 Davide Grossi , Emiliano Lorini , Francois Schwarzentruber

In simple games, larger coalitions typically wield more power, but do all players align their efforts effectively? Consider a voting scenario where a coalition forms, but needs more voters to pass a bill. The cohesion of the new group of…

Computer Science and Game Theory · Computer Science 2025-04-08 Michele Aleandri , Marco Dall'Aglio

This document focuses on modeling a complex situations to achieve an advantage within a competitive context. Our goal is to devise the characteristics of games to teach and exercise non-easily quantifiable tasks crucial to the math-modeling…

Artificial Intelligence · Computer Science 2021-09-23 Gerardo L. Febres

The ability to compose parts to form a more complex whole, and to analyze a whole as a combination of elements, is desirable across disciplines. This workshop bring together researchers applying compositional approaches to physics, NLP,…

Computation and Language · Computer Science 2018-11-08 Martha Lewis , Bob Coecke , Jules Hedges , Dimitri Kartsaklis , Dan Marsden

I present a formal connection between algebraic effects and game semantics, two important lines of work in programming languages semantics with applications in compositional software verification. Specifically, the algebraic signature…

Programming Languages · Computer Science 2022-11-04 Jérémie Koenig

In his recent and exploratory work on template games and linear logic, Melli\`es defines sequential and concurrent games as categories with positions as objects and trajectories as morphisms, labelled by a specific synchronization template.…

Logic in Computer Science · Computer Science 2021-05-12 Melliès Paul-André

Firm Frobenius algebras are firm algebras and counital coalgebras such that the comultiplication is a bimodule map. They are investigated by categorical methods based on a study of adjunctions and lifted functors. Their categories of…

Rings and Algebras · Mathematics 2013-07-18 Gabriella Böhm , José Gómez-Torrecillas

While Nash equilibrium in extensive-form games is well understood, very little is known about the properties of extensive-form correlated equilibrium (EFCE), both from a behavioral and from a computational point of view. In this setting,…

Computer Science and Game Theory · Computer Science 2019-10-29 Gabriele Farina , Chun Kai Ling , Fei Fang , Tuomas Sandholm

We exhibit the rich structure of the set of correlated equilibria by analyzing the simplest of polynomial games: the mixed extension of matching pennies. We show that while the correlated equilibrium set is convex and compact, the structure…

Computer Science and Game Theory · Computer Science 2011-12-08 Noah D. Stein , Asuman Ozdaglar , Pablo A. Parrilo

Parikh's game logic is a PDL-like fixpoint logic interpreted on monotone neighbourhood frames that represent the strategic power of players in determined two-player games. Game logic translates into a fragment of the monotone…

Logic in Computer Science · Computer Science 2017-09-05 Helle Hvid Hansen , Clemens Kupke , Johannes Marti , Yde Venema

Poset games have been the object of mathematical study for over a century, but little has been written on the computational complexity of determining important properties of these games. In this introduction we develop the fundamentals of…

Computational Complexity · Computer Science 2015-06-26 Stephen A. Fenner , John Rogers

This paper is a submission to the contest: How to combine logics? at the World Congress and School on Universal Logic III, 2010. We claim that combining "things", whatever these things are, is made easier if these things can be seen as the…

Logic in Computer Science · Computer Science 2009-11-19 Dominique Duval

Arboreal categories, introduced by Abramsky and Reggio, axiomatise categories with tree-shaped objects. These categories provide a categorical language for formalising behavioural notions such as simulation, bisimulation, and…

Logic in Computer Science · Computer Science 2024-12-18 Samson Abramsky , Yoàv Montacute , Nihil Shah