Delegated updates in epistemic graphs for opponent modelling

Hunter, Anthony, Polberg, Sylwia ORCID: https://orcid.org/0000-0002-0811-0226 and Potyka, Nico 2019. Delegated updates in epistemic graphs for opponent modelling. International Journal of Approximate Reasoning 113 , pp. 207-244. 10.1016/j.ijar.2019.07.006

Preview

PDF - Accepted Post-Print Version Available under License Creative Commons Attribution Non-commercial No Derivatives. Download (594kB) | Preview

Abstract

In an epistemic graph, belief in arguments is represented by probability distributions. Furthermore, the influence that belief in arguments can have on the belief in other arguments is represented by constraints on the probability distributions. Different agents may choose different constraints to describe their reasoning, thus making epistemic graphs extremely flexible tools. A key application for epistemic graphs is modelling participants in persuasion dialogues, with the aim of modelling the change in beliefs as each move in the dialogue is made. This requires mechanisms for updating the model throughout the dialogue. In this paper, we introduce the class of delegated update methods, which harness existing, simpler update methods in order to produce more realistic outputs. In particular, we focus on hypothesized updates, which capture agent's reluctance or susceptibility to belief updates that can be caused by certain factors, such as time of the day, fatigue, dialogue length, and more. We provide a comprehensive range of options for modelling different kinds of agents and we explore a range of properties for categorising the options.

Item Type:	Article
Date Type:	Publication
Status:	Published
Schools:	Computer Science & Informatics
Publisher:	Elsevier
ISSN:	0888-613X
Funders:	EPSRC
Date of First Compliant Deposit:	29 July 2019
Date of Acceptance:	17 July 2019
Last Modified:	26 Nov 2024 14:00
URI:	https://orca.cardiff.ac.uk/id/eprint/124531

Actions (repository staff only)

Edit Item