Combinatorial Optimization with Competing Agents

Diodato Ferraioli Laurent Gourvès Stefano Moretti Fanny Pascual 1 Olivier Spanjaard 2
1 RO - Recherche Opérationnelle
LIP6 - Laboratoire d'Informatique de Paris 6
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : This chapter deals with three specific studies conducted within the combinatorial optimization for competing agents (COCA) project. It also deals with optimization problems arising from the relationship between members of a social network. A game theoretic model of this relationship is introduced and widely discussed. The chapter then focuses on developing a mechanism able to incentivize the self-interested network members to play the profile maximizing the social welfare. It devotes to a simple connection game. It first reviews the main results, where the price of anarchy of the game is studied. Then two protocols are discussed, and the goal is to induce a socially optimal configuration. The chapter focuses the design of truthful algorithms with performance guarantee regarding the social welfare. It illustrates a facility location problem and an allocation problem.
Document type :
Book sections
Liste complète des métadonnées
Contributor : Lip6 Publications <>
Submitted on : Wednesday, October 28, 2015 - 3:07:26 PM
Last modification on : Thursday, March 21, 2019 - 1:12:45 PM



Diodato Ferraioli, Laurent Gourvès, Stefano Moretti, Fanny Pascual, Olivier Spanjaard. Combinatorial Optimization with Competing Agents. Paradigms of Combinatorial Optimization: Problems and New Approaches, 2nd Edition, Wiley-ISTE, pp.675-706, 2014, Mathematics and Statistics Series, ⟨10.1002/9781119005353.ch21⟩. ⟨hal-01221763⟩



Record views