Iterated Algorithm for the Optimal Winner Determination In Combined Negotiations
Résumé
Generally in multi-agent negotiations, agents are asked to submit various bids and counter-bids during several iterations of a negotiation process before reaching a compromise. In case of combined negotiations, agents need to solve particularly the winner determination problem WDP to find the best combination of bids in each iteration. In this paper, we tackle the problem of searching and updating the optimal solution of the WDP while moving from one iteration to another. We propose thereby an algorithm that searches and updates this optimal solution. Our algorithm is essentially based on exploring very simple graphs for shared and unshared items. These graphs speed up optimal solution searching.