Tight bounds for worst-case equilibria

Document Type

Conference Proceeding

Publication Date

1-1-2002

Abstract

The coordination ratio is a game theoretic measure that aims to reflect the price of selfish routing in a network. We show that the worst-case coordination ratio on m parallel links (of possibly different speeds) is Φ (log m/ log log log m) Our bound is asymptotically tight and it entirely resolves an open question posed recently by Koutsoupias and Papadimitriou [3].

Identifier

84968906622 (Scopus)

ISBN

[089871513X]

Publication Title

Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms

First Page

413

Last Page

420

Volume

06-08-January-2002

This document is currently not available here.

Share

COinS