168 search results - page 19 / 34 » The price of selfish routing |
109
click to vote
PPL
2006
14 years 11 months ago
2006
In the model of restricted parallel links, n users must be routed on m parallel links under the restriction that the link for each user be chosen from a certain set of allowed lin...
ESA
2007
Springer
15 years 6 months ago
2007
Springer
In this paper we study several routing problems that generalize shortest paths and the Traveling Salesman Problem. We consider a more general model that incorporates the actual co...
WAOA
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. We consider a Stackelberg pricing problem in directed networks. Tariffs have to be defined by an operator, the leader, for a subset of the arcs, the tariff arcs. Clien...
SIGECOM
2009
ACM
15 years 6 months ago
2009
ACM
We study the degree to which small fluctuations in costs in wellstudied potential games can impact the result of natural best-response and improved-response dynamics. We call thi...
109
Voted
ECAI
2008
Springer
15 years 1 months ago
2008
Springer
This paper reports on the design of a novel two-stage mechanism, based on strictly proper scoring rules, that motivates selfish rational agents to make a costly probabilistic estim...