K-Swaps: Cooperative Negotiation for Solving Task-Allocation Problems
Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence. Pages 373-378.
Abstract
In this paper, we study distributed algorithms for cooperative agents that allow them to exchange their assigned tasks in order to reduce their team cost. We define a new type of contract, called K-swaps, that describes multiple task exchanges among multiple agents at a time, which generalizes the concept of single task exchanges. We design a distributed algorithm that constructs all possible K-swaps that reduce the team cost of a given task allocation and show that each agent typically only needs to communicate a small part of its local computation results to the other agents. We then demonstrate empirically that K-swaps can reduce the team costs of several existing task-allocation algorithms significantly even if K is small.Xiaoming Zheng, Sven Koenig
@inproceedings{ijcai2009p70,
title = {K-Swaps: Cooperative Negotiation for Solving Task-Allocation Problems},
author = {Zheng, Xiaoming and Koenig, Sven},
booktitle = {Proceedings of the Twenty-First International Joint Conference on
Artificial Intelligence, {IJCAI-09}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Hiroaki Kitano},
pages = {373--378},
year = {2009},
url = {https://ijcai.org/proceedings/2009/70},
}
TY - CPAPER TI - K-Swaps: Cooperative Negotiation for Solving Task-Allocation Problems AU - Zheng, Xiaoming AU - Koenig, Sven T2 - Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence, IJCAI-09 PB - International Joint Conferences on Artificial Intelligence PY - 2009 SP - 373 EP - 378 UR - https://ijcai.org/proceedings/2009/70 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
