Abstract. We consider network congestion games in which a finite number of non-cooperative users select paths. The aim is to mitigate the inefficiency caused by the selfish users...
Dimitris Fotakis, George Karakostas, Stavros G. Ko...
We study convergence of ε-Nash dynamics in congestion games when delay functions of all resources are similar. Delay functions are said to be similar if their values are within a...
While the class of congestion games has been thoroughly studied in the multi-agent systems literature, settings with incomplete information have received relatively little attenti...
Congestion games—in which players strategically choose from a set of “resources” and derive utilities that depend on the congestion on each resource— are important in a wid...
Andrew Byde, Maria Polukarov, Nicholas R. Jennings
Consider the following game. Given a network with a continuum of users at some origins, suppose that users wish to reach specic destinations, but that they are not indierent to the...