328 citations · 849 across the 44 of their papers we have counts for
5 papers · 1 filter
The Price of Anarchy is Unbounded for Congestion Games with Superpolynomial Latency Costs
Rajgopal Kannan, Costas Busch, Paul Spirakis
We consider non-cooperative unsplittable congestion games where players share resources, and each player's strategy is pure and consists of a subset of the resources on which it ap…
Polynomial Bottleneck Congestion Games with Optimal Price of Anarchy
Rajgopal Kannan, Costas Busch, Athanasios Vasilakos
We study {\em bottleneck congestion games} where the social cost is determined by the worst congestion of any resource. These games directly relate to network routing problems and…
Bottleneck Routing Games with Low Price of Anarchy
Rajgopal Kannan, Costas Busch
We study {\em bottleneck routing games} where the social cost is determined by the worst congestion on any edge in the network. In the literature, bottleneck games assume player ut…
The Impact of Exponential Utility Costs in Bottleneck Routing Games
Rajgopal Kannan, Costas Busch
We study bottleneck routing games where the social cost is determined by the worst congestion on any edge in the network. Bottleneck games have been studied in the literature by ha…
Bicretieria Optimization in Routing Games
Costas Busch, Rajgopal Kannan
Two important metrics for measuring the quality of routing paths are the maximum edge congestion and maximum path length . Here, we study bicriteria in routing games where e…