• Publications
  • Influence
Selfish Routing in Capacitated Networks
TLDR
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
  • 395
  • 36
  • PDF
Common-Lines and Passenger Assignment in Congested Transit Networks
TLDR
We analyze a Wardrop equilibrium model for passenger assignment in general transit networks, including the effects of congestion over the passengers' choices. Expand
  • 172
  • 16
  • PDF
Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes
TLDR
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
  • 120
  • 14
  • PDF
Fast, Fair, and Efficient Flows in Networks
TLDR
We study the problem of minimizing the maximum latency of flows in networks with congestion. Expand
  • 88
  • 13
  • PDF
Single-Machine Scheduling with Precedence Constraints
TLDR
We discuss the problem of sequencing precedence-constrained jobs on a single machine to minimize the average weighted completion time. Expand
  • 74
  • 12
  • PDF
On the Inefficiency of Equilibria in Congestion Games
TLDR
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
  • 111
  • 11
  • PDF
The Impact of Oligopolistic Competition in Networks
TLDR
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
  • 100
  • 9
  • PDF
Network Games with Atomic Players
TLDR
We study network and congestion games with atomic players that can split their flow. Expand
  • 78
  • 9
  • PDF
LP-based online scheduling: from single to parallel machines
TLDR
We study classic machine sequencing problems in an online setting. Expand
  • 61
  • 9
  • PDF
Approximation schemes for multidimensional packing
TLDR
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
  • 39
  • 9
  • PDF
...
1
2
3
4
5
...