Partially Cooperative Multi-Agent Periodic Indivisible Resource Allocation

Asymmetric distributed constraint optimization problems (AD-COPs) in which agents are partially cooperative, is a model for representing multi-agent optimization problems in which agents, are willing to cooperate in order to achieve a global goal, as long as some minimal threshold on their personal utility is satisfied. We contribute by: 1) extending the ADCOP model to represent resource allocation problems in which indivisible resources are periodically allocated, e.g., meeting rooms, operating rooms, etc. 2) adjusting partially cooperative local search algorithms to solve problems represented by the extended model. 3) presenting an implementation of a realistic problem that is represented by the proposed model, and empirical evidence of the compatibility of partially cooperative algorithms for this scenario.