A computational model of logic-based negotiation

Authors:
Dongmo Zhang;Yan Zhang
Affiliations:
Intelligent Systems Laboratory, School of Computing and Mathematics, University of Western Sydney, Australia;Intelligent Systems Laboratory, School of Computing and Mathematics, University of Western Sydney, Australia
Venue:
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Year:
2006

Citing 5
Cited 11

Reaching agreements through argumentation: a logical model and implementation

Artificial Intelligence
Bargaining theory with applications

Bargaining theory with applications
A negotiation-style framework for non-prioritised revision

TARK '01 Proceedings of the 8th conference on Theoretical aspects of rationality and knowledge
Negotiation as mutual belief revision

AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
A logical model of Nash bargaining solution

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence

Logic-based automated multi-issue bilateral negotiation in peer-to-peer e-marketplaces

Autonomous Agents and Multi-Agent Systems
Fuzzy Bilateral Matchmaking in e-Marketplaces

KES '08 Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part III
Investigating adaptive, confidence-based strategic negotiations in complex multiagent environments

Web Intelligence and Agent Systems
A Fixed-Point Property of Logic-Based Bargaining Solution

AI '08 Proceedings of the 21st Australasian Joint Conference on Artificial Intelligence: Advances in Artificial Intelligence
Description logics for multi-issue bilateral negotiation with incomplete information

AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
An ordinal bargaining solution with fixed-point property

Journal of Artificial Intelligence Research
Combining Boolean Games with the Power of Ontologies for Automated Multi-attribute Negotiation in the Semantic Web

WI-IAT '09 Proceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Volume 02
Alternating-offers protocol for multi-issue bilateral negotiation in semantic-enabled marketplaces

ISWC'07/ASWC'07 Proceedings of the 6th international The semantic web and 2nd Asian conference on Asian semantic web conference
OWL-DL as a power tool to model negotiation mechanisms with incomplete information

ISWC'07/ASWC'07 Proceedings of the 6th international The semantic web and 2nd Asian conference on Asian semantic web conference
Towards a fuzzy logic for automated multi-issue negotiation

FoIKS'08 Proceedings of the 5th international conference on Foundations of information and knowledge systems
Logical properties of belief-revision-based bargaining solution

AI'06 Proceedings of the 19th Australian joint conference on Artificial Intelligence: advances in Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a computational model of negotiation based on Nebel's syntax-based belief revision. The model guarantees a unique bargaining solution for each bargaining game without using lotteries. Its game-theoretic properties are discussed against the existence and uniqueness of Nash equilibrium and subgame perfect equilibrium. We also study essential computational properties in relation to our negotiation model. In particular, we show that the deal membership checking is DP-complete and the corresponding agreement inference problem is Π2P-hard.