( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Stackelberg Strategies for Network Design Games.

, , и . 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.

Michele Galletti

Michele Ocken

Michele Ferrari

Hannelore Michele

Melanie Michele

 

Другие публикации лиц с тем же именем

On Routing of Wavebands for Gossiping in All-Optical Paths and Cycles., , и . SIROCCO, том 17 из Proceedings in Informatics, стр. 133-145. Carleton Scientific, (2003)Learning DNF Formulae Under Classes of Probability Distributions., , и . COLT, стр. 85-92. ACM, (1992)On Minimizing the Number of ADMs in a General Topology Optical Network., , и . DISC, том 4167 из Lecture Notes in Computer Science, стр. 459-473. Springer, (2006)Multicast Transmissions in Non-cooperative Networks with a Limited Number of Selfish Moves., , , и . MFCS, том 4162 из Lecture Notes in Computer Science, стр. 363-374. Springer, (2006)Deadlock-Free Interval Routing Schemes.. STACS, том 1200 из Lecture Notes in Computer Science, стр. 351-362. Springer, (1997)A Complete Characterization of the Path Layout Construction Problem for ATM Networks with Given Hop Count and Load., , и . Parallel Process. Lett., 8 (2): 207-220 (1998)The Impact of Selfishness in Hypergraph Hedonic Games., , и . AAAI, стр. 1766-1773. AAAI Press, (2020)On Pareto Optimality in Social Distance Games., , и . AAAI, стр. 349-355. AAAI Press, (2017)Graphical Congestion Games., , , и . Algorithmica, 61 (2): 274-297 (2011)Computing Approximate Nash Equilibria in Network Congestion Games with Polynomially Decreasing Cost Functions., , , и . WINE, том 9470 из Lecture Notes in Computer Science, стр. 118-131. Springer, (2015)