A Heuristic Method Based on Answer Set Program in Bilateral Negotiation

DOI

10.2991/icmmita-16.2016.295How to use a DOI?

Keywords

Answer Set Program; Bilateral Negotiation; Well-Founded Semantics

Abstract

This paper presents a heuristic approach based on answer set program in bilateral negotiation. The well-founded semantics for general logic program is used to simplify the process of negotiation. In this approach, demands of each side in negotiation are transformed into a general logic program. The process of negotiation contains two key steps: selecting a pair of answer sets as demand in negotiation and using well-founded semantics to update trade sets of negotiators. Besides, in order to ensure the astringency of approach, some heuristic tips are applied in process. Also, a number of experiments have been done to assess the performance of this method. Results of experiments in general show that this approach could get reasonable results as soon as possible.

Copyright

© 2017, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Long-yun Gao
AU  - Wu Chen
PY  - 2017/01
DA  - 2017/01
TI  - A Heuristic Method Based on Answer Set Program in Bilateral Negotiation
BT  - Proceedings of the 2016 4th International Conference on Machinery, Materials and Information Technology Applications
PB  - Atlantis Press
SP  - 1300
EP  - 1305
SN  - 2352-538X
UR  - https://doi.org/10.2991/icmmita-16.2016.295
DO  - 10.2991/icmmita-16.2016.295
ID  - Gao2017/01
ER  -