A graphical method for simplifying Bayesian games
Peter A. Thwaites and
Jim Q. Smith
Reliability Engineering and System Safety, 2018, vol. 179, issue C, 3-11
Abstract:
If the influence diagram (ID) depicting a Bayesian game is common knowledge to its players then additional assumptions may allow the players to make use of its embodied irrelevance statements. They can then use these to discover a simpler game which still embodies both their optimal decision policies. However the impact of this result has been rather limited because many common Bayesian games do not exhibit sufficient symmetry to be fully and efficiently represented by an ID. The tree-based chain event graph (CEG) has been developed specifically for such asymmetric problems. By using these graphs rational players can make analogous deductions, assuming the topology of the CEG as common knowledge. In this paper we describe these powerful new techniques and illustrate them through an example modelling a game played between a government department and the provider of a website designed to radicalise vulnerable people.
Keywords: Adversarial risk; Bayesian game theory; Chain event graph; Decision tree; Influence diagram; Parsimony (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations:
Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0951832017305355
Full text for ScienceDirect subscribers only
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:eee:reensy:v:179:y:2018:i:c:p:3-11
DOI: 10.1016/j.ress.2017.05.012
Access Statistics for this article
Reliability Engineering and System Safety is currently edited by Carlos Guedes Soares
More articles in Reliability Engineering and System Safety from Elsevier
Bibliographic data for series maintained by Catherine Liu ().