We study adaptive routing algorithms in a round-based model. Suppose we are given a network equipped with load-dependent latency functions on the edges and a set of commodities eac...
We study rerouting policies in a dynamic round-based variant of a well known game theoretic traffic model due to Wardrop. Previous analyses (mostly in the context of selfish routi...
The paper studies routing in loss networks in the framework of a non-cooperative game with selfish users. Two solution concepts are considered: the Nash equilibrium, corresponding...
Eitan Altman, Rachid El Azouzi, Vyacheslav M. Abra...
In this paper we study stochastic dynamic games with many players that are relevant for a wide range of social, economic, and engineering applications. The standard solution conce...
Sachin Adlakha, Ramesh Johari, Gabriel Y. Weintrau...
Abstract. In this work, we consider an interesting variant of the wellstudied KP model [18] for selfish routing that reflects some influence from the much older Wardrop model [3...