Journal of the ACM (JACM)
A game-theoretic approach towards congestion control in communication networks
ACM SIGCOMM Computer Communication Review
Selfish behavior and stability of the internet:: a game-theoretic analysis of TCP
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Slotted Aloha as a game with partial information
Computer Networks: The International Journal of Computer and Telecommunications Networking
The Price of Stability for Network Design with Fair Cost Allocation
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
The Price of Routing Unsplittable Flow
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
The price of anarchy of finite congestion games
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Efficient contention resolution protocols for selfish agents
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Algorithmic Game Theory
Intrinsic robustness of the price of anarchy
Proceedings of the forty-first annual ACM symposium on Theory of computing
Theoretical Computer Science
Equilibria in Dynamic Selfish Routing
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
Nash Equilibria and the Price of Anarchy for Flows over Time
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Contention resolution under selfishness
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Braess's paradox for flows over time
SAGT'10 Proceedings of the Third international conference on Algorithmic game theory
Game-Theoretic analysis of internet switching with selfish users
WINE'05 Proceedings of the First international conference on Internet and Network Economics
A Stackelberg strategy for routing flow over time
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
| Hi-index | 0.00 |
We study time-dependent strategies for playing congestion games. The players can time their participation in the game with the hope that fewer players will compete for the same resources. We study two models: the boat model, in which the latency of a player is influenced only by the players that start at the same time, and the conveyor belt model in which the latency of a player is affected by the players that share the system, even if they started earlier or later; unlike standard congestion games, in these games the order of the edges in the paths affect the latency of the players. We characterize the symmetric Nash equilibria of the games with affine latencies of networks of parallel links in the boat model and we bound their price of anarchy and stability. For the conveyor belt model, we characterize the symmetric Nash equilibria of two players on parallel links. We also show that the games of the boat model are themselves congestion games. The same is true for the games of two players for the conveyor belt model; however, for this model the games of three or more players are not in general congestion games and may not have pure equilibria.