activity
20202025
most citedThe graph structure of two-player games

8 citations · 18 across the 8 of their papers we have counts for

collaborators

9 papers

cs.GT2025★ 1 cited

Preference graphs: a combinatorial tool for game theory

Oliver Biggar, Iman Shames

The preference graph is a combinatorial representation of the structure of a normal-form game. Its nodes are the strategy profiles, with an arc between profiles if they differ in t…

cs.PL2024

A Behavior Tree-inspired programming language for autonomous agents

Oliver Biggar, Iman Shames

We propose a design for a functional programming language for autonomous agents, built off the ideas and motivations of Behavior Trees (BTs). BTs are a popular model for designing…

cs.GT2023

The Attractor of the Replicator Dynamic in Zero-Sum Games

Oliver Biggar, Iman Shames

In this paper we characterise the long-run behaviour of the replicator dynamic in zero-sum games (symmetric or non-symmetric). Specifically, we prove that every zero-sum game posse…

cs.GT2022

The Replicator Dynamic, Chain Components and the Response Graph

Oliver Biggar, Iman Shames

In this paper we examine the relationship between the flow of the replicator dynamic, the continuum limit of Multiplicative Weights Update, and a game's response graph. We settle a…

cs.GT2022★ 8 cited

The graph structure of two-player games

Oliver Biggar, Iman Shames

In this paper we analyse two-player games by their response graphs. The response graph has nodes which are strategy profiles, with an arc between profiles if they differ in the str…

cs.FL2021

Modular Decomposition of Hierarchical Finite State Machines

Oliver Biggar, Behzad Zamani, Iman Shames

Hierarchical Finite State Machines (HFSMs) are a standard software-modelling concept which extends the classical Finite State Machine (FSM) notion with the useful abstraction of hi…

cs.AI2021

An expressiveness hierarchy of Behavior Trees and related architectures

Oliver Biggar, Mohammad Zamani, Iman Shames

In this paper we provide a formal framework for comparing the expressive power of Behavior Trees (BTs) to other action selection architectures. Taking inspiration from the analogou…

cs.AI2020★ 5 cited

On modularity in reactive control architectures, with an application to formal verification

Oliver Biggar, Mohammad Zamani, Iman Shames

Modularity is a central principle throughout the design process for cyber-physical systems. Modularity reduces complexity and increases reuse of behavior. In this paper we pose and…

cs.AI2020★ 4 cited

A principled analysis of Behavior Trees and their generalisations

Oliver Biggar, Mohammad Zamani, Iman Shames

As complex autonomous robotic systems become more widespread, the need for transparent and reusable Artificial Intelligence (AI) designs becomes more apparent. In this paper we ana…