We study bottleneck congestion games where the social cost is determined by the worst congestion of any resource. These games directly relate to network routing problems and also job-shop scheduling problems. In typical bottleneck congestion games, the utility costs of the players are determined by the worst congested resources that they use. However, the resulting Nash equilibria are inefficie...

We consider a given region Ω where the traffic flows according to two regimes: in a region C we have a low congestion, where in the remaining part Ω \ C the congestion is higher. The two congestion functions H1 and H2 are given, but the region C has to be determined in an optimal way in order to minimize the total transportation cost. Various penalization terms on C are considered and some nume...

We introduce Colored Resource Allocation Games as a new model for selfish routing and wavelength assignment in multifiber all-optical networks. Colored Resource Allocation Games are a generalization of congestion and bottleneck games where players have their strategies in multiple copies (colors). We focus on two main subclasses of these games depending on the player cost: in Colored Congestion...

In determining the marginal cost of congestion, economists have traditionally relied upon directly measuring traffic congestion on network links, disregarding any “network effects,” since the latter are difficult to estimate. While for simple networks the comparison can be done within a theoretical framework, it is important to know whether such network effects in real large-scale networks are ...

We study the routing problem in massively dense static adhoc networks as the node density increases. We use a fluid approximation in which the graph providing the available routes becomes so dense that it can be approximated by a continuous area which inherits from the original problem the cost structure: a cost density is defined at each point on the limit plain; it is a function of the locati...

In practice, agents often act sequentially: they take their decisions one after the other and base their decisions on those that have already been taken. Such sequential behaviour can be modelled in a congestion game by putting an order on the players. Inspired by a playing technique for chess, we introduce a new framework for modelling anticipating players, parametrised by the number of succes...

While the class of congestion games has been thoroughly studied in the multi-agent systems literature, settings with incomplete information have received relatively little attention. In this paper we consider a setting in which the cost functions of resources in the congestion game are initially unknown. The agents gather information about these cost functions through repeated interaction, and ...

Experiments were conducted with a simulation model of a flow shop with prohibited early shipments under a wide variety of conditions including congestion, which was modeled separately as “blocking” and as “material handling cost (MHC).” Congestion was found to significantly degrade most standard measures of shop performance, with stronger effects at high utilization and with blocking. Contrary ...

The Urban Mobility Report (UMR) is a widely-cited study that quantifies and monetizes (measures in monetary units) traffic congestion costs in U.S. metropolitan regions. This report critically examines the UMR's assumptions and methods. The UMR reflects an older planning paradigm which assumes that " transportation " means automobile travel, and so evaluates transport system performance based p...