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

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

Performances of One-Round Walks in Linear Congestion Games. - Vittorio Bilò; Angelo Fanelli 001; Michele Flammini; Luca Moscardelli (SAGT, 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)

Computing Exact and Approximate Nash Equilibria in 2-Player Games. - Vittorio Bilò; Angelo Fanelli 001 (AAIM, 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)

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

Efficient Computation of Approximate Pure Nash Equilibria in Congestion Games. - Ioannis Caragiannis; Angelo Fanelli 001; Nick Gravin; Alexander Skopalik (FOCS, 2011)

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

Efficient computation of approximate pure Nash equilibria - Ioannis Caragiannis; Angelo Fanelli 001; Nick Gravin; Alexander Skopalik (CoRR, 2011)

Computing approximate pure Nash equilibria in weighted congestion games with polynomial latency functions - Ioannis Caragiannis; Angelo Fanelli 001; Nick Gravin; Alexander Skopalik (CoRR, 2011)

On best response dynamics in weighted congestion games with polynomial delays. - Angelo Fanelli 001; Luca Moscardelli (Distributed Comput., 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)

On the Impact of Fair Best Response Dynamics. - Angelo Fanelli 001; Luca Moscardelli; Alexander Skopalik (MFCS, 2012)

The Ring Design Game with Fair Cost Allocation - [Extended Abstract]. - Angelo Fanelli 001; Dariusz Leniowski; Gianpiero Monaco; Piotr Sankowski (WINE, 2012)

Computing approximate pure Nash equilibria in congestion games. - Ioannis Caragiannis; Angelo Fanelli 001; Nick Gravin; Alexander Skopalik (SIGecom Exch., 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)

Improved Lower Bounds on the Price of Stability of Undirected Network Design Games. - Vittorio Bilò; Ioannis Caragiannis; Angelo Fanelli 001; Gianpiero Monaco (Theory Comput. Syst., 2013)

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

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

Enforcing Efficient Equilibria in Network Design Games via Subsidies. - John Augustine; Ioannis Caragiannis; Angelo Fanelli 001; Christos Kalaitzis (Algorithmica, 2015)

Dynamics of Profit-Sharing Games. - John Augustine; Ning Chen 005; Edith Elkind; Angelo Fanelli 001; Nick Gravin; Dmitry Shiryaev (Internet Math., 2015)

The ring design game with fair cost allocation. - Angelo Fanelli 001; Dariusz Leniowski; Gianpiero Monaco; Piotr Sankowski (Theor. Comput. Sci., 2015)

Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure. - Ioannis Caragiannis; Angelo Fanelli 001; Nick Gravin; Alexander Skopalik (ACM Trans. Economics and Comput., 2015)

Ride Sharing with a Vehicle of Unlimited Capacity. - Angelo Fanelli 001; Gianluigi Greco (MFCS, 2016)

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

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

Short Sequences of Improvement Moves Lead to Approximate Equilibria in Constraint Satisfaction Games. - Ioannis Caragiannis; Angelo Fanelli 001; Nick Gravin (Algorithmica, 2017)

On lookahead equilibria in congestion games. - Vittorio Bilò; Angelo Fanelli 001; Luca Moscardelli (Math. Struct. Comput. Sci., 2017)

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)

Opinion formation games with dynamic social influences. - Vittorio Bilò; Angelo Fanelli 001; Luca Moscardelli (Theor. Comput. Sci., 2018)

Consensus in Opinion Formation Processes in Fully Evolving Environments. - Vincenzo Auletta; Angelo Fanelli 001; Diodato Ferraioli (AAAI, 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)

An Almost Ideal Coordination Mechanism for Unrelated Machine Scheduling. - Ioannis Caragiannis; Angelo Fanelli 001 (Theory Comput. Syst., 2019)

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

Local Aggregation in Preference Games. - Angelo Fanelli 001; Dimitris Fotakis 001 (CoRR, 2020)

Relaxed Core Stability in Fractional Hedonic Games. - Angelo Fanelli 001; Gianpiero Monaco; Luca Moscardelli (IJCAI, 2021)

On approximate pure Nash equilibria in weighted congestion games with polynomial latencies. - Ioannis Caragiannis; Angelo Fanelli 001 (J. Comput. Syst. Sci., 2021)

Individually Stable Dynamics in Coalition Formation over Graphs. - Angelo Fanelli 001; Laurent Gourvès; Ayumi Igarashi 001; Luca Moscardelli (AAAI, 2025)

Minimizing Rosenthal's Potential in Monotone Congestion Games. - Vittorio Bilò; Angelo Fanelli 001; Laurent Gourvès; Christos Tsoufis; Cosimo Vinci (AAMAS, 2025)

Relaxed core stability in hedonic games. - Angelo Fanelli 001; Gianpiero Monaco; Luca Moscardelli (Artif. Intell., 2025)