Congestion Games: Optimization in Competition.

Abstract

abstract. In a congestion game, several players simultaneously aim at allocating sets of resources, e.g., each player aims at allocating a shortest path between a source/destination pair in a given network or, to give another example, each player aims at allocating a minimum weight spanning tree in a given graph. The cost (length, delay, weight) of a resource (edge) is a function of the congestion, i.e., the number of players allocating the resource. In this paper, we survey recent results about the complexity of computing Nash equilibria for congestion games and the convergence time towards Nash equilibria. 1

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 69 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.