Learning DNF Formulae Under Classes of Probability Distributions. - Michele Flammini; Alberto Marchetti-Spaccamela; Ludek Kucera (COLT, 1992)

Boolean Routing. - Michele Flammini; Giorgio Gambosi; Sandro Salomone (WDAG, 1993)

Interval Labeling Scheme for Chordal Rings. - Michele Flammini; Giorgio Gambosi; Sandro Salomone (SIROCCO, 1994)

On the Learnability of Monotone k mu-DNF Formulae Under Product Distributions. - Michele Flammini (Inf. Process. Lett., 1994)

Systolic Acyclic Orientations for Deadlock Prevention. - Miriam Di Ianni; Michele Flammini; Rossella Flammini; Sandro Salomone (SIROCCO, 1995)

Multi-Dimensional Interval Routing Schemes. - Michele Flammini; Giorgio Gambosi; Umberto Nanni; Richard B. Tan (WDAG, 1995)

On Devising Boolean Routing Schemes. - Michele Flammini; Giorgio Gambosi; Sandro Salomone (WG, 1995)

Interval Routing Schemes. - Michele Flammini; Giorgio Gambosi; Sandro Salomone (Algorithmica, 1996)

A Complete Characterization of the Path Layout Construction Problem for ATM Networks with Given Hop Count and Load (Extended Abstract). - Tamar Eilam; Michele Flammini; Shmuel Zaks (ICALP, 1997)

Acyclic Orientations for Deadlock Prevention in Interconnection Networks (Extended Abstract). - Jean-Claude Bermond; Miriam Di Ianni; Michele Flammini; Stephane Perennes (WG, 1997)

On the Hardness of Devising Interval Routing Schemes. - Michele Flammini (Parallel Process. Lett., 1997)

On Devising Boolean Routing Schemes. - Michele Flammini; Giorgio Gambosi (Theor. Comput. Sci., 1997)

The Complexity of Interval Routing on Random Graphs. - Michele Flammini; Jan van Leeuwen; Alberto Marchetti-Spaccamela (Comput. J., 1998)

A Complete Characterization of the Path Layout Construction Problem for ATM Networks with Given Hop Count and Load. - Tamar Eilam; Michele Flammini; Shmuel Zaks (Parallel Process. Lett., 1998)

Multidimensional Interval Routing Schemes. - Michele Flammini; Giorgio Gambosi; Umberto Nanni; Richard B. Tan (Theor. Comput. Sci., 1998)

Simple, Efficient Routing Schemes for All-Optical Networks. - Michele Flammini; Christian Scheideler (Theory Comput. Syst., 1999)

Deadlock-free interval routing schemes. - Michele Flammini (Networks, 1999)

On Multicriteria Online Problems. - Michele Flammini; Gaia Nicosia (ESA, 2000)

How to Survive While Visiting a Graph. - Claudio Arbib; Michele Flammini; Enrico Nardelli (Discret. Appl. Math., 2000)

Low-congested interval routing schemes for hypercubelike networks. - Serafino Cicerone; Gabriele Di Stefano; Michele Flammini (Networks, 2000)

ATM layouts with bounded hop count and congestion. - Michele Flammini; Enrico Nardelli; Guido Proietti (Distributed Comput., 2001)

Compact-Port Routing Models and Applications to Distance-Hereditary Graphs. - Serafino Cicerone; Gabriele Di Stefano; Michele Flammini (J. Parallel Distributed Comput., 2001)

Characterization results of all shortest paths interval routing schemes. - Michele Flammini; Giorgio Gambosi; Umberto Nanni; Richard B. Tan (Networks, 2001)

On the Optimality of General Lower Bounds for Broadcasting and Gossiping. - Michele Flammini; Stephane Perennes (SIAM J. Discret. Math., 2001)

Routing and Communication in Interconnection Networks. - Michele Flammini; Bruce M. Maggs; Jop F. Sibeyn; Berthold Vöcking (Euro-Par, 2002)

Allocation Problems in Scalable Distributed Data Structures. - Adriano Di Pasquale; Michele Flammini; Enrico Nardelli (WDAS, 2002)

On the upper chromatic number of (v3, b2)-configurations. - Claudio Arbib; Michele Flammini (Discret. Appl. Math., 2002)

Static and dynamic low-congested interval routing schemes. - Serafino Cicerone; Gabriele Di Stefano; Michele Flammini (Theor. Comput. Sci., 2002)

Dynamic Layouts for Wireless ATM. - Michele Flammini; Giorgio Gambosi; Alessandro Gasparini; Alfredo Navarra (Euro-Par, 2003)

Quality of Service in Wireless Networks. - Vittorio Bilò; Adriano Di Pasquale; Fabio Fioravanti; Michele Flammini; Luca Forlizzi; Francesco Lo Presti; Giovanna Melideo; Enrico Nardelli; Alfredo Navarra; Guido Proietti (IPDPS, 2003)

On Routing of Wavebands for Gossiping in All-Optical Paths and Cycles. - Michele Flammini; Alfredo Navarra; Andrzej Proskurowski (SIROCCO, 2003)

Minimum Flow Time Graph Ordering. - Claudio Arbib; Michele Flammini; Fabrizio Marinelli 001 (WG, 2003)

Deadlock Prevention by Acyclic Orientations. - Jean-Claude Bermond; Miriam Di Ianni; Michele Flammini; Stephane Perennes (Discret. Appl. Math., 2003)

On the IP Routing Tables Minimization with Addresses Reassignment. - Vittorio Bilò; Michele Flammini (IPDPS, 2004)

Sharing the cost of multicast transmissions in wireless networks. - Vittorio Bilò; Chiara Di Francescomarino; Michele Flammini; Giovanna Melideo (SPAA, 2004)

Experimental analysis of online algorithms for the bicriteria scheduling problem. - Vittorio Bilò; Michele Flammini; Roberto Giovannelli (J. Parallel Distributed Comput., 2004)

Lower Bounds on the Broadcasting and Gossiping Time of Restricted Protocols. - Michele Flammini; Stéphane Pérennes (SIAM J. Discret. Math., 2004)

Lower bounds on systolic gossip. - Michele Flammini; Stéphane Pérennes (Inf. Comput., 2005)

Wireless ATM Layouts for Chain Networks. - Michele Flammini; Giorgio Gambosi; Alfredo Navarra (Mob. Networks Appl., 2005)

On routing of wavebands for all-to-all communications in all-optical paths and cycles. - Michele Flammini; Alfredo Navarra; Andrzej Proskurowski (Theor. Comput. Sci., 2005)

Synthesis of Concurrent and Distributed Adaptors for Component-Based Systems. - Marco Autili; Michele Flammini; Paola Inverardi; Alfredo Navarra; Massimo Tivoli (EWSA, 2006)

Multicast Transmissions in Non-cooperative Networks with a Limited Number of Selfish Moves. - Angelo Fanelli 001; Michele Flammini; Giovanna Melideo; Luca Moscardelli (MFCS, 2006)

Competitive algorithms for the bicriteria k-server problem. - Michele Flammini; Gaia Nicosia (Discret. Appl. Math., 2006)

Efficient offline algorithms for the bicriteria k-server problem and online applications. - Michele Flammini; Alfredo Navarra; Gaia Nicosia (J. Discrete Algorithms, 2006)

The "real" approximation factor of the MST heuristic for the minimum energy broadcasting. - Michele Flammini; Alfredo Navarra; Stephane Perennes (ACM J. Exp. Algorithmics, 2006)

Pareto approximations for the bicriteria scheduling problem. - Vittorio Bilò; Michele Flammini; Luca Moscardelli (J. Parallel Distributed Comput., 2006)

Sharing the cost of multicast transmissions in wireless networks. - Vittorio Bilò; Michele Flammini; Giovanna Melideo; Luca Moscardelli; Alfredo Navarra (Theor. Comput. Sci., 2006)

Selfishness, Collusion and Power of Local Search for the ADMs Minimization Problem. - Stefania Di Giannantonio; Michele Flammini; Gianpiero Monaco; Luca Moscardelli; Mordechai Shalom; Shmuel Zaks (WINE, 2007)

Improved Approximation Results for the Minimum Energy Broadcasting Problem. - Michele Flammini; Ralf Klasing; Alfredo Navarra; Stephane Perennes (Algorithmica, 2007)

On minimizing the number of ADMs - Tight bounds for an algorithm without preprocessing. - Michele Flammini; Mordechai Shalom; Shmuel Zaks (J. Parallel Distributed Comput., 2007)

Approximating the Traffic Grooming Problem with Respect to ADMs and OADMs. - Michele Flammini; Gianpiero Monaco; Luca Moscardelli; Mordechai Shalom; Shmuel Zaks (Euro-Par, 2008)

Graphical congestion games with linear latencies. - Vittorio Bilò; Angelo Fanelli 001; Michele Flammini; Luca Moscardelli (SPAA, 2008)

Selfishness, collusion and power of local search for the ADMs minimization problem. - Michele Flammini; Gianpiero Monaco; Luca Moscardelli; Mordechai Shalom; Shmuel Zaks (Comput. Networks, 2008)

Approximating the traffic grooming problem. - Michele Flammini; Luca Moscardelli; Mordechai Shalom; Shmuel Zaks (J. Discrete Algorithms, 2008)

Approximating the traffic grooming problem in tree and star networks. - Michele Flammini; Gianpiero Monaco; Luca Moscardelli; Mordechai Shalom; Shmuel Zaks (J. Parallel Distributed Comput., 2008)

Asymptotically Optimal Solutions for Small World Graphs. - Michele Flammini; Luca Moscardelli; Alfredo Navarra; Stéphane Pérennes (Theory Comput. Syst., 2008)

On Nash equilibria for multicast transmissions in ad-hoc wireless networks. - Vittorio Bilò; Michele Flammini; Giovanna Melideo; Luca Moscardelli (Wirel. Networks, 2008)

Tightening the upper bound for the minimum energy broadcasting. - Michele Flammini; Ralf Klasing; Alfredo Navarra; Stephane Perennes (Wirel. Networks, 2008)

Performances of One-Round Walks in Linear Congestion Games. - Vittorio Bilò; Angelo Fanelli 001; Michele Flammini; Luca Moscardelli (SAGT, 2009)

Layouts for mobility management in wireless ATM networks. - Michele Flammini; Alfredo Navarra (Discret. Appl. Math., 2009)

On minimizing the number of ADMs in a general topology optical network. - Michele Flammini; Mordechai Shalom; Shmuel Zaks (Discret. Appl. Math., 2009)

Game-Theoretic Approaches to Optimization Problems in Communication Networks. - Vittorio Bilò; Ioannis Caragiannis; Angelo Fanelli 001; Michele Flammini; Christos Kaklamanis; Gianpiero Monaco; Luca Moscardelli (Graphs and Algorithms in Communication Networks, 2010)

Traffic Grooming: Combinatorial Results and Practical Resolutions. - Tibor Cinkler; David Coudert; Michele Flammini; Gianpiero Monaco; Luca Moscardelli; Xavier Muñoz; Ignasi Sau; Mordechai Shalom; Shmuel Zaks (Graphs and Algorithms in Communication Networks, 2010)

Energy Consumption Minimization in Ad Hoc Wireless and Multi-interface Networks. - Alfredo Navarra; Ioannis Caragiannis; Michele Flammini; Christos Kaklamanis; Ralf Klasing (Graphs and Algorithms in Communication Networks, 2010)

Optimizing Regenerator Cost in Traffic Grooming - (Extended Abstract). - Michele Flammini; Gianpiero Monaco; Luca Moscardelli; Mordechai Shalom; Shmuel Zaks (OPODIS, 2010)

On the Convergence of Multicast Games in Directed Networks. - Angelo Fanelli 001; Michele Flammini; Luca Moscardelli (Algorithmica, 2010)

Designing Fast Converging Cost Sharing Methods for Multicast Transmissions. - Vittorio Bilò; Angelo Fanelli 001; Michele Flammini; Giovanna Melideo; Luca Moscardelli (Theory Comput. Syst., 2010)

On the bicriteria k-server problem. - Michele Flammini; Gaia Nicosia (ACM Trans. Algorithms, 2010)

When ignorance helps: Graphical multicast cost sharing games. - Vittorio Bilò; Angelo Fanelli 001; Michele Flammini; Luca Moscardelli (Theor. Comput. Sci., 2010)

Minimizing total busy time in parallel scheduling with application to optical networks. - Michele Flammini; Gianpiero Monaco; Luca Moscardelli; Hadas Shachnai; Mordechai Shalom; Tami Tamir; Shmuel Zaks (Theor. Comput. Sci., 2010)

Improved Stable Retrieval in Noisy Collections. - Gianni Amati; Alessandro Celi; Cesidio Di Nicola; Michele Flammini; Daniela Pavone (ICTIR, 2011)

FUB, IASI-CNR, UNIVAQ at TREC 2011 Microblog Track. - Gianni Amati; Giuseppe Amodeo; Marco Bianchi 001; Giuseppe Marcone; Fondazione Ugo Bordoni; Carlo Gaibisso; Giorgio Gambosi; Alessandro Celi; Cesidio Di Nicola; Michele Flammini (TREC, 2011)

Graphical Congestion Games. - Vittorio Bilò; Angelo Fanelli 001; Michele Flammini; Luca Moscardelli (Algorithmica, 2011)

Tight Bounds for Selfish and Greedy Load Balancing. - Ioannis Caragiannis; Michele Flammini; Christos Kaklamanis; Panagiotis Kanellopoulos; Luca Moscardelli (Algorithmica, 2011)

On the performances of Nash equilibria in isolation games. - Vittorio Bilò; Michele Flammini; Gianpiero Monaco; Luca Moscardelli (J. Comb. Optim., 2011)

Experimental Evaluations of Algorithms for IP Table Minimization. - Angelo Fanelli 001; Michele Flammini; Domenico Mango; Giovanna Melideo; Luca Moscardelli (J. Interconnect. Networks, 2011)

Performance of One-Round Walks in Linear Congestion Games. - Vittorio Bilò; Angelo Fanelli 001; Michele Flammini; Luca Moscardelli (Theory Comput. Syst., 2011)

Extending the notion of rationality of selfish agents: Second Order Nash equilibria. - Vittorio Bilò; Michele Flammini (Theor. Comput. Sci., 2011)

Optimizing regenerator cost in traffic grooming. - Michele Flammini; Gianpiero Monaco; Luca Moscardelli; Mordechai Shalom; Shmuel Zaks (Theor. Comput. Sci., 2011)

On the complexity of the regenerator placement problem in optical networks. - Michele Flammini; Alberto Marchetti-Spaccamela; Gianpiero Monaco; Luca Moscardelli; Shmuel Zaks (IEEE/ACM Trans. Netw., 2011)

On Bidimensional Congestion Games. - Vittorio Bilò; Michele Flammini; Vasco Gallotti (SIROCCO, 2012)

Mobile Network Creation Games. - Michele Flammini; Vasco Gallotti; Giovanna Melideo; Gianpiero Monaco; Luca Moscardelli (SIROCCO, 2012)

The speed of convergence in congestion games under best-response dynamics. - Angelo Fanelli 001; Michele Flammini; Luca Moscardelli (ACM Trans. Algorithms, 2012)

Stackelberg Strategies for Network Design Games. - Angelo Fanelli 001; Michele Flammini; Luca Moscardelli (Internet Math., 2013)

The price of stability of fair undirected broadcast games is constant. - Vittorio Bilò; Michele Flammini; Luca Moscardelli (SIGecom Exch., 2013)

Social context congestion games. - Vittorio Bilò; Alessandro Celi; Michele Flammini; Vasco Gallotti (Theor. Comput. Sci., 2013)

An Exponential Improvement on the MST Heuristic for Minimum Energy Broadcasting in Ad Hoc Wireless Networks. - Ioannis Caragiannis; Michele Flammini; Luca Moscardelli (IEEE/ACM Trans. Netw., 2013)

Nash Stability in Fractional Hedonic Games. - Vittorio Bilò; Angelo Fanelli 001; Michele Flammini; Gianpiero Monaco; Luca Moscardelli (WINE, 2014)

On the Complexity of the Regenerator Cost Problem in General Networks with Traffic Grooming. - Michele Flammini; Gianpiero Monaco; Luca Moscardelli; Mordechai Shalom; Shmuel Zaks (Algorithmica, 2014)

On the Price of Stability of Fractional Hedonic Games. - Vittorio Bilò; Angelo Fanelli 001; Michele Flammini; Gianpiero Monaco; Luca Moscardelli (AAMAS, 2015)

On the sequential price of anarchy of isolation games. - Anna Angelucci; Vittorio Bilò; Michele Flammini; Luca Moscardelli (J. Comb. Optim., 2015)

Some Anomalies of Farsighted Strategic Behavior. - Vittorio Bilò; Michele Flammini; Gianpiero Monaco; Luca Moscardelli (Theory Comput. Syst., 2015)

Report on 1st GSSI Summer Meeting on Algorithms. - Michele Flammini; Giuseppe Persiano (Bull. EATCS, 2016)

The price of envy-freeness in machine scheduling. - Vittorio Bilò; Angelo Fanelli 001; Michele Flammini; Gianpiero Monaco; Luca Moscardelli (Theor. Comput. Sci., 2016)

Nash Stability in Social Distance Games. - Alkida Balliu; Michele Flammini; Giovanna Melideo; Dennis Olivetti (AAAI, 2017)

On Pareto Optimality in Social Distance Games. - Alkida Balliu; Michele Flammini; Dennis Olivetti (AAAI, 2017)

Computing Approximate Pure Nash Equilibria in Digraph k-Coloring Games. - Raffaello Carosi; Michele Flammini; Gianpiero Monaco (AAMAS, 2017)

Simple Greedy Algorithms for Fundamental Multidimensional Graph Problems. - Vittorio Bilò; Ioannis Caragiannis; Angelo Fanelli 001; Michele Flammini; Gianpiero Monaco (ICALP, 2017)

Strategyproof Mechanisms for Additively Separable Hedonic Games and Fractional Hedonic Games. - Michele Flammini; Gianpiero Monaco; Qiang Zhang (WAOA, 2017)

Approximating the revenue maximization problem with sharp demands. - Vittorio Bilò; Michele Flammini; Gianpiero Monaco (Theor. Comput. Sci., 2017)

Network Movement Games. - Michele Flammini; Vasco Gallotti; Giovanna Melideo; Gianpiero Monaco; Luca Moscardelli (Theor. Comput. Sci., 2017)

On the Impact of Buyers Preselection in Pricing Problems. - Vittorio Bilò; Michele Flammini; Gianpiero Monaco; Luca Moscardelli (AAMAS, 2018)

Online Coalition Structure Generation in Graph Games. - Michele Flammini; Gianpiero Monaco; Luca Moscardelli; Mordechai Shalom; Shmuel Zaks (AAMAS, 2018)

Nash Stable Outcomes in Fractional Hedonic Games: Existence, Efficiency and Computation. - Vittorio Bilò; Angelo Fanelli 001; Michele Flammini; Gianpiero Monaco; Luca Moscardelli (J. Artif. Intell. Res., 2018)

Building International Doctoral Schools in Computer Science in Italy, De Nicola's Way. - Luca Aceto; Gianlorenzo D'Angelo; Michele Flammini; Omar Inverso; Ludovico Iovino; Catia Trubiani (Models, Languages, and Tools for Concurrent and Distributed Programming, 2019)

Optimality and Nash Stability in Additive Separable Generalized Group Activity Selection Problems. - Vittorio Bilò; Angelo Fanelli 001; Michele Flammini; Gianpiero Monaco; Luca Moscardelli (IJCAI, 2019)

On social envy-freeness in multi-unit markets. - Michele Flammini; Manuel Mauro; Matteo Tonelli (Artif. Intell., 2019)

On Non-Cooperativeness in Social Distance Games. - Alkida Balliu; Michele Flammini; Giovanna Melideo; Dennis Olivetti (J. Artif. Intell. Res., 2019)

Guest Editorial: Special Issue on Algorithmic Game Theory. - Vittorio Bilò; Michele Flammini (Theory Comput. Syst., 2019)

The Impact of Selfishness in Hypergraph Hedonic Games. - Alessandro Aloisio; Michele Flammini; Cosimo Vinci (AAAI, 2020)

The Quality of Content Publishing in the Digital Era. - Vittorio Bilò; Michele Flammini; Cosimo Vinci (ECAI, 2020)

Parameterized Complexity of Manipulating Sequential Allocation. - Michele Flammini; Hugo Gilbert (ECAI, 2020)

Inequity Aversion Pricing in Multi-Unit Markets. - Michele Flammini; Manuel Mauro; Matteo Tonelli; Cosimo Vinci (ECAI, 2020)

Price of Pareto Optimality in hedonic games. - Edith Elkind; Angelo Fanelli 001; Michele Flammini (Artif. Intell., 2020)

On Multidimensional Congestion Games. - Vittorio Bilò; Michele Flammini; Vasco Gallotti; Cosimo Vinci (Algorithms, 2020)

The price of stability for undirected broadcast network design with fair cost allocation is constant. - Vittorio Bilò; Michele Flammini; Luca Moscardelli (Games Econ. Behav., 2020)

Distance Polymatrix Coordination Games. - Alessandro Aloisio; Michele Flammini; Bojana Kodric; Cosimo Vinci (IJCAI, 2021)

Distance Hedonic Games. - Michele Flammini; Bojana Kodric; Martin Olsen; Giovanna Varricchio (SOFSEM, 2021)

On fair price discrimination in multi-unit markets. - Michele Flammini; Manuel Mauro; Matteo Tonelli (Artif. Intell., 2021)

On Nash Equilibria in Non-Cooperative All-Optical Networks. - Vittorio Bilò; Michele Flammini; Luca Moscardelli (Algorithms, 2021)

The Traffic Grooming Problem in Optical Networks with Respect to ADMs and OADMs: Complexity and Approximation. - Michele Flammini; Gianpiero Monaco; Luca Moscardelli; Mordechai Shalom; Shmuel Zaks (Algorithms, 2021)

Computing approximate Nash equilibria in network congestion games with polynomially decreasing cost functions. - Vittorio Bilò; Michele Flammini; Gianpiero Monaco; Luca Moscardelli (Distributed Comput., 2021)

Strategyproof Mechanisms for Additively Separable and Fractional Hedonic Games. - Michele Flammini; Bojana Kodric; Gianpiero Monaco; Qiang Zhang (J. Artif. Intell. Res., 2021)

On the Online Coalition Structure Generation Problem. - Michele Flammini; Gianpiero Monaco; Luca Moscardelli; Mordechai Shalom; Shmuel Zaks (J. Artif. Intell. Res., 2021)

Unavailable Transit Feed Specification: Making It Available With Recurrent Neural Networks. - Ludovico Iovino; Phuong Thanh Nguyen 001; Amleto Di Salle; Francesco Gallo; Michele Flammini (IEEE Trans. Intell. Transp. Syst., 2021)

Approximate Strategyproof Mechanisms for the Additively Separable Group Activity Selection Problem. - Michele Flammini; Giovanna Varricchio (IJCAI, 2022)

Digraph k-Coloring Games: From Theory to Practice. - Andrea D'Ascenzo; Mattia D'Emidio; Michele Flammini; Gianpiero Monaco (SEA, 2022)

On Pareto optimality in social distance games. - Alkida Balliu; Michele Flammini; Giovanna Melideo; Dennis Olivetti (Artif. Intell., 2022)

Strategyproof mechanisms for Friends and Enemies Games. - Michele Flammini; Bojana Kodric; Giovanna Varricchio (Artif. Intell., 2022)

Almost envy-free allocations with connected bundles. - Vittorio Bilò; Ioannis Caragiannis; Michele Flammini; Ayumi Igarashi 001; Gianpiero Monaco; Dominik Peters; Cosimo Vinci; William S. Zwicker (Games Econ. Behav., 2022)

Pricing Problems with Buyer Preselection. - Vittorio Bilò; Michele Flammini; Gianpiero Monaco; Luca Moscardelli (J. Artif. Intell. Res., 2022)

PAC Learning and Stabilizing Hedonic Games: Towards a Unifying Approach. - Simone Fioravanti; Michele Flammini; Bojana Kodric; Giovanna Varricchio (AAAI, 2023)

Distance Polymatrix Coordination Games (short paper). - Alessandro Aloisio; Michele Flammini; Bojana Kodric; Cosimo Vinci (IPS-RCRA-SPIRIT@AI*IA, 2023)

ε-fractional core stability in Hedonic Games. - Simone Fioravanti; Michele Flammini; Bojana Kodric; Giovanna Varricchio (NeurIPS, 2023)

Automatic detection of Covid-19 from chest X-ray and lung computed tomography images using deep neural networks and transfer learning. - Linh T. Duong; Phuong T. Nguyen 001; Ludovico Iovino; Michele Flammini (Appl. Soft Comput., 2023)

Approximately Fair Allocation of Indivisible Items with Random Valuations. - Alessandro Aloisio; Vittorio Bilò; Antonio Mario Caruso; Michele Flammini; Cosimo Vinci (AAMAS, 2024)

On Green Sustainability of Resource Selection Games with Equitable Cost-Sharing. - Vittorio Bilò; Michele Flammini; Gianpiero Monaco; Luca Moscardelli; Cosimo Vinci (AAMAS, 2024)

Generalized Distance Polymatrix Games (short paper). - Alessandro Aloisio; Michele Flammini; Cosimo Vinci (ICTCS, 2024)

Generalized Distance Polymatrix Games. - Alessandro Aloisio; Michele Flammini; Cosimo Vinci (SOFSEM, 2024)

Digraph k-Coloring Games: New Algorithms and Experiments. - Andrea D'Ascenzo; Mattia D'Emidio; Michele Flammini; Gianpiero Monaco (J. Artif. Intell. Res., 2024)

Fair Division with Social Impact. - Michele Flammini; Gianluigi Greco; Giovanna Varricchio (AAAI, 2025)

Non-obvious Manipulability in Hedonic Games with Friends Appreciation Preferences. - Michele Flammini; Maria Fomenko; Giovanna Varricchio (AAMAS, 2025)

Experimenting active and sequential learning in a medieval music manuscript. - Sachin Sharma; Federico Simonetta; Michele Flammini (CoRR, 2025)