Information revelation strategies in abstract argument frameworks using graph based reasoning

Madalina Croitoru, Nir Oren

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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.

Original languageEnglish
Title of host publicationGraph Structures for Knowledge Representation and Reasoning
Subtitle of host publicationThird International Workshop, GKR 2013, Revised Selected Papers
EditorsMadalina Croitoru, Sebastian Rudolph, Stefan Woltran, Christophe Gonzales
PublisherSpringer-Verlag
Pages13-20
Number of pages8
ISBN (Electronic)9783319045344
ISBN (Print)9783319045337
DOIs
Publication statusPublished - 2014
Event3rd International Workshop on Graph Structures for Knowledge Representation and Reasoning, GKR 2013 - Beijing, China
Duration: 3 Aug 20133 Aug 2013

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8323 LNAI
ISSN (Print)03029743
ISSN (Electronic)16113349

Conference

Conference3rd International Workshop on Graph Structures for Knowledge Representation and Reasoning, GKR 2013
CountryChina
CityBeijing
Period3/08/133/08/13

Fingerprint

Reasoning
Graph in graph theory
Polynomials
Framework
Strategy
Bargaining
Polynomial-time Algorithm
Chip
NP-complete problem
Maximise
Subset

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Croitoru, M., & Oren, N. (2014). Information revelation strategies in abstract argument frameworks using graph based reasoning. In M. Croitoru, S. Rudolph, S. Woltran, & C. Gonzales (Eds.), Graph Structures for Knowledge Representation and Reasoning: Third International Workshop, GKR 2013, Revised Selected Papers (pp. 13-20). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8323 LNAI). Springer-Verlag. https://doi.org/10.1007/978-3-319-04534-4_2

Information revelation strategies in abstract argument frameworks using graph based reasoning. / Croitoru, Madalina; Oren, Nir.

Graph Structures for Knowledge Representation and Reasoning: Third International Workshop, GKR 2013, Revised Selected Papers. ed. / Madalina Croitoru; Sebastian Rudolph; Stefan Woltran; Christophe Gonzales. Springer-Verlag, 2014. p. 13-20 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8323 LNAI).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Croitoru, M & Oren, N 2014, Information revelation strategies in abstract argument frameworks using graph based reasoning. in M Croitoru, S Rudolph, S Woltran & C Gonzales (eds), Graph Structures for Knowledge Representation and Reasoning: Third International Workshop, GKR 2013, Revised Selected Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 8323 LNAI, Springer-Verlag, pp. 13-20, 3rd International Workshop on Graph Structures for Knowledge Representation and Reasoning, GKR 2013, Beijing, China, 3/08/13. https://doi.org/10.1007/978-3-319-04534-4_2
Croitoru M, Oren N. Information revelation strategies in abstract argument frameworks using graph based reasoning. In Croitoru M, Rudolph S, Woltran S, Gonzales C, editors, Graph Structures for Knowledge Representation and Reasoning: Third International Workshop, GKR 2013, Revised Selected Papers. Springer-Verlag. 2014. p. 13-20. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-319-04534-4_2
Croitoru, Madalina ; Oren, Nir. / Information revelation strategies in abstract argument frameworks using graph based reasoning. Graph Structures for Knowledge Representation and Reasoning: Third International Workshop, GKR 2013, Revised Selected Papers. editor / Madalina Croitoru ; Sebastian Rudolph ; Stefan Woltran ; Christophe Gonzales. Springer-Verlag, 2014. pp. 13-20 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{2e6a83113f7446a1a52c283ee9c92927,
title = "Information revelation strategies in abstract argument frameworks using graph based reasoning",
abstract = "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.",
author = "Madalina Croitoru and Nir Oren",
year = "2014",
doi = "10.1007/978-3-319-04534-4_2",
language = "English",
isbn = "9783319045337",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer-Verlag",
pages = "13--20",
editor = "Madalina Croitoru and Sebastian Rudolph and Stefan Woltran and Christophe Gonzales",
booktitle = "Graph Structures for Knowledge Representation and Reasoning",

}

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 - Conference contribution

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

ER -