Analysis of task allocation based on social utility and incompatible individual preference

This paper proposes a task allocation method in which, although social utility is attempted to be maximized, agents also give weight to individual preferences based on their own specifications and capabilities. Due to the recent advances in computer and network technologies, many services can be provided by appropriately combining multiple types of information and different computational capabilities. The tasks that are carried out to perform these services are executed by allocating them to appropriate agents, which are computational entities having specific functionalities. However, these tasks are huge and appear simultaneously, and task allocation is thus a challenging issue since it is a combinatorial problem. The proposed method, which is based on our previous work, allocates resources/tasks to the appropriate agents by taking into account both social utility and individual preferences. We experimentally demonstrate that the appropriate strategy to decide the preference depends on the type of task and the features of the reward function as well as the social utility.

[1]  Maria L. Gini,et al.  Tasks with cost growing over time and agent reallocation delays , 2014, AAMAS.

[2]  Toby Walsh,et al.  Fair assignment of indivisible objects under ordinal preferences , 2013, AAMAS.

[3]  Milind Tambe,et al.  Allocating tasks in extreme teams , 2005, AAMAS '05.

[4]  Daniel Merkle,et al.  Dynamic Polyethism and Competition for Tasks in Threshold Reinforcement Models of Social Insects , 2004, Adapt. Behav..

[5]  Sarit Kraus,et al.  Solving the Auction-Based Task Allocation Problem in an Open Environment , 2005, AAAI.

[6]  Eric Bonabeau,et al.  Cooperative transport by ants and robots , 2000, Robotics Auton. Syst..

[7]  Carmine Ventre,et al.  Mechanisms for multi-unit combinatorial auctions with a few distinct goods , 2013, AAMAS.

[8]  Laurent Keller,et al.  Ant-like task allocation and recruitment in cooperative robots , 2000, Nature.

[9]  Toshiharu Sugawara,et al.  Single-object resource allocation in multiple bid declaration with preferential order , 2015, 2015 IEEE/ACIS 14th International Conference on Computer and Information Science (ICIS).

[10]  Ana L. C. Bazzan,et al.  Distributed clustering for group formation and task allocation in multiagent systems: A swarm intelligence approach , 2012, Appl. Soft Comput..

[11]  Jérôme Monnot,et al.  Optimal Reallocation under Additive and Ordinal Preferences , 2016, AAMAS.

[12]  Chunyan Miao,et al.  Market Based Resource Allocation with Incomplete Information , 2007, IJCAI.

[13]  Usman A. Khany,et al.  A decentralized algorithm for the preferred assignment problem in multi-agent systems , 2013, 2013 European Control Conference (ECC).

[14]  Toshiharu Sugawara,et al.  Assignment Problem with Preference and an Efficient Solution Method Without Dissatisfaction , 2016, KES-AMSTA.

[15]  Amin Saberi,et al.  An approximation algorithm for max-min fair allocation of indivisible goods , 2007, STOC '07.

[16]  Ana L. C. Bazzan,et al.  Using Swarm-GAP for Distributed Task Allocation in Complex Scenarios , 2006, MMAS/LSMAS/CCMMS.

[17]  Jörg Rothe,et al.  A survey of approximability and inapproximability results for social welfare optimization in multiagent resource allocation , 2013, Annals of Mathematics and Artificial Intelligence.

[18]  Steven Okamoto,et al.  Dynamic Multi-Agent Task Allocation with Spatial and Temporal Constraints , 2014, AAAI.

[19]  Janise McNair,et al.  Deadline Based Resource Balancing Task Allocation for Clustered Heterogeneous LEO Small Satellite Network , 2013, MILCOM 2013 - 2013 IEEE Military Communications Conference.