— We consider a multiuser network that is shared by noncooperative users. Each user sets up virtual paths that optimize its own selfish performance measure. This measure account...
Aurel A. Lazar, Ariel Orda, Dimitrios E. Pendaraki...
Time-varying congestion on Internet paths and failures due to software, hardware, and configuration errors often disrupt packet delivery on the Internet. Many aproaches to avoidi...
David G. Andersen, Alex C. Snoeren, Hari Balakrish...
This paper revisits the fundamental trade-off between endto-end and hop-by-hop transport control. The end-to-end principle has been one of the building blocks of the Internet; but...
Simon Heimlicher, Merkourios Karaliopoulos, Hanoch...
Abstract. In this paper we present a cooperative game theoretic interpretation of the shortest path problem. We consider a buying agent who has a budget to go from a specified sou...
We consider collusion in path procurement auctions, where payments are determined using the VCG mechanism. We show that collusion can increase the utility of the agents, and in som...