( en | de | ru )

 

Disambiguation of "Flammini, Michele"

Author of the publication

copydeleteadd this publication to your clipboard
Stackelberg Strategies for Network Design Games.

, , and . Internet Math., 9 (4): 336-359 (2013)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Michele Galletti

Michele Ocken

Michele Ferrari

Hannelore Michele

Michèle Mattusch

 

Other publications of authors with the same name

Learning DNF Formulae Under Classes of Probability Distributions., , and . COLT, page 85-92. ACM, (1992)Deadlock-Free Interval Routing Schemes.. STACS, volume 1200 of Lecture Notes in Computer Science, page 351-362. Springer, (1997)Multicast Transmissions in Non-cooperative Networks with a Limited Number of Selfish Moves., , , and . MFCS, volume 4162 of Lecture Notes in Computer Science, page 363-374. Springer, (2006)On Routing of Wavebands for Gossiping in All-Optical Paths and Cycles., , and . SIROCCO, volume 17 of Proceedings in Informatics, page 133-145. Carleton Scientific, (2003)Graphical Congestion Games., , , and . Algorithmica, 61 (2): 274-297 (2011)On routing of wavebands for all-to-all communications in all-optical paths and cycles., , and . Theor. Comput. Sci., 333 (3): 401-413 (2005)When ignorance helps: Graphical multicast cost sharing games., , , and . Theor. Comput. Sci., 411 (3): 660-671 (2010)Experimental analysis of online algorithms for the bicriteria scheduling problem., , and . J. Parallel Distributed Comput., 64 (9): 1086-1100 (2004)Approximating the traffic grooming problem., , , and . J. Discrete Algorithms, 6 (3): 472-479 (2008)Guest Editorial: Special Issue on Algorithmic Game Theory., and . Theory Comput. Syst., 63 (7): 1449-1450 (2019)