We present positive results on the efficiency of Nash equilibria in traffic networks for networks with capacities and for latency functions that are nonconvex, nondifferentiable, and even discontinuous.Expand

We analyze a Wardrop equilibrium model for passenger assignment in general transit networks, including the effects of congestion over the passengers' choices.Expand

We study the following packing problem: Given a collection of d-dimensional rectangles of specified sizes, pack them into the minimum number of unit cubes.Expand

We present a short geometric proof for the price of anarchy results that have recently been established in a series of papers on selfish routing in multicommodity flow networks.Expand

We study a generalization of this problem in which competitors, who may control a nonnegligible fraction of the total flow, ship goods across a network.Expand

We consider a classic multidimensional generalization of the bin packing problem, namely, packing d-dimensional rectangles into at most OPT bins whose sides have length (1 + ε), where OPT denotes the minimum number of unit bins required.Expand