Price of Anarchy for Non-atomic Congestion Games with Stochastic Demands

We generalize the notions of user equilibrium and system optimum to non-atomic congestion games with stochastic demands. We establish upper bounds on the price of anarchy for three different settings of link cost functions and demand distributions, namely, (a) affine cost functions and general distributions, (b) polynomial cost functions and general positive-valued distributions, and (c) … Read more

The Price of Atomic Selfish Ring Routing

We study selfish routing in ring networks with respect to minimizing the maximum latency. Our main result is an establishement of constant bounds on the price of stability (PoS) for routing unsplittable flows with linear latency. We show that the PoS is at most 6.83, which reduces to 4:57 when the linear latency functions are … Read more

On-line Service Scheduling

This paper is concerned with a scheduling problem that occurs in service systems, where customers are classified as `ordinary’ and `special’. Ordinary customers can be served on any service facility, while special customers can be served only on the flexible service facilities. Customers arrive dynamically over time and their needs become known upon arrival. We … Read more

A Multi-Exchange Local Search Algorithm for the Capacitated Facility Location Problem

We present a multi-exchange local search algorithm for approximating the capacitated facility location problem (CFLP), where a new local improvement operation is introduced that possibly exchanges multiple facilities simultaneously. We give a tight analysis for our algorithm and show that the performance guarantee of the algorithm is between $3+2\sqrt{2}-\epsilon$ and $3+2\sqrt{2}+\epsilon$ for any given constant … Read more