A revelation mechanism for shared conditional preferences in multi-attribute negotiation

Since we consider distributed problem solving, we assume that agents are collaborative and so they adopt the cooperative strategy in order to reach a fair agree- ment... For

Based on their individual preferences (a minimal distance from their location computed from their partial knowledge of the environment), we propose a negotiation protocol which

In [1] such preferences were modelled in the language of Formal Concept Analysis as follows: An attribute dependency formula (AD formula) over a set M of attributes is A ⊑ B, where A,

I introduce in this talk a new family of negotiation algorithms that is appli- cable to domains with many agents, an intractably large space of possible agreements, non-linear

The article is structured as follows: In Section 2 we give short introductions to attribute exploration in the crisp setting, fuzzy sets and fuzzy logic, formal fuzzy concept

The algorithm identifies sets of agents that can influence themselves rerouting airplanes in their fixes: each agent lists the possible solutions to the congestion problem and

At this time, the buyer agent starts a process of enrichment in order to submit a superior offer and passes thus on to the state of Bid Determina- tion.. If it can submit a

As further generalizations of classical Bool- ean games, they also include strict agent requirements, overlapping agent control as- signments, and weighted goals, which may be