Methodologies for Quantifying and Optimizing the Price of Anarchy

R Chandan, D Paccagnan… - IEEE Transactions on …, 2024 - ieeexplore.ieee.org
The use of Game Theory for the analysis and design of socio-technological systems has
received significant attention as it enables the quantification of the system-level performance …

Risk-averse equilibria for vehicle navigation in stochastic congestion games

A Yekkehkhany, R Nagi - IEEE Transactions on Intelligent …, 2022 - ieeexplore.ieee.org
The fast-growing market of autonomous vehicles, unmanned aerial vehicles, and fleets in
general necessitates the design of smart and automatic navigation systems considering the …

[图书][B] Coping with Selfishness in Congestion Games: Analysis and Design Via LP Duality

V Bilò, C Vinci - 2023 - books.google.com
​ Congestion games are a fundamental class of games widely considered and studied in
non-cooperative game theory, introduced to model several realistic scenarios in which …

When smoothness is not enough: Toward exact quantification and optimization of the price-of-anarchy

R Chandan, D Paccagnan… - 2019 IEEE 58th …, 2019 - ieeexplore.ieee.org
Today's multiagent systems have grown too complex to rely on centralized controllers,
prompting increasing interest in the design of distributed algorithms. In this respect, game …

Price of anarchy in stochastic atomic congestion games with affine costs

R Cominetti, M Scarsini, M Schröder… - Proceedings of the 2019 …, 2019 - dl.acm.org
EXTENDED ABSTRACT The effects of self-minded behavior in congestion games have
been studied extensively in the past twenty years. Initially, the focus was on the simplest …

Altruism in coalition formation games

AM Kerkmann, S Cramer, J Rothe - Annals of Mathematics and Artificial …, 2024 - Springer
Abstract Nguyen et al.(2016) introduced altruistic hedonic games in which agents' utilities
depend not only on their own preferences but also on those of their friends in the same …

Uniform mixed equilibria in network congestion games with link failures

V Bilò, L Moscardelli, C Vinci - 45th International Colloquium on …, 2018 - drops.dagstuhl.de
Motivated by possible applications in fault-tolerant routing, we introduce the notion of
uniform mixed equilibria in network congestion games with adversarial link failures, where …

Topological bounds on the price of anarchy of clustering games on networks

P Kleer, G Schäfer - ACM Transactions on Economics and Computation, 2023 - dl.acm.org
We consider clustering games in which the players are embedded into a network and want
to coordinate (or anti-coordinate) their strategy with their neighbors. The goal of a player is to …

Price of anarchy for parallel link networks with generalized mean objective

P Kleer - OR Spectrum, 2023 - Springer
The price of anarchy is the most well-known measure for quantifying the inefficiency of
equilibrium flows in traffic networks and routing games. In this work, we give unifying price of …

Uniform Mixed Equilibria in Network Congestion Games with Link Failures

V Bilò, L Moscardelli, C Vinci - Mathematics of Operations …, 2024 - pubsonline.informs.org
Motivated by possible applications in fault-tolerant selfish routing, we introduce the notion of
uniform mixed equilibrium in network congestion games with adversarial link failures, where …