Modelling Decision and Preference problems using Chain Event Graphs
Lead Research Organisation:
University of Leeds
Department Name: Statistics
Abstract
Many real decision problems are asymmetric in the sense that choosing a particular action at some point can have consequences for the choices available to the decision maker at subsequent points in the decision process. We describe the sets of possible actions available to the decision maker and the most appropriate actions to take in these cases as context-specific. Current techniques for tackling such problems are inefficient, and their use can lead to significant expense in terms of time & resources, for example in areas such as medical decision making. We propose a new method for representing and solving these problems which will considerably reduce this expense.
The context-specific nature of preference problems is, in contrast, built in to current methods for their representation & analysis, but these methods assume that an agent's preferences are fixed in any given context, and also that the underlying structure of the problem is essentially symmetric. We propose a new graphical structure which will allow these problems to be modelled in a more realistic manner
The Chain Event Graph (CEG) was introduced in 2006 for the modelling of discrete asymmetric (probabilistic) problems, and has proven to be ideal for this purpose. Two research reports produced during the EPSRC-funded project Chain Event Graphs: semantics & inference (EP/F036752/1) suggested strongly that the CEG had significant potential for the analysis of asymmetric decision problems.
Two of the drawbacks common to current methods for modelling these problems are that the graphical models used for their representation require supplementing with extra tables or the introduction of dummy states, and that their methodology is very complicated and not an appropriate tool for use by non-mathematicians. CEGs are not subject to either of these failings, the complete structure of the problem is depicted in the topology of the graph, which is a function of an event tree, the most transparent form of representation used when eliciting models from clients.
The conditional preference network (CP-net) has been used for modelling preference problems since 2004, but there has been very little work done on fitting probability distributions to agents' preferences for given contexts, and none whatsoever on using context-specific minimal information sets to simplify the analysis of these problems. As CEGs were originally developed to model problems with a high degree of context-specific information, and do this through the idea of minimal information sets, we believe that CEGs could readily be modified for the modelling of conditional preference problems. Such a CEG would be related to the current CP-net in much the same way as the standard CEG is to the Bayesian Network, and the decision-CEG is to the Influence Diagram (ID).
The aim of this project is to create formal mathematical variants of the CEG which can be used for the representation & analysis of asymmetric decision problems, and of probabilistic conditional preference problems.
The primitive algorithm developed during the project EP/F036752/1 for calculating optimal decision strategies and maximum expected utilities will be refashioned, and analogues for the ID technique known as barren node deletion and the principle of parsimony developed for the decision-CEG.
We believe that this research will lead to greater transparency in the representation of decision & preference problems, but also to analyses which are more efficient in terms of time & resources.
The context-specific nature of preference problems is, in contrast, built in to current methods for their representation & analysis, but these methods assume that an agent's preferences are fixed in any given context, and also that the underlying structure of the problem is essentially symmetric. We propose a new graphical structure which will allow these problems to be modelled in a more realistic manner
The Chain Event Graph (CEG) was introduced in 2006 for the modelling of discrete asymmetric (probabilistic) problems, and has proven to be ideal for this purpose. Two research reports produced during the EPSRC-funded project Chain Event Graphs: semantics & inference (EP/F036752/1) suggested strongly that the CEG had significant potential for the analysis of asymmetric decision problems.
Two of the drawbacks common to current methods for modelling these problems are that the graphical models used for their representation require supplementing with extra tables or the introduction of dummy states, and that their methodology is very complicated and not an appropriate tool for use by non-mathematicians. CEGs are not subject to either of these failings, the complete structure of the problem is depicted in the topology of the graph, which is a function of an event tree, the most transparent form of representation used when eliciting models from clients.
The conditional preference network (CP-net) has been used for modelling preference problems since 2004, but there has been very little work done on fitting probability distributions to agents' preferences for given contexts, and none whatsoever on using context-specific minimal information sets to simplify the analysis of these problems. As CEGs were originally developed to model problems with a high degree of context-specific information, and do this through the idea of minimal information sets, we believe that CEGs could readily be modified for the modelling of conditional preference problems. Such a CEG would be related to the current CP-net in much the same way as the standard CEG is to the Bayesian Network, and the decision-CEG is to the Influence Diagram (ID).
The aim of this project is to create formal mathematical variants of the CEG which can be used for the representation & analysis of asymmetric decision problems, and of probabilistic conditional preference problems.
The primitive algorithm developed during the project EP/F036752/1 for calculating optimal decision strategies and maximum expected utilities will be refashioned, and analogues for the ID technique known as barren node deletion and the principle of parsimony developed for the decision-CEG.
We believe that this research will lead to greater transparency in the representation of decision & preference problems, but also to analyses which are more efficient in terms of time & resources.
Planned Impact
The project aims to produce accessible models and efficient algorithms which will provide researchers in AI and in the field of decision analysis with useful tools for tackling probabilistic conditional preference problems and asymmetric decision problems.
Longer term, once these methods become part of the repertoire, it is anticipated that they will begin to be adopted by practitioners outside the academic research community. Two areas, one societal and one economic, where there is a high likelihood of impact are highlighted here. Firstly, the tools developed for asymmetric decision modelling will be appropriate for many of the problems encountered by medical decision makers, and could be used to create significant savings in terms of time & resources for NHS trusts. Secondly, the use of probabilistic conditional preference models would result in more effective customer-webpage interaction for companies who use customer preferences to guide online buyers to appropriate products. This application could readily be scaled-up to the high-dimensional problems of interest to Google, Amazon etc, and we are keen to attract a PhD student to work in this related area.
Longer term, once these methods become part of the repertoire, it is anticipated that they will begin to be adopted by practitioners outside the academic research community. Two areas, one societal and one economic, where there is a high likelihood of impact are highlighted here. Firstly, the tools developed for asymmetric decision modelling will be appropriate for many of the problems encountered by medical decision makers, and could be used to create significant savings in terms of time & resources for NHS trusts. Secondly, the use of probabilistic conditional preference models would result in more effective customer-webpage interaction for companies who use customer preferences to guide online buyers to appropriate products. This application could readily be scaled-up to the high-dimensional problems of interest to Google, Amazon etc, and we are keen to attract a PhD student to work in this related area.
Organisations
Publications
Laing K
(2019)
Rank Pruning for Dominance Queries in CP-Nets
in Journal of Artificial Intelligence Research
Thwaites P
(2015)
A New Method for tackling Asymmetric Decision Problems
Thwaites P
(2017)
A Graphical method for simplifying Bayesian Games
Thwaites P
(2017)
A new method for tackling asymmetric decision problems
in International Journal of Approximate Reasoning
Thwaites P
(2018)
A graphical method for simplifying Bayesian games
in Reliability Engineering & System Safety
Thwaites P A
(2015)
A New Method for tackling Asymmetric Decision Problems
Description | The grant has allowed us to develop a new graphical model, the Chain Event Graph (CEG) for the representation and analysis of asymmetric decision problems, for example modelling the decisions made by a doctor regarding a patient's care. This is asymmetric because care may stop if a patient makes a full recovery, and different treatments may lead to different futures for the patient. The grant has also allowed us to develop the CEG for the representation and analysis of asymmetric Bayesian Games, for example modelling the actions of a government and a terrorist group. Since the last submission we have also made advances in the area of preference problems, with an improved algorithm for dominance queries in conditional preference networks. |
Exploitation Route | The work on Bayesian Games has led to the creation of a new international collaboration (described in the "Engagement Activities" section), looking at asymmetric adversarial risk problems. We expect that this will lead both to further papers and to a new grant application. The new work on conditional preference networks will probably encourage other researchers to try to improve our algorithm further. |
Sectors | Digital/Communication/Information Technologies (including Software),Healthcare,Security and Diplomacy |
Description | Second international workshop on Chain Event Graphs |
Form Of Engagement Activity | Participation in an activity, workshop or similar |
Part Of Official Scheme? | No |
Geographic Reach | International |
Primary Audience | Professional Practitioners |
Results and Impact | Workshop on developing the techniques of Chain Event Graphs, including a session on their use for games and adversarial risk analysis. Aim was to consolidate the group of researchers as a community. A google group subsequently set up. Also plans for new collaborations and to create a new R package. |
Year(s) Of Engagement Activity | 2019 |
Description | Talk at GDRR |
Form Of Engagement Activity | A talk or presentation |
Part Of Official Scheme? | No |
Geographic Reach | International |
Primary Audience | Professional Practitioners |
Results and Impact | Talk resulted in questions and discussion. I collected email addresses of interested members of the audience. Has also resulted in an agreed collaboration with David Rios Insua (ICMAT, Spain) and his PhD student Jorge Gonzalez-Ortega, which is expected to lead to both joint papers and a further grant application. Has also resulted in further invitations to give talks at Durham and Warwick. |
Year(s) Of Engagement Activity | 2017 |
URL | http://www.personal.leeds.ac.uk/~stapat/GDRR2017talk.pdf |
Description | Talk at RSS Leeds local group |
Form Of Engagement Activity | A talk or presentation |
Part Of Official Scheme? | No |
Geographic Reach | Regional |
Primary Audience | Professional Practitioners |
Results and Impact | Talk resulted in questions and discussion. I collected email addresses of interested members of the audience. |
Year(s) Of Engagement Activity | 2017 |
Description | Talk at WUPES |
Form Of Engagement Activity | A talk or presentation |
Part Of Official Scheme? | No |
Geographic Reach | International |
Primary Audience | Other academic audiences (collaborators, peers etc.) |
Results and Impact | Talk resulted in questions & discussion. I collected email addresses of interested members of the audience. One listener offered to advertise my funded PhD project to students at the Czech Academy of Sciences. One listener offered to advertise my funded PhD project to students at the Czech Academy of Sciences. I expect to incorporate ideas from the discussion into an extended paper in the New Year. |
Year(s) Of Engagement Activity | 2015 |
URL | http://www.personal.leeds.ac.uk/~stapat/wupestalk.pdf |
Description | Talk to Leverhulme Bridges |
Form Of Engagement Activity | A talk or presentation |
Part Of Official Scheme? | No |
Geographic Reach | Regional |
Primary Audience | Postgraduate students |
Results and Impact | Talk resulted in questions and discussion. I collected email addresses of interested members of the audience. One PhD student proposing to use the new methods to tackle one of her major tasks. |
Year(s) Of Engagement Activity | 2018 |
Description | Talk to Statistics department at Durham |
Form Of Engagement Activity | A talk or presentation |
Part Of Official Scheme? | No |
Geographic Reach | Regional |
Primary Audience | Professional Practitioners |
Results and Impact | Talk resulted in questions and discussion. I collected email addresses of interested members of the audience. |
Year(s) Of Engagement Activity | 2017 |
Description | Talk to Statistics department at Glasgow |
Form Of Engagement Activity | A talk or presentation |
Part Of Official Scheme? | No |
Geographic Reach | National |
Primary Audience | Professional Practitioners |
Results and Impact | Gave a seminar on using Chain Event Graphs for games and adversarial risk analysis to the School of Mathematics and Statistics at the University of Glasgow, with the aim of encouraging uptake of the techniques by other academic statisticians. |
Year(s) Of Engagement Activity | 2019 |