Trust negotiation makes it possible for two parties to carry on secure transactions by first establishing trust through a bilateral, iterative process of requesting and disclosin...
Anna Cinzia Squicciarini, Abhilasha Bhargav-Spantz...
There are two ways of handling bilateral multi-issue negotiations – one is to negotiate all the issues together, and the other is to negotiate them one by one. The order in whic...
S. Shaheen Fatima, Michael Wooldridge, Nicholas R....
Automated reasoning about systems with infinite domains requires an extension of regular automata to infinite alphabets. Existing formalisms of such automata cope with the infinite...
Distributed Constraint Satisfaction Problems (DCSPs) provide a model to capture a broad range of cooperative multiagent problem solving settings. Researchers have generally propos...
Starting from some simple observations on a popular selection method in Evolutionary Algorithms (EAs)--tournament selection--we highlight a previously-unknown source of inefficien...