A Game-theoretical Method for Dynamic Agent-Zone Allocation Problems

This paper considers an agent-zone allocation problem as a multiplayer game. In particular, each agent makes individual decisions, through the negotiation mechanism named generalized regret monitoring with fading memory and inertia. The objective is to optimize each agent's utility function (based on their carrying capacities), while they also optimize the global utility. Our proposed utility function considers the occupation of each zone while making their decisions. We present a sensitivity analysis of the parameters used in the negotiation mechanism and the utility function. Finally, we show simulation results of three scenarios and their corresponding statistical analysis.