We consider the price of anarchy of pure Nash equilibria in congestion games with linear latency functions. For asymmetric games, the price of anarchy of maximum social cost is Î˜(âˆšN), where N is theâ€¦ (More)

We prove that the <italic>work function algorithm</italic> for the <italic>k</italic>-server problem has a competitive ratio at most 2<italic>k</italic>âˆ’1. Manasse et al. [1988] conjectured that theâ€¦ (More)

We propose a plausible explanation of the power law distributions of degrees observed in the graphs arising in the Internet topology [Faloutsos, Faloutsos, and Faloutsos, SIGCOMM 1999] based on a toyâ€¦ (More)

We consider the price of stability for Nash and correlated equilibria of linear congestion games. The price of stability is the optimistic price of anarchy, the ratio of the cost of the best Nash orâ€¦ (More)

Finding related Web pages is important for assisting usersâ€™ information retrieval from the Web. In general, related Web pages are densely connected with each other by hyperlinks, and graph miningâ€¦ (More)

We consider the special case of the traveling salesman problem (TSP) in which the distance metric is the shortest-path metric of a planar unweighted graph. We present a polynomial-time approximationâ€¦ (More)