Performance of one-round walks in linear congestion games
type: Item
instance of: scholarly article
title: Performance of one-round walks in linear congestion games
zbMATH Open document ID: 1278.91011
author: Vittorio Bilò
author: Angelo Fanelli
author: Michele Flammini
author: Luca Moscardelli
published in: Theory of Computing Systems
publication date: 2011-11-23T00:00:00Z
Mathematics Subject Classification ID: 91A10
Mathematics Subject Classification ID: 91A80
zbMATH DE Number: 5977802
MaRDI profile type: Publication
full work available at URL: s00224-010-9309-0
OpenAlex ID: W3155157870
cites work: On the impact of combinatorial structure on congestion games
cites work: The Price of Stability for Network Design with Fair Cost Allocation
cites work: The Price of Routing Unsplittable Flow
cites work: Tight Bounds for Selfish and Greedy Load Balancing
cites work: Q2934594
cites work: The price of anarchy of finite congestion games
cites work: Algorithms – ESA 2005
cites work: Convergence and Approximation in Potential Games
cites work: The complexity of pure Nash equilibria
cites work: The Speed of Convergence in Congestion Games under Best-Response Dynamics
cites work: Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchy
cites work: Approximation and Online Algorithms
cites work: On the Existence of Pure Nash Equilibria in Weighted Congestion Games
cites work: Characterizing the Existence of Potential Functions in Weighted Congestion Games
cites work: How easy is local search?
cites work: Q3409969
cites work: Atomic resource sharing in noncooperative networks
cites work: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
cites work: Potential games
cites work: Algorithms for pure Nash equilibria in weighted congestion games
cites work: A class of games possessing pure-strategy Nash equilibria
cites work: Q3549719
DOI: 10.1007/S00224-010-9309-0
Recommended article: Performances of One-Round Walks in Linear Congestion Games
Recommended article: Q3059186
Recommended article: Non-atomic one-round walks in congestion games
Recommended article: Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchy
Recommended article: Congestion games with linearly independent paths: convergence time and price of anarchy
Recommended article: On the Performance of Approximate Equilibria in Congestion Games
Recommended article: On the performance of approximate equilibria in congestion games
Recommended article: On the Inefficiency of Equilibria in Linear Bottleneck Congestion Games
Recommended article: A First Step Towards Analyzing the Convergence Time in Player-Specific Singleton Congestion Games
description: scientific article; zbMATH DE number 5977802