Atomic congestion games: fast, myopic and concurrent
type: Item
instance of: scholarly article
title: Atomic congestion games: fast, myopic and concurrent
zbMATH Open document ID: 1203.91119
author: Dimitris Fotakis
author: A. C. Kaporis
author: P. G. Spirakis
published in: Theory of Computing Systems
publication date: 2010-08-13T00:00:00Z
Mathematics Subject Classification ID: 91B32
Mathematics Subject Classification ID: 91A10
zbMATH DE Number: 5770236
zbMATH Keywords: distributed congestion games
zbMATH Keywords: atomic model
zbMATH Keywords: approximate Nash equilibria
MaRDI profile type: Publication
full work available at URL: s00224-009-9198-2
OpenAlex ID: W4241368548
Wikidata QID: Q59818445
cites work: Q4228507
cites work: Distributed selfish load balancing
cites work: Routing without regret
cites work: Q2934594
cites work: Fast convergence of selfish rerouting
cites work: The complexity of pure Nash equilibria
cites work: Fast convergence to Wardrop equilibria by adaptive sampling methods
cites work: Adaptive routing with stale information
cites work: Selfish unsplittable flows
cites work: Atomic Congestion Games Among Coalitions
cites work: The effect of collusion in congestion games
cites work: Q3409969
cites work: Q4856179
cites work: A class of games possessing pure-strategy Nash equilibria
cites work: Q3083744
cites work: Potential games with continuous player sets
cites work: Q4885257
DOI: 10.1007/S00224-009-9198-2
description: scientific article; zbMATH DE number 5770236