Tight inefficiency bounds for perception-parameterized affine congestion games
type: Item
instance of: scholarly article
title: Tight inefficiency bounds for perception-parameterized affine congestion games
zbMATH Open document ID: 1411.91142
author: Pieter Kleer
author: Guido Schäfer
published in: Theoretical Computer Science
publication date: 2018-12-04T00:00:00Z
full work available at URL: https://ir.cwi.nl/pub/27659
Mathematics Subject Classification ID: 91A43
zbMATH DE Number: 6988752
zbMATH Keywords: congestion games
zbMATH Keywords: inefficiency of equilibria
zbMATH Keywords: price of anarchy
zbMATH Keywords: price of stability
zbMATH Keywords: altruistic games
zbMATH Keywords: universal taxes
zbMATH Keywords: risk-averse players
MaRDI profile type: Publication
OpenAlex ID: W2802952317
cites work: Efficiency of Restricted Tolls in Non-atomic Network Routing Games
cites work: Taxes for linear atomic congestion games
cites work: The price of anarchy of finite congestion games
cites work: On the performance of approximate equilibria in congestion games
cites work: The Curse of Sequentiality in Routing Games
cites work: Congestion games with linearly independent paths: convergence time and price of anarchy
cites work: Improving Selfish Routing for Risk-Averse Players
cites work: Q3409969
cites work: Potential games
cites work: A class of games possessing pure-strategy Nash equilibria
cites work: Intrinsic Robustness of the Price of Anarchy
Wikidata QID: Q129972390
DOI: 10.1016/J.TCS.2018.04.025
description: scientific article; zbMATH DE number 6988752