Routing Games in the many players regime

Eitan Altman; Richard Combes; Zwi Altman; Sylvain Sorin

4th International ICST Workshop on Game Theory in Communication Networks

Research Article

Routing Games in the many players regime

Cite: BibTeX Plain Text

@INPROCEEDINGS{10.4108/icst.valuetools.2011.245785,
    author={Eitan Altman and Richard Combes and Zwi Altman and Sylvain Sorin},
    title={Routing Games in the many players regime},
    proceedings={4th International ICST Workshop on Game Theory in Communication Networks},
    publisher={ACM},
    proceedings_a={GAMECOMM},
    year={2012},
    month={6},
    keywords={routing games nash equilibria wardrop equilibria routing game theory communication networks},
    doi={10.4108/icst.valuetools.2011.245785}
}

Eitan Altman
Richard Combes
Zwi Altman
Sylvain Sorin
Year: 2012
Routing Games in the many players regime
GAMECOMM
ICST
DOI: 10.4108/icst.valuetools.2011.245785

Eitan Altman¹^,*, Richard Combes², Zwi Altman², Sylvain Sorin³

1: INRIA
2: Orange Labs
3: Paris VI

*Contact email: Eitan.Altman@sophia.inria.fr

Abstract

A paper by Haurie and Marcotte has established the convergence of the Nash equilibrium in routing games to the Wardrop equilibrium as the number of players grows. The result was obtained under diagonal strict convexity assumption. We extend this result and establish the convergence under weaker convexity assumptions (the B type cost structure of the article by Orda, Rom and Shimkin).

Keywords: routing games nash equilibria wardrop equilibria routing game theory communication networks

Published: 2012-06-26
Publisher: ACM

: http://dx.doi.org/10.4108/icst.valuetools.2011.245785