ABSTRACT. We study the problem of assigning unsplittable traffic to a set of m links so to minimize the maximum link congestion. (i.e., the makespan).

We study the problem of assigning unsplittable traffic to a set of m links so to minimize the maximum link congestion (i.e., the makespan).

ABSTRACT. We study the problem of assigning unsplittable traffic to a set of m links so to minimize the maximum link congestion. (i.e., the makespan).

How to route and tax selfish unsplittable traffic · V. Auletta, R. Prisco, +1 author. G. Persiano · Published in ACM Symposium on Parallelism… 27 June 2004 ...

Oct 22, 2024 · Our mechanism design counterpart is a possible way of reducing the effect of selfish behavior via suitable incentives to the agents (i.e., taxes ...

How to route and tax selfish unsplittable traffic. Auletta, V., Prisco, R. D., Penna, P., & Persiano, P. In Gibbons, P. B. & Adler, M., editors, SPAA 2004 ...

Persiano}, TITLE = {How to Route and Tax Selfish Unsplittable Traffic}, BOOKTITLE = {Proc. of the 16th ACM Symposium on Parallelism in Algorithms and ...

We consider the case of selfish agents owning pieces of the traffic. In particular, we introduce a variant of the model by Koutsopias and Papadimitriou [1999] in ...

Abstract. We consider general resource assignment games involving selfish users/agents in which users compete for resources and try to be assigned to those ...

In this paper, we assume this more realistic unsplittable model, and investigate the "price of anarchy", or deterio- ration of network performance measured in ...