Sciweavers

53 search results - page 1 / 11
» Computing equilibria for congestion games with (im)perfect i...
Sort
View
SODA
2004
ACM
128views Algorithms» more  SODA 2004»
14 years 11 months ago
Computing equilibria for congestion games with (im)perfect information
We study algorithmic questions concerning a basic microeconomic congestion game in which there is a single provider that offers a service to a set of potential customers. Each cus...
René Beier, Artur Czumaj, Piotr Krysta, Ber...
ESA
2010
Springer
236views Algorithms» more  ESA 2010»
14 years 10 months ago
Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games
Bottleneck congestion games properly model the properties of many real-world network routing applications. They are known to possess strong equilibria
Tobias Harks, Martin Hoefer, Max Klimm, Alexander ...
ACID
2006
298views Algorithms» more  ACID 2006»
14 years 11 months ago
Congestion Games: Optimization in Competition
In a congestion game, several players simultaneously aim at allocating sets of resources, e.g., each player aims at allocating a shortest path between a source/destination pair in ...
Berthold Vöcking
DFG
2009
Springer
15 years 4 months ago
Models of Non-atomic Congestion Games - From Unicast to Multicast Routing
Abstract. We give an overview of important results for non-atomic congestion games in their traditional form along with self-contained and short proofs and then present new results...
Lasse Kliemann, Anand Srivastav
TCS
2010
14 years 4 months ago
Window-games between TCP flows
We consider network congestion problems between TCP flows and define a new game, the Window-game, which models the problems of network congestion caused by the competing flows. An...
Pavlos S. Efraimidis, Lazaros Tsavlidis, George B....