The Traffic Grooming Problem in Optical Networks with Respect to ADMs and OADMs: Complexity and Approximation

Autor: Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks

Publikováno v: Algorithms, Vol 14, Iss 5, p 151 (2021)

All-optical networks transmit messages along lightpaths in which the signal is transmitted using the same wavelength in all the relevant links. We consider the problem of switching cost minimization in these networks. Specifically, the input to the p

Externí odkaz: https://doaj.org/article/6c1f3c88d97b456e9ab686e4ad3f5534

On Multidimensional Congestion Games

Autor: Vittorio Bilò, Michele Flammini, Vasco Gallotti, Cosimo Vinci

Publikováno v: Algorithms, Vol 13, Iss 10, p 261 (2020)

We introduce multidimensional congestion games, that is, congestion games whose set of players is partitioned into d+1 clusters C0,C1,…,Cd. Players in C0 have full information about all the other participants in the game, while players in Ci, for a

Externí odkaz: https://doaj.org/article/426412d874a24e1085d70fa77a684425

Approximate Strategyproof Mechanisms for the Additively Separable Group Activity Selection Problem

Autor: Michele Flammini, Giovanna Varricchio

Publikováno v: Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence.

We investigate strategyproof mechanisms in the Group Activity Selection Problem with the additively separable property. Namely, agents have distinct preferences for each activity and individual weights for the other agents. We evaluate our mechanisms

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::15aff3bb264119bb1e5360ee6e93f771
https://doi.org/10.24963/ijcai.2022/43

Almost envy-free allocations with connected bundles

Autor: Vittorio Bilò, Michele Flammini, Ioannis Caragiannis, Ayumi Igarashi, Gianpiero Monaco, Cosimo Vinci, William S. Zwicker, Dominik Peters

Publikováno v: Bilo, V, Caragiannis, I, Flammini, M, Igarashi, A, Monaco, G, Peters, D, Vinci, C & Zwicker, W 2022, ' Almost envy-free allocations with connected bundles ', Games and Economic Behavior, vol. 131, pp. 197-221 . https://doi.org/10.1016/j.geb.2021.11.006

We study the existence of allocations of indivisible goods that are envy-free up to one good (EF1), under the additional constraint that each bundle needs to be connected in an underlying item graph. If the graph is a path and the utility functions a

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::15f6f0fc4e188c0bae6409b95ae5c187
http://hdl.handle.net/11697/175539

The price of stability for undirected broadcast network design with fair cost allocation is constant

Autor: Michele Flammini, Luca Moscardelli, Vittorio Bilò

Publikováno v: FOCS

We consider broadcast network design games in undirected networks in which every player is a node wishing to receive communication from a distinguished source node s and the cost of each communication link is equally shared among the downstream recei

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::93467824e8d341a8a9e4073a586005c9
https://www.sciencedirect.com/science/article/pii/S089982561400150X