TY - GEN
T1 - Information revelation strategies in abstract argument frameworks using graph based reasoning
AU - Croitoru, Madalina
AU - Oren, Nir
PY - 2014
Y1 - 2014
N2 - The exchange of arguments between agents can enable the achievement of otherwise impossible goals, for example through persuading others to act in a certain way. In such a situation, the persuading argument can be seen to have a positive utility. However, arguments can also have a negative utility - uttering the argument could reveal sensitive information, or prevent the information from being used as a bargaining chip in the future. Previous work on arguing with confidential information suggested that a simple tree based search be used to identify which arguments an agent should utter in order to maximise their utility. In this paper, we analyse the problem of which arguments an agent should reveal in more detail. Our framework is constructed on top of a bipolar argument structure, from which we instantiate bonds - subsets of arguments that lead to some specific conclusions. While the general problem of identifying the maximal utility arguments is NP-complete, we give a polynomial time algorithm for identifying the maximum utility bond in situations where bond utilities are additive.
AB - The exchange of arguments between agents can enable the achievement of otherwise impossible goals, for example through persuading others to act in a certain way. In such a situation, the persuading argument can be seen to have a positive utility. However, arguments can also have a negative utility - uttering the argument could reveal sensitive information, or prevent the information from being used as a bargaining chip in the future. Previous work on arguing with confidential information suggested that a simple tree based search be used to identify which arguments an agent should utter in order to maximise their utility. In this paper, we analyse the problem of which arguments an agent should reveal in more detail. Our framework is constructed on top of a bipolar argument structure, from which we instantiate bonds - subsets of arguments that lead to some specific conclusions. While the general problem of identifying the maximal utility arguments is NP-complete, we give a polynomial time algorithm for identifying the maximum utility bond in situations where bond utilities are additive.
UR - http://www.scopus.com/inward/record.url?scp=84958525287&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-04534-4_2
DO - 10.1007/978-3-319-04534-4_2
M3 - Published conference contribution
AN - SCOPUS:84958525287
SN - 9783319045337
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 13
EP - 20
BT - Graph Structures for Knowledge Representation and Reasoning
A2 - Croitoru, Madalina
A2 - Rudolph, Sebastian
A2 - Woltran, Stefan
A2 - Gonzales, Christophe
PB - Springer-Verlag
T2 - 3rd International Workshop on Graph Structures for Knowledge Representation and Reasoning, GKR 2013
Y2 - 3 August 2013 through 3 August 2013
ER -