Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Intelligent agents for automated one-to-many e-commerce negotiation
ACSC '02 Proceedings of the twenty-fifth Australasian conference on Computer science - Volume 4
The Distributed Constraint Satisfaction Problem: Formalization and Algorithms
IEEE Transactions on Knowledge and Data Engineering
A Logic Programming Language for Multi-agent Systems
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
Cooperative vs. Competitive Multi-Agent Negotiations in Retail Electronic Commerce
CIA '98 Proceedings of the Second International Workshop on Cooperative Information Agents II, Learning, Mobility and Electronic Commerce for Information Discovery on the Internet
On Constraint-Based Reasoning in e-Negotiation Agents
Agent-Mediated Electronic Commerce III, Current Issues in Agent-Based Electronic Commerce Systems (includes revised papers from AMEC 2000 Workshop)
Optimal Negotiation Strategies for Agents with Incomplete Information
ATAL '01 Revised Papers from the 8th International Workshop on Intelligent Agents VIII
Determining Successful Negotiation Strategies: An Evolutionary Approach
ICMAS '98 Proceedings of the 3rd International Conference on Multi Agent Systems
Agent-mediated electronic commerce: a survey
The Knowledge Engineering Review
STRATUM: A METHODOLOGY FOR DESIGNING HEURISTIC AGENT NEGOTIATION STRATEGIES
Applied Artificial Intelligence
Expressive negotiation in settings with externalities
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
About declarative semantics of logic-based agent languages
DALT'05 Proceedings of the Third international conference on Declarative Agent Languages and Technologies
| Hi-index | 0.00 |
In this paper, we present a formal and executable approach to automated multi-issue negotiation between competitive agents. In particular, this approach is based on reasoning in terms of projections in convex regions of admissible values and is an extension of previous work by Marco Cadoli in the area of proposal-based negotiation. Our goal is to develop a heuristic strategy to flexibly compute the offers and counter-offers so as to fulfill each agent's objectives and minimize the number of agents' interactions. The proposed algorithm aims at improving a fundamental parameter of the negotiation process: the interaction complexity in the average case.