Arrow Research search

Author name cluster

Simon Williamson

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

3 papers
1 author row

Possible papers

3

AAMAS Conference 2012 Conference Paper

Active Malware Analysis using Stochastic Games

  • Simon Williamson
  • Pradeep Varakantham
  • Debin Gao
  • Ong Chen Hui

Cyber security is increasingly important for defending computer systems from loss of privacy or unauthorised use. One important aspect is threat analysis - how does an attacker infiltrate a system and what do they want once they are inside. This paper considers the problem of Active Malware Analysis, where we learn about the human or software intruder by actively interacting with it with the goal of learning about its behaviours and intentions, whilst at the same time that intruder may be trying to avoid detection or showing those behaviours and intentions. This game-theoretic active learning is then used to obtain a behavioural clustering of malware, an important contribution for both understanding malware at a high level and more crucially, for the deployment of effective anti-malware defences. This paper makes the following contributions: (i) A formal definition of the game-theoretic active malware analysis problem; (ii) A fast algorithm for learning about a malware in the active analysis problem which utilises the concept of reducing entropy in the beliefs about the malware; (iii) A virtual machine based agent architecture for the implementation of the active malware analysis problem and (iv) A behaviour based clustering of malware behaviour which is shown to be more accurate than a similar clustering using only passive information about the malware.

AAMAS Conference 2012 Conference Paper

Decentralised Channel Allocation and Information Sharing for Teams of Cooperative Agents

  • Sebastian Stein
  • Simon Williamson
  • NICK JENNINGS

In a wide range of emerging applications, from disaster management to intelligent sensor networks, teams of software agents can be deployed to effectively solve complex distributed problems. To achieve this, agents typically need to communicate locally sensed information to each other. However, in many settings, there are heavy constraints on the communication infrastructure, making it infeasible for every agent to broadcast all relevant information to everyone else. To address this challenge, we investigate how agents can make good local decisions about what information to send to a set of communication channels with limited bandwidths such that the overall system utility is maximised. Specifically, to solve this problem efficiently in large-scale systems with hundreds or thousands of agents, we develop a novel decentralised algorithm. This combines multi-agent learning techniques with fast decision-theoretic reasoning mechanisms that predict the impact a single agent has on the entire system. We show empirically that our algorithm consistently achieves 85% of a hypothetical centralised optimal strategy with full information, and that it significantly outperforms a number of baseline benchmarks (by up to 600%).

AAMAS Conference 2010 Conference Paper

Valuing Search and Communication in Partially-Observable Coordination Problems

  • Simon Williamson
  • Archie Chapman
  • Nicholas R. Jennings

In this paper we extend the class of Bayesian coordination games toinclude explicit observation and communication. This general classof problems includes the canonical multi-door multi-agent Tigerproblem. We argue that this class of games is appropriate for situations where the agents observation, communication and payoff-earning actions are limited by some common resource, without introducing arbitrary penalties for communicating (unlike most existing approaches).