• français
    • English
  • English 
    • français
    • English
  • Login
JavaScript is disabled for your browser. Some features of this site may not work without it.
BIRD Home

Browse

This CollectionBy Issue DateAuthorsTitlesSubjectsJournals BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesSubjectsJournals

My Account

Login

Statistics

View Usage Statistics

Combinatorial Optimization with Competing Agents

Thumbnail
Date
2014
Dewey
Probabilités et mathématiques appliquées
Sujet
algorithmic game theory; operations research games; combinatorial optimization for competing agents (COCA); social network
JEL code
C.C7.C79
DOI
http://dx.doi.org/10.1002/9781119005353.ch21
Book title
Paradigms of Combinatorial Optimization: Problems and New Approaches, 2nd Edition
Author
Paschos, Vangelis Th.
Publisher
John Wiley & Sons
Publisher city
Hoboken
Year
2014
Pages number
792
ISBN
978-1-119-01519-2
URI
https://basepub.dauphine.fr/handle/123456789/16116
Collections
  • LAMSADE : Publications
Metadata
Show full item record
Author
Ferraioli, Diodato
Gourvès, Laurent
989 Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Moretti, Stefano
989 Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Pascual, Fanny
Spanjaard, Olivier
Type
Chapitre d'ouvrage
Item number of pages
675-706
Abstract (EN)
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.

  • Accueil Bibliothèque
  • Site de l'Université Paris-Dauphine
  • Contact
SCD Paris Dauphine - Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16

 Content on this site is licensed under a Creative Commons 2.0 France (CC BY-NC-ND 2.0) license.