Sciweavers

117 search results - page 9 / 24
» Altruism in Congestion Games
Sort
View
INFOCOM
2010
IEEE
13 years 8 months ago
A Theoretical Framework for Hierarchical Routing Games
—Most theoretical research on routing games in telecommunication networks has so far dealt with reciprocal congestion effects between routed entities. Yet in networks that suppor...
Vijay Kamble, Eitan Altman, Rachid El Azouzi, Vino...
WICON
2008
13 years 11 months ago
Quality of routing congestion games in wireless sensor networks
We consider congestion games in wireless sensor networks that offer quantitatively distinct classes of routing paths. Each routing class is characterized by a service cost. Within...
Costas Busch, Rajgopal Kannan, Athanasios V. Vasil...
SAGT
2009
Springer
176views Game Theory» more  SAGT 2009»
14 years 4 months ago
Bayesian Auctions with Friends and Foes
We study auctions whose bidders are embedded in a social or economic network. As a result, even bidders who do not win the auction themselves might derive utility from the auction,...
Po-An Chen, David Kempe
ESA
2009
Springer
130views Algorithms» more  ESA 2009»
14 years 4 months ago
On the Performance of Approximate Equilibria in Congestion Games
We study the performance of approximate Nash equilibria for congestion games with polynomial latency functions. We consider how much the price of anarchy worsens and how much the ...
George Christodoulou, Elias Koutsoupias, Paul G. S...
SIGECOM
2005
ACM
134views ECommerce» more  SIGECOM 2005»
14 years 3 months ago
Congestion games with failures
We introduce a new class of games, congestion games with failures (CGFs), which extends the class of congestion games to allow for facility failures. In a basic CGF (BCGF) agents ...
Michal Penn, Maria Polukarov, Moshe Tennenholtz