Sciweavers

14 search results - page 1 / 3
» Equilibria and price of anarchy in parallel relay networks w...
Sort
View
CISS
2008
IEEE
13 years 10 months ago
Equilibria and price of anarchy in parallel relay networks with node pricing
Abstract—We study pricing games in single-layer relay networks where the source routes traffic selfishly according to the strategic bids made by relays. Each relay’s bid incl...
Yufang Xi, Edmund M. Yeh
PODC
2003
ACM
13 years 8 months ago
On a network creation game
We introduce a novel game that models the creation of Internet-like networks by selfish node-agents without central design or coordination. Nodes pay for the links that they esta...
Alex Fabrikant, Ankur Luthra, Elitza N. Maneva, Ch...
ESA
2007
Springer
153views Algorithms» more  ESA 2007»
13 years 7 months ago
Tradeoffs and Average-Case Equilibria in Selfish Routing
We consider the price of selfish routing in terms of tradeoffs and from an average-case perspective. Each player in a network game seeks to send a message with a certain length by...
Martin Hoefer, Alexander Souza
MST
2011
184views Hardware» more  MST 2011»
12 years 10 months ago
Stackelberg Strategies and Collusion in Network Games with Splittable Flow
We study the impact of collusion in network games with splittable flow and focus on the well established price of anarchy as a measure of this impact. We first investigate symmet...
Tobias Harks
ICS
2010
Tsinghua U.
14 years 1 months ago
A New Look at Selfish Routing
: We revisit price of anarchy in network routing, in a new model in which routing decisions are made by self-interested components of the network, as opposed to by the flows as in ...
Christos Papadimitriou, Gregory Valiant