Michele Flammini

ORCID

Publication Activity (10 Years)

Years Active: 1992-2024
Publications (10 Years): 62

Top Venues

AAAI

AAMAS

J. Artif. Intell. Res.

CoRR

Publications

Alessandro Aloisio, Michele Flammini, Cosimo Vinci
Generalized Distance Polymatrix Games. SOFSEM (2024)
Vittorio Bilò, Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Cosimo Vinci
On Green Sustainability of Resource Selection Games with Equitable Cost-Sharing. AAMAS (2024)
Alessandro Aloisio, Vittorio Bilò, Antonio Mario Caruso, Michele Flammini, Cosimo Vinci
Approximately Fair Allocation of Indivisible Items with Random Valuations. AAMAS (2024)
Simone Fioravanti, Michele Flammini, Bojana Kodric, Giovanna Varricchio
PAC learning and stabilizing Hedonic Games: towards a unifying approach. CoRR (2023)
Linh T. Duong, Phuong T. Nguyen, Ludovico Iovino, Michele Flammini
Automatic detection of Covid-19 from chest X-ray and lung computed tomography images using deep neural networks and transfer learning. Appl. Soft Comput. 132 (2023)
Alessandro Aloisio, Michele Flammini, Bojana Kodric, Cosimo Vinci
Distance Polymatrix Coordination Games (short paper). IPS-RCRA-SPIRIT@AI*IA (2023)
Simone Fioravanti, Michele Flammini, Bojana Kodric, Giovanna Varricchio
ε-fractional core stability in Hedonic Games. NeurIPS (2023)
Simone Fioravanti, Michele Flammini, Bojana Kodric, Giovanna Varricchio
PAC Learning and Stabilizing Hedonic Games: Towards a Unifying Approach. AAAI (2023)
Simone Fioravanti, Michele Flammini, Bojana Kodric, Giovanna Varricchio
ε-fractional Core Stability in Hedonic Games. CoRR (2023)
Vittorio Bilò, Ioannis Caragiannis, Michele Flammini, Ayumi Igarashi, Gianpiero Monaco, Dominik Peters, Cosimo Vinci, William S. Zwicker
Almost envy-free allocations with connected bundles. Games Econ. Behav. 131 (2022)
Alkida Balliu, Michele Flammini, Giovanna Melideo, Dennis Olivetti
On Pareto optimality in social distance games. Artif. Intell. 312 (2022)
Vittorio Bilò, Michele Flammini, Gianpiero Monaco, Luca Moscardelli
Pricing Problems with Buyer Preselection. J. Artif. Intell. Res. 74 (2022)
Andrea D'Ascenzo, Mattia D'Emidio, Michele Flammini, Gianpiero Monaco
Digraph k-Coloring Games: From Theory to Practice. SEA (2022)
Michele Flammini, Giovanna Varricchio
Approximate Strategyproof Mechanisms for the Additively Separable Group Activity Selection Problem. IJCAI (2022)
Michele Flammini, Bojana Kodric, Giovanna Varricchio
Strategyproof mechanisms for Friends and Enemies Games. Artif. Intell. 302 (2022)
Ludovico Iovino, Phuong Thanh Nguyen, Amleto Di Salle, Francesco Gallo, Michele Flammini
Unavailable Transit Feed Specification: Making it Available with Recurrent Neural Networks. CoRR (2021)
Alessandro Aloisio, Michele Flammini, Bojana Kodric, Cosimo Vinci
Distance Polymatrix Coordination Games. IJCAI (2021)
Vittorio Bilò, Michele Flammini, Luca Moscardelli
On Nash Equilibria in Non-Cooperative All-Optical Networks. Algorithms 14 (1) (2021)
Michele Flammini, Bojana Kodric, Gianpiero Monaco, Qiang Zhang
Strategyproof Mechanisms for Additively Separable and Fractional Hedonic Games. J. Artif. Intell. Res. 70 (2021)
Michele Flammini, Bojana Kodric, Martin Olsen, Giovanna Varricchio
Distance Hedonic Games. SOFSEM (2021)
Vittorio Bilò, Michele Flammini, Gianpiero Monaco, Luca Moscardelli
Computing approximate Nash equilibria in network congestion games with polynomially decreasing cost functions. Distributed Comput. 34 (1) (2021)
Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks
The Traffic Grooming Problem in Optical Networks with Respect to ADMs and OADMs: Complexity and Approximation. Algorithms 14 (5) (2021)
Michele Flammini, Manuel Mauro, Matteo Tonelli
On fair price discrimination in multi-unit markets. Artif. Intell. 290 (2021)
Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks
On the Online Coalition Structure Generation Problem. J. Artif. Intell. Res. 72 (2021)
Ludovico Iovino, Phuong Thanh Nguyen, Amleto Di Salle, Francesco Gallo, Michele Flammini
Unavailable Transit Feed Specification: Making It Available With Recurrent Neural Networks. IEEE Trans. Intell. Transp. Syst. 22 (4) (2021)
Vittorio Bilò, Michele Flammini, Vasco Gallotti, Cosimo Vinci
On Multidimensional Congestion Games. Algorithms 13 (10) (2020)
Vittorio Bilò, Michele Flammini, Luca Moscardelli
The price of stability for undirected broadcast network design with fair cost allocation is constant. Games Econ. Behav. 123 (2020)
Alessandro Aloisio, Michele Flammini, Cosimo Vinci
The Impact of Selfishness in Hypergraph Hedonic Games. AAAI (2020)
Edith Elkind, Angelo Fanelli, Michele Flammini
Price of Pareto Optimality in hedonic games. Artif. Intell. 288 (2020)
Michele Flammini, Bojana Kodric, Martin Olsen, Giovanna Varricchio
Distance Hedonic Games. AAMAS (2020)
Michele Flammini, Hugo Gilbert
Parameterized Complexity of Manipulating Sequential Allocation. ECAI (2020)
Michele Flammini, Bojana Kodric, Giovanna Varricchio
Strategyproof Mechanisms for Friends and Enemies Games. AAAI (2020)
Vittorio Bilò, Michele Flammini, Cosimo Vinci
The Quality of Content Publishing in the Digital Era. ECAI (2020)
Michele Flammini, Manuel Mauro, Matteo Tonelli, Cosimo Vinci
Inequity Aversion Pricing in Multi-Unit Markets. ECAI (2020)
Vittorio Bilò, Michele Flammini
Guest Editorial: Special Issue on Algorithmic Game Theory. Theory Comput. Syst. 63 (7) (2019)
Vittorio Bilò, Ioannis Caragiannis, Michele Flammini, Ayumi Igarashi, Gianpiero Monaco, Dominik Peters, Cosimo Vinci, William S. Zwicker
Almost Envy-Free Allocations with Connected Bundles. ITCS (2019)
Vittorio Bilò, Angelo Fanelli, Michele Flammini, Gianpiero Monaco, Luca Moscardelli
Optimality and Nash Stability in Additive Separable Generalized Group Activity Selection Problems. IJCAI (2019)
Alkida Balliu, Michele Flammini, Giovanna Melideo, Dennis Olivetti
On Non-Cooperativeness in Social Distance Games. J. Artif. Intell. Res. 66 (2019)
Luca Aceto, Gianlorenzo D'Angelo, Michele Flammini, Omar Inverso, Ludovico Iovino, Catia Trubiani
Building International Doctoral Schools in Computer Science in Italy, De Nicola's Way. Models, Languages, and Tools for Concurrent and Distributed Programming (2019)
Michele Flammini, Manuel Mauro, Matteo Tonelli
On social envy-freeness in multi-unit markets. Artif. Intell. 269 (2019)
Michele Flammini, Manuel Mauro, Matteo Tonelli
On Social Envy-Freeness in Multi-Unit Markets. AAAI (2018)
Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks
Online Coalition Structure Generation in Graph Games. AAMAS (2018)
Vittorio Bilò, Michele Flammini, Gianpiero Monaco, Luca Moscardelli
On the Impact of Buyers Preselection in Pricing Problems. AAMAS (2018)
Vittorio Bilò, Michele Flammini, Gianpiero Monaco, Luca Moscardelli
Pricing Problems with Buyer Preselection. MFCS (2018)
Michele Flammini, Manuel Mauro, Matteo Tonelli
On Fair Price Discrimination in Multi-Unit Markets. IJCAI (2018)
Vittorio Bilò, Angelo Fanelli, Michele Flammini, Gianpiero Monaco, Luca Moscardelli
Nash Stable Outcomes in Fractional Hedonic Games: Existence, Efficiency and Computation. J. Artif. Intell. Res. 62 (2018)
Vittorio Bilò, Ioannis Caragiannis, Michele Flammini, Ayumi Igarashi, Gianpiero Monaco, Dominik Peters, Cosimo Vinci, William S. Zwicker
Almost Envy-Free Allocations with Connected Bundles. CoRR (2018)
Michele Flammini, Vasco Gallotti, Giovanna Melideo, Gianpiero Monaco, Luca Moscardelli
Network Movement Games. Theor. Comput. Sci. 667 (2017)
Michele Flammini, Gianpiero Monaco, Qiang Zhang
Strategyproof Mechanisms for Additively Separable Hedonic Games and Fractional Hedonic Games. CoRR (2017)
Michele Flammini, Gianpiero Monaco, Qiang Zhang
Strategyproof Mechanisms for Additively Separable Hedonic Games and Fractional Hedonic Games. WAOA (2017)
Vittorio Bilò, Michele Flammini, Gianpiero Monaco
Approximating the revenue maximization problem with sharp demands. Theor. Comput. Sci. 662 (2017)
Vittorio Bilò, Ioannis Caragiannis, Angelo Fanelli, Michele Flammini, Gianpiero Monaco
Simple Greedy Algorithms for Fundamental Multidimensional Graph Problems. ICALP (2017)
Raffaello Carosi, Michele Flammini, Gianpiero Monaco
Computing Approximate Pure Nash Equilibria in Digraph k-Coloring Games. AAMAS (2017)
Alkida Balliu, Michele Flammini, Dennis Olivetti
On Pareto Optimality in Social Distance Games. AAAI (2017)
Alkida Balliu, Michele Flammini, Giovanna Melideo, Dennis Olivetti
Nash Stability in Social Distance Games. AAAI (2017)
Edith Elkind, Angelo Fanelli, Michele Flammini
Price of Pareto Optimality in Hedonic Games. AAAI (2016)
Vittorio Bilò, Angelo Fanelli, Michele Flammini, Gianpiero Monaco, Luca Moscardelli
The price of envy-freeness in machine scheduling. Theor. Comput. Sci. 613 (2016)
Michele Flammini, Giuseppe Persiano
Report on 1st GSSI Summer Meeting on Algorithms. Bull. EATCS 120 (2016)
Vittorio Bilò, Angelo Fanelli, Michele Flammini, Gianpiero Monaco, Luca Moscardelli
On the Price of Stability of Fractional Hedonic Games. AAMAS (2015)
Anna Angelucci, Vittorio Bilò, Michele Flammini, Luca Moscardelli
On the sequential price of anarchy of isolation games. J. Comb. Optim. 29 (1) (2015)
Vittorio Bilò, Michele Flammini, Gianpiero Monaco, Luca Moscardelli
Some Anomalies of Farsighted Strategic Behavior. Theory Comput. Syst. 56 (1) (2015)
Vittorio Bilò, Michele Flammini, Gianpiero Monaco, Luca Moscardelli
Computing Approximate Nash Equilibria in Network Congestion Games with Polynomially Decreasing Cost Functions. WINE (2015)
Vittorio Bilò, Michele Flammini, Gianpiero Monaco
Approximating the Revenue Maximization Problem with Sharp Demands. SWAT (2014)
Vittorio Bilò, Angelo Fanelli, Michele Flammini, Gianpiero Monaco, Luca Moscardelli
The Price of Envy-Freeness in Machine Scheduling. MFCS (2) (2014)
Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks
On the Complexity of the Regenerator Cost Problem in General Networks with Traffic Grooming. Algorithmica 68 (3) (2014)
Vittorio Bilò, Angelo Fanelli, Michele Flammini, Gianpiero Monaco, Luca Moscardelli
Nash Stability in Fractional Hedonic Games. WINE (2014)
Ioannis Caragiannis, Michele Flammini, Luca Moscardelli
An Exponential Improvement on the MST Heuristic for Minimum Energy Broadcasting in Ad Hoc Wireless Networks. IEEE/ACM Trans. Netw. 21 (4) (2013)
Angelo Fanelli, Michele Flammini, Luca Moscardelli
Stackelberg Strategies for Network Design Games. Internet Math. 9 (4) (2013)
Anna Angelucci, Vittorio Bilò, Michele Flammini, Luca Moscardelli
On the Sequential Price of Anarchy of Isolation Games. COCOON (2013)
Vittorio Bilò, Alessandro Celi, Michele Flammini, Vasco Gallotti
Social context congestion games. Theor. Comput. Sci. 514 (2013)
Vittorio Bilò, Michele Flammini, Luca Moscardelli
The price of stability of fair undirected broadcast games is constant. SIGecom Exch. 12 (2) (2013)
Vittorio Bilò, Michele Flammini, Luca Moscardelli
The Price of Stability for Undirected Broadcast Network Design with Fair Cost Allocation Is Constant. FOCS (2013)
Vittorio Bilò, Michele Flammini, Gianpiero Monaco
Approximating the Revenue Maximization Problem with Sharp Demands. CoRR (2013)
Angelo Fanelli, Michele Flammini, Luca Moscardelli
The speed of convergence in congestion games under best-response dynamics. ACM Trans. Algorithms 8 (3) (2012)
Vittorio Bilò, Michele Flammini, Vasco Gallotti
On Bidimensional Congestion Games. SIROCCO (2012)
Vittorio Bilò, Michele Flammini, Gianpiero Monaco, Luca Moscardelli
Some Anomalies of Farsighted Strategic Behavior. WAOA (2012)
Michele Flammini, Vasco Gallotti, Giovanna Melideo, Gianpiero Monaco, Luca Moscardelli
Mobile Network Creation Games. SIROCCO (2012)
Gianni Amati, Giuseppe Amodeo, Marco Bianchi, Giuseppe Marcone, Fondazione Ugo Bordoni, Carlo Gaibisso, Giorgio Gambosi, Alessandro Celi, Cesidio Di Nicola, Michele Flammini
FUB, IASI-CNR, UNIVAQ at TREC 2011 Microblog Track. TREC (2011)
Ioannis Caragiannis, Michele Flammini, Christos Kaklamanis, Panagiotis Kanellopoulos, Luca Moscardelli
Tight Bounds for Selfish and Greedy Load Balancing. Algorithmica 61 (3) (2011)
Vittorio Bilò, Michele Flammini
Extending the notion of rationality of selfish agents: Second Order Nash equilibria. Theor. Comput. Sci. 412 (22) (2011)
Angelo Fanelli, Michele Flammini, Domenico Mango, Giovanna Melideo, Luca Moscardelli
Experimental Evaluations of Algorithms for IP Table Minimization. J. Interconnect. Networks 12 (4) (2011)
Michele Flammini, Alberto Marchetti-Spaccamela, Gianpiero Monaco, Luca Moscardelli, Shmuel Zaks
On the complexity of the regenerator placement problem in optical networks. IEEE/ACM Trans. Netw. 19 (2) (2011)
Vittorio Bilò, Alessandro Celi, Michele Flammini, Vasco Gallotti
Social Context Congestion Games. SIROCCO (2011)
Vittorio Bilò, Angelo Fanelli, Michele Flammini, Luca Moscardelli
Graphical Congestion Games. Algorithmica 61 (2) (2011)
Vittorio Bilò, Angelo Fanelli, Michele Flammini, Luca Moscardelli
Performance of One-Round Walks in Linear Congestion Games. Theory Comput. Syst. 49 (1) (2011)
Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks
On the Complexity of the Regenerator Cost Problem in General Networks with Traffic Grooming. OPODIS (2011)
Gianni Amati, Alessandro Celi, Cesidio Di Nicola, Michele Flammini, Daniela Pavone
Improved Stable Retrieval in Noisy Collections. ICTIR (2011)
Vittorio Bilò, Michele Flammini, Gianpiero Monaco, Luca Moscardelli
On the performances of Nash equilibria in isolation games. J. Comb. Optim. 22 (3) (2011)
Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks
Optimizing regenerator cost in traffic grooming. Theor. Comput. Sci. 412 (52) (2011)
Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Hadas Shachnai, Mordechai Shalom, Tami Tamir, Shmuel Zaks
Minimizing total busy time in parallel scheduling with application to optical networks. Theor. Comput. Sci. 411 (40-42) (2010)
Angelo Fanelli, Michele Flammini, Luca Moscardelli
Stackelberg Strategies for Network Design Games. WINE (2010)
Vittorio Bilò, Angelo Fanelli, Michele Flammini, Luca Moscardelli
When ignorance helps: Graphical multicast cost sharing games. Theor. Comput. Sci. 411 (3) (2010)
Angelo Fanelli, Michele Flammini, Luca Moscardelli
On the Convergence of Multicast Games in Directed Networks. Algorithmica 57 (2) (2010)
Vittorio Bilò, Angelo Fanelli, Michele Flammini, Giovanna Melideo, Luca Moscardelli
Designing Fast Converging Cost Sharing Methods for Multicast Transmissions. Theory Comput. Syst. 47 (2) (2010)
Michele Flammini, Gaia Nicosia
-server problem. ACM Trans. Algorithms 7 (1) (2010)
Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks
Optimizing Regenerator Cost in Traffic Grooming - (Extended Abstract). OPODIS (2010)
Vittorio Bilò, Angelo Fanelli, Michele Flammini, Luca Moscardelli
Performances of One-Round Walks in Linear Congestion Games. SAGT (2009)
Michele Flammini, Mordechai Shalom, Shmuel Zaks
On minimizing the number of ADMs in a general topology optical network. Discret. Appl. Math. 157 (12) (2009)
Michele Flammini, Alfredo Navarra
Layouts for mobility management in wireless ATM networks. Discret. Appl. Math. 157 (1) (2009)
Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Hadas Shachnai, Mordechai Shalom, Tami Tamir, Shmuel Zaks
Minimizing total busy time in parallel scheduling with application to optical networks. IPDPS (2009)

Michele Flammini.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Michele Flammini