Computing the Price of Anarchy in Atomic Network Congestion Games (Invited Talk) - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2023

Computing the Price of Anarchy in Atomic Network Congestion Games (Invited Talk)

Résumé

Network congestion games are a simple model for reasoning about routing problems in a network. They are a very popular topic in algorithmic game theory, and a huge amount of results about existence and (in)efficiency of equilibrium strategy profiles in those games have been obtained over the last 20 years. In particular, the price of anarchy has been defined as an important notion for measuring the inefficiency of Nash equilibria. Generic bounds have been obtained for the price of anarchy over various classes of networks, but little attention has been put on the effective computation of this value for a given network. This talk presents recent results on this problem in different settings.
Fichier principal
Vignette du fichier
ncg.pdf (308.36 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04214722 , version 1 (22-09-2023)

Licence

Paternité

Identifiants

Citer

Nicolas Markey. Computing the Price of Anarchy in Atomic Network Congestion Games (Invited Talk). FORMATS 2023 - International Conference on Formal Modeling and Analysis of Timed Systems, Sep 2023, Antwerp, Belgium. pp.3-12, ⟨10.1007/978-3-031-42626-1_1⟩. ⟨hal-04214722⟩
12 Consultations
87 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More