Communication networks and more in general distributed systems are undergoing rapid advancements. The last few years have experienced a steep growth in research on different related aspects. However, although the great promise for our future communication capabilities, several challenges need still to be addressed. A crucial ingredient for the...
-
April 1, 2010 (v1)PublicationUploaded on: December 3, 2022
-
February 19, 2010 (v1)Journal article
We study the performances of Nash equilibria in isolation games, a class of competitive location games recently introduced in Zhao et al. (Proc. of the 19th International Symposium on Algorithms and Computation (ISAAC), pp. 148–159, 2008). For all the cases in which the existence of Nash equilibria has been shown, we give tight or...
Uploaded on: December 3, 2022 -
2012 (v1)Journal article
Bounding the price of stability of undirected network design games with fair cost allocation is a challenging open problem in the Algorithmic Game Theory research agenda. Even though the generalization of such games in directed networks is well understood in terms of the price of stability (it is exactly H n , the n-th harmonic number, for...
Uploaded on: March 25, 2023 -
September 5, 2010 (v1)Journal article
International audience
Uploaded on: December 3, 2022 -
January 1, 2010 (v1)Book section
In an optical network using the wavelength division multiplexing (WDM) technology, routing a request consists in assigning it a route in the physical network and a wavelength. If each request uses $1/g$ of the bandwidth of the wavelength, we will say that the grooming factor is $g$. That means that on a given edge of the network we can groom...
Uploaded on: December 3, 2022