Using Game Description Language for mediated dispute resolution

de Jonge, D; Trescak, T; Sierra, C; Simoff, S; de Mántaras, RL

Using Game Description Language for mediated dispute resolution

de Jonge, D Trescak, T Sierra, C

Simoff, S de Mántaras, RL

Permalink

Publication Type:: Journal Article
Citation:: AI and Society, 2019, 34 (4), pp. 767 - 784
Issue Date:: 2019-12-01

Closed Access

	Filename	Description	Size
	Using game description language.pdf	Published Version	2.59 MB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	de Jonge, D	en_US
dc.contributor.author	Trescak, T	en_US
dc.contributor.author	Sierra, C https://orcid.org/0000-0003-0839-6233	en_US
dc.contributor.author	Simoff, S	en_US
dc.contributor.author	de Mántaras, RL	en_US
dc.date.issued	2019-12-01	en_US
dc.identifier.citation	AI and Society, 2019, 34 (4), pp. 767 - 784	en_US
dc.identifier.issn	0951-5666	en_US
dc.identifier.uri	http://hdl.handle.net/10453/125052
dc.description.abstract	© 2017, Springer-Verlag London Ltd., part of Springer Nature. Mediation is a process in which two parties agree to resolve their dispute by negotiating over alternative solutions presented by a mediator. In order to construct such solutions, the mediator brings more information and knowledge, and, if possible, resources to the negotiation table. In order to do so, the mediator faces the challenge of determining which information is relevant to the current problem, given a vast database of knowledge. The contribution of this paper is the automated mediation machinery to resolve this issue. We define the concept of a Mediation Problem and show how it can be described in Game Description Language (GDL). Furthermore, we present an algorithm that allows the mediator to efficiently determine which information is relevant to the problem and collect this information from the negotiating agents. We show with several experiments that this algorithm is much more efficient than the naive solution that simply takes all available knowledge into account.	en_US
dc.relation.ispartof	AI and Society	en_US
dc.relation.isbasedon	10.1007/s00146-017-0790-8	en_US
dc.subject.classification	Artificial Intelligence & Image Processing	en_US
dc.title	Using Game Description Language for mediated dispute resolution	en_US
dc.type	Journal Article
utslib.citation.volume	4	en_US
utslib.citation.volume	34	en_US
utslib.for	0801 Artificial Intelligence and Image Processing	en_US
utslib.for	1702 Cognitive Sciences	en_US
utslib.for	2203 Philosophy	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Software
utslib.copyright.status	closed_access
pubs.issue	4	en_US
pubs.publication-status	Published	en_US
pubs.volume	34	en_US

Abstract:

© 2017, Springer-Verlag London Ltd., part of Springer Nature. Mediation is a process in which two parties agree to resolve their dispute by negotiating over alternative solutions presented by a mediator. In order to construct such solutions, the mediator brings more information and knowledge, and, if possible, resources to the negotiation table. In order to do so, the mediator faces the challenge of determining which information is relevant to the current problem, given a vast database of knowledge. The contribution of this paper is the automated mediation machinery to resolve this issue. We define the concept of a Mediation Problem and show how it can be described in Game Description Language (GDL). Furthermore, we present an algorithm that allows the mediator to efficiently determine which information is relevant to the problem and collect this information from the negotiating agents. We show with several experiments that this algorithm is much more efficient than the naive solution that simply takes all available knowledge into account.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/125052