Related papers: Hypergames and full completeness for system F (rou…

In this work, an abstract and general language for the fundamental objects underlying dynamic games under probabilistic uncertainty is developed. Combining the theory of decision trees by Al\'os-Ferrer--Ritzberger (2005) and a Harsanyian…

In this paper, we introduce past-aware game-theoretic centrality, a class of centrality measures that captures the collaborative contribution of nodes in a network, accounting for both uncertain and certain collaborators. A general…

We show open games cover extensive form games with both perfect and imperfect information. Doing so forces us to address two current weaknesses in open games: the lack of a notion of player and their agency within open games, and the lack…

We propose an alternative to the tree representation of extensive form games. Games in product form represent information with $\sigma$-fields over a product set, and do not require an explicit description of the play temporality, as…

Parity games can be used to represent many different kinds of decision problems. In practice, tools that use parity games often rely on a specification in a higher-order logic from which the actual game can be obtained by means of an…

We introduce a class of extensive form games where players might not be able to foresee the possible consequences of their decisions and form a model of their opponents which they exploit to achieve a more profitable outcome. We improve…

We introduce a "high probability" framework for repeated games with incomplete information. In our non-equilibrium setting, players aim to guarantee a certain payoff with high probability, rather than in expected value. We provide a high…

We introduce a set-valued solution concept, M equilibrium, to capture empirical regularities from over half a century of game-theory experiments. We show M equilibrium serves as a meta theory for various models that hitherto were considered…

Most machine learning approaches to scientific discovery frame hypotheses as end-to-end predictions, obscuring the incremental structure of scientific reasoning. We propose The Hypothesis Game, a symbolic formalism for hypothesis refinement…

This paper addresses several significant gaps in the theory of restricted mis\`ere play (Plambeck, Siegel 2008), primarily in the well-studied universe of dead-ending games, $\mathcal{E}$ (Milley, Renault 2013); if a player run out of moves…

We formulate and analyze game-theoretic problems for systems governed by integral equations. For Volterra integral equations, we obtain and prove necessary and sufficient conditions for linear-quadratic problems, and for problems that are…

Heifetz, Meier, and Schipper (2013) introduced dynamic game with unawareness consisting of a partially ordered set of games in extensive form. Here, we study the normal form of dynamic games with unawareness. The generalized normal form…

Using the simulation paradigm in information theory, we define notions of quantum hypergraph homomorphisms and quantum hypergraph isomorphisms, and show that they constitute partial orders and equivalence relations, respectively.…

In imperfect-information games, agents must make decisions based on partial knowledge of the game state. The Belief Stochastic Game model addresses this challenge by delegating state estimation to the game model itself. This allows agents…

Many games often share common ideas or aspects between them, such as their rules, controls, or playing area. However, in the context of General Game Playing (GGP) for board games, this area remains under-explored. We propose to formalise…

We study finite-memory (FM) determinacy in games on finite graphs, a central question for applications in controller synthesis, as FM strategies correspond to implementable controllers. We establish general conditions under which FM…

This paper introduces a novel framework for modeling interacting humans in a multi-stage game. This "iterated semi network-form game" framework has the following desirable characteristics: (1) Bounded rational players, (2) strategic players…

In this work, we introduce a new toolkit for analyzing cloning games, a notion that captures stronger and more quantitative versions of the celebrated quantum no-cloning theorem. This framework allows us to analyze a new cloning game based…

We present novel techniques for neuro-symbolic concurrent stochastic games, a recently proposed modelling formalism to represent a set of probabilistic agents operating in a continuous-space environment using a combination of neural network…

We study in depth the class of games with opacity condition, which are two-player games with imperfect information in which one of the players only has imperfect information, and where the winning condition relies on the information he has…