Sciweavers

1087 search results - page 5 / 218
» Dynamics in congestion games
Sort
View
COCOON
2009
Springer
14 years 3 months ago
On the Performances of Nash Equilibria in Isolation Games
: Network games play a fundamental role in understanding behavior in many domains, ranging from communication networks through markets to social networks. Such networks are used, a...
Vittorio Bilò, Michele Flammini, Gianpiero ...
AAIM
2006
Springer
121views Algorithms» more  AAIM 2006»
14 years 2 months ago
Atomic Routing Games on Maximum Congestion
We study atomic routing games on networks in which players choose a path with the objective of minimizing the maximum congestion along the edges of their path. The social cost is t...
Costas Busch, Malik Magdon-Ismail
WINE
2007
Springer
128views Economy» more  WINE 2007»
14 years 2 months ago
Total Latency in Singleton Congestion Games
Abstract. In this work, we consider singleton congestion games as a special class of (weighted) congestion games where each players' strategy consists only of a single resourc...
Martin Gairing, Florian Schoppmann
MST
2010
98views more  MST 2010»
13 years 7 months ago
Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchy
Abstract. We investigate the effect of linear independence in the strategies of congestion games on the convergence time of best improvement sequences and on the pure Price of Anar...
Dimitris Fotakis
CDC
2009
IEEE
177views Control Systems» more  CDC 2009»
14 years 1 months ago
A control theoretic approach to noncooperative game design
— This paper investigates design of noncooperative games from a control theoretic perspective. Pricing mechanisms are used as a design tool to ensure that the Nash equilibrium of...
Tansu Alpcan, Lacra Pavel, Nem Stefanovic