Non-atomic one-round walks in congestion games
type: Item
instance of: scholarly article
title: Non-atomic one-round walks in congestion games
zbMATH Open document ID: 1422.91154
author: Cosimo Vinci
published in: Theoretical Computer Science
publication date: 2019-03-13T00:00:00Z
Mathematics Subject Classification ID: 91A43
Mathematics Subject Classification ID: 91A10
Mathematics Subject Classification ID: 91B14
zbMATH DE Number: 7035845
zbMATH Keywords: algorithmic game theory
zbMATH Keywords: computational social choice
zbMATH Keywords: price of anarchy
zbMATH Keywords: congestion games
zbMATH Keywords: taxes
MaRDI profile type: Publication
full work available at URL: j.tcs.2018.06.038
OpenAlex ID: W2810387876
cites work: Convergence and Approximation in Potential Games
cites work: Performance of one-round walks in linear congestion games
cites work: Algorithmic Game Theory
cites work: A class of games possessing pure-strategy Nash equilibria
cites work: Equilibrium points in n -person games
cites work: Q3409969
cites work: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
cites work: The price of anarchy is independent of the network topology
cites work: The price of anarchy of finite congestion games
cites work: The Price of Routing Unsplittable Flow
cites work: Exact Price of Anarchy for Polynomial Congestion Games
cites work: On the performance of approximate equilibria in congestion games
cites work: Intrinsic Robustness of the Price of Anarchy
cites work: How much can taxes help selfish routing?
cites work: Pricing network edges for heterogeneous selfish users
cites work: The effectiveness of stackelberg strategies and tolls for network congestion games
cites work: Q5002840
cites work: Taxes for linear atomic congestion games
cites work: Stackelberg Scheduling Strategies
cites work: Stackelberg strategies for atomic congestion games
cites work: On Stackelberg Strategies in Affine Congestion Games
cites work: Tight bounds for selfish and greedy load balancing
cites work: Q5111703
cites work: A Unifying Tool for Bounding the Quality of Non-cooperative Solutions in Weighted Congestion Games
cites work: The speed of convergence in congestion games under best-response dynamics
cites work: Q4340161
cites work: Q4821526
cites work: Stackelberg strategies for selfish routing in general multicommodity networks
Wikidata QID: Q129608535
DOI: 10.1016/J.TCS.2018.06.038
Recommended article: Q3059186
Recommended article: Performances of One-Round Walks in Linear Congestion Games
Recommended article: Performance of one-round walks in linear congestion games
Recommended article: Bounding the inefficiency of equilibria in nonatomic congestion games
Recommended article: Models of Non-atomic Congestion Games – From Unicast to Multicast Routing
Recommended article: Atomic congestion games with random players: network equilibrium and the price of anarchy
Recommended article: Atomic routing games on maximum congestion
Recommended article: Atomic Routing Games on Maximum Congestion
Recommended article: On the one-dimensional mean-field games with congestion
Recommended article: Equilibria in Multiclass and Multidimensional Atomic Congestion Games
description: scientific article; zbMATH DE number 7035845