Computational Social Choice for Coordination in Agent Networks
Résumé
This paper presents some models and algorithms for social choice in agent networks. Agent networks are graphical models used to represent systems involving multiple, locally interacting, agents. They allow the representation of complex decision-making situations where the utility function of every agent depends on the actions of its neighbors. In this context, coordination requires some optimization method able to determine a combination of individual actions that maximizes social efficiency. We study here the maximization of different social welfare functions covering various attitudes ranging from utilitarianism to egalitarianism. For all these models we propose graph-based algorithms as well as MIP formulations to find optimal sets of actions. We also provide numerical tests to assess their practical efficiency.