( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Almost envy-free allocations with connected bundles.

, , , , , , , и . Games Econ. Behav., (2022)

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

Michele Fossi

 

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

On Routing of Wavebands for Gossiping in All-Optical Paths and Cycles., , и . SIROCCO, том 17 из Proceedings in Informatics, стр. 133-145. Carleton Scientific, (2003)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)Graphical Congestion Games., , , и . Algorithmica, 61 (2): 274-297 (2011)Pareto approximations for the bicriteria scheduling problem., , и . J. Parallel Distributed Comput., 66 (3): 393-402 (2006)On routing of wavebands for all-to-all communications in all-optical paths and cycles., , и . Theor. Comput. Sci., 333 (3): 401-413 (2005)When ignorance helps: Graphical multicast cost sharing games., , , и . Theor. Comput. Sci., 411 (3): 660-671 (2010)Experimental analysis of online algorithms for the bicriteria scheduling problem., , и . J. Parallel Distributed Comput., 64 (9): 1086-1100 (2004)Minimizing total busy time in parallel scheduling with application to optical networks., , , , , , и . Theor. Comput. Sci., 411 (40-42): 3553-3562 (2010)Optimizing regenerator cost in traffic grooming., , , , и . Theor. Comput. Sci., 412 (52): 7109-7121 (2011)Approximating the traffic grooming problem., , , и . J. Discrete Algorithms, 6 (3): 472-479 (2008)