Angelo Fanelli

Publication Activity (10 Years)

Years Active: 2006-2022
Publications (10 Years): 21

Top Topics

Greedy Algorithm

Social Influences

Pure Nash Equilibria

Congestion Games

Top Venues

Theor. Comput. Sci.

Publications

Angelo Fanelli, Gianpiero Monaco, Luca Moscardelli
Relaxed Core Stability in Fractional Hedonic Games. ISAIM (2022)
Ioannis Caragiannis, Angelo Fanelli
On approximate pure Nash equilibria in weighted congestion games with polynomial latencies. J. Comput. Syst. Sci. 117 (2021)
Angelo Fanelli, Gianpiero Monaco, Luca Moscardelli
Relaxed Core Stability in Fractional Hedonic Games. IJCAI (2021)
Edith Elkind, Angelo Fanelli, Michele Flammini
Price of Pareto Optimality in hedonic games. Artif. Intell. 288 (2020)
Angelo Fanelli, Dimitris Fotakis
Local Aggregation in Preference Games. CoRR (2020)
Ioannis Caragiannis, Angelo Fanelli
On Approximate Pure Nash Equilibria in Weighted Congestion Games with Polynomial Latencies. ICALP (2019)
Ioannis Caragiannis, Angelo Fanelli
An Almost Ideal Coordination Mechanism for Unrelated Machine Scheduling. Theory Comput. Syst. 63 (1) (2019)
Ioannis Caragiannis, Angelo Fanelli
On approximate pure Nash equilibria in weighted congestion games with polynomial latencies. CoRR (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)
Vincenzo Auletta, Angelo Fanelli, Diodato Ferraioli
Consensus in Opinion Formation Processes in Fully Evolving Environments. AAAI (2019)
Vittorio Bilò, Angelo Fanelli, Luca Moscardelli
Opinion formation games with dynamic social influences. Theor. Comput. Sci. 746 (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ò, Angelo Fanelli, Luca Moscardelli
On lookahead equilibria in congestion games. Math. Struct. Comput. Sci. 27 (2) (2017)
Vittorio Bilò, Ioannis Caragiannis, Angelo Fanelli, Michele Flammini, Gianpiero Monaco
Simple Greedy Algorithms for Fundamental Multidimensional Graph Problems. ICALP (2017)
Ioannis Caragiannis, Angelo Fanelli, Nick Gravin
Short Sequences of Improvement Moves Lead to Approximate Equilibria in Constraint Satisfaction Games. Algorithmica 77 (4) (2017)
Ioannis Caragiannis, Angelo Fanelli
An almost ideal coordination mechanism for unrelated machine scheduling. CoRR (2016)
Edith Elkind, Angelo Fanelli, Michele Flammini
Price of Pareto Optimality in Hedonic Games. AAAI (2016)
Ioannis Caragiannis, Angelo Fanelli
An Almost Ideal Coordination Mechanism for Unrelated Machine Scheduling. SAGT (2016)
Vittorio Bilò, Angelo Fanelli, Luca Moscardelli
Opinion Formation Games with Dynamic Social Influences. WINE (2016)
Angelo Fanelli, Gianluigi Greco
Ride Sharing with a Vehicle of Unlimited Capacity. MFCS (2016)
Vittorio Bilò, Angelo Fanelli, Michele Flammini, Gianpiero Monaco, Luca Moscardelli
The price of envy-freeness in machine scheduling. Theor. Comput. Sci. 613 (2016)
John Augustine, Ning Chen, Edith Elkind, Angelo Fanelli, Nick Gravin, Dmitry Shiryaev
Dynamics of Profit-Sharing Games. Internet Math. 11 (1) (2015)
Vittorio Bilò, Angelo Fanelli, Michele Flammini, Gianpiero Monaco, Luca Moscardelli
On the Price of Stability of Fractional Hedonic Games. AAMAS (2015)
Angelo Fanelli, Dariusz Leniowski, Gianpiero Monaco, Piotr Sankowski
The ring design game with fair cost allocation. Theor. Comput. Sci. 562 (2015)
John Augustine, Ioannis Caragiannis, Angelo Fanelli, Christos Kalaitzis
Enforcing Efficient Equilibria in Network Design Games via Subsidies. Algorithmica 72 (1) (2015)
Angelo Fanelli, Gianluigi Greco
Ride Sharing with a Vehicle of Unlimited Capacity. CoRR (2015)
Ioannis Caragiannis, Angelo Fanelli, Nick Gravin, Alexander Skopalik
Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure. ACM Trans. Economics and Comput. 3 (1) (2015)
Vittorio Bilò, Angelo Fanelli, Michele Flammini, Gianpiero Monaco, Luca Moscardelli
The Price of Envy-Freeness in Machine Scheduling. MFCS (2) (2014)
Ioannis Caragiannis, Angelo Fanelli, Nick Gravin
Short sequences of improvement moves lead to approximate equilibria in constraint satisfaction games. CoRR (2014)
Ioannis Caragiannis, Angelo Fanelli, Nick Gravin
Short Sequences of Improvement Moves Lead to Approximate Equilibria in Constraint Satisfaction Games. SAGT (2014)
Vittorio Bilò, Angelo Fanelli, Michele Flammini, Gianpiero Monaco, Luca Moscardelli
Nash Stability in Fractional Hedonic Games. WINE (2014)
Angelo Fanelli, Michele Flammini, Luca Moscardelli
Stackelberg Strategies for Network Design Games. Internet Math. 9 (4) (2013)
Vittorio Bilò, Ioannis Caragiannis, Angelo Fanelli, Gianpiero Monaco
Improved Lower Bounds on the Price of Stability of Undirected Network Design Games. Theory Comput. Syst. 52 (4) (2013)
Vittorio Bilò, Angelo Fanelli, Luca Moscardelli
On Lookahead Equilibria in Congestion Games. WINE (2013)
Angelo Fanelli, Michele Flammini, Luca Moscardelli
The speed of convergence in congestion games under best-response dynamics. ACM Trans. Algorithms 8 (3) (2012)
Angelo Fanelli, Luca Moscardelli, Alexander Skopalik
On the Impact of Fair Best Response Dynamics. MFCS (2012)
Ioannis Caragiannis, Angelo Fanelli, Nick Gravin, Alexander Skopalik
Computing approximate pure Nash equilibria in congestion games. SIGecom Exch. 11 (1) (2012)
John Augustine, Ioannis Caragiannis, Angelo Fanelli, Christos Kalaitzis
Enforcing efficient equilibria in network design games via subsidies. SPAA (2012)
Ioannis Caragiannis, Angelo Fanelli, Nick Gravin, Alexander Skopalik
Approximate pure nash equilibria in weighted congestion games: existence, efficient computation, and structure. EC (2012)
Angelo Fanelli, Dariusz Leniowski, Gianpiero Monaco, Piotr Sankowski
The Ring Design Game with Fair Cost Allocation - [Extended Abstract]. WINE (2012)
Angelo Fanelli, Michele Flammini, Domenico Mango, Giovanna Melideo, Luca Moscardelli
Experimental Evaluations of Algorithms for IP Table Minimization. J. Interconnect. Networks 12 (4) (2011)
Ioannis Caragiannis, Angelo Fanelli, Nick Gravin, Alexander Skopalik
Computing approximate pure Nash equilibria in weighted congestion games with polynomial latency functions CoRR (2011)
Ioannis Caragiannis, Angelo Fanelli, Nick Gravin, Alexander Skopalik
Efficient computation of approximate pure Nash equilibria CoRR (2011)
Angelo Fanelli, Luca Moscardelli
On best response dynamics in weighted congestion games with polynomial delays. Distributed Comput. 24 (5) (2011)
John Augustine, Ning Chen, Edith Elkind, Angelo Fanelli, Nick Gravin, Dmitry Shiryaev
Dynamics of Profit-Sharing Games. IJCAI (2011)
John Augustine, Ioannis Caragiannis, Angelo Fanelli, Christos Kalaitzis
Enforcing efficient equilibria in network design games via subsidies CoRR (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)
Ioannis Caragiannis, Angelo Fanelli, Nick Gravin, Alexander Skopalik
Efficient Computation of Approximate Pure Nash Equilibria in Congestion Games. FOCS (2011)
Angelo Fanelli, Luca Moscardelli, Alexander Skopalik
On the Impact of Fair Best Response Dynamics CoRR (2011)
Angelo Fanelli, Michele Flammini, Luca Moscardelli
Stackelberg Strategies for Network Design Games. WINE (2010)
John Augustine, Ning Chen, Edith Elkind, Angelo Fanelli, Nick Gravin, Dmitry Shiryaev
Dynamics of Profit-Sharing Games CoRR (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)
Vittorio Bilò, Angelo Fanelli
Computing Exact and Approximate Nash Equilibria in 2-Player Games. AAIM (2010)
Vittorio Bilò, Ioannis Caragiannis, Angelo Fanelli, Gianpiero Monaco
Improved Lower Bounds on the Price of Stability of Undirected Network Design Games. SAGT (2010)
Angelo Fanelli, Luca Moscardelli
On Best Response Dynamics in Weighted Congestion Games with Polynomial Delays. WINE (2009)
Vittorio Bilò, Angelo Fanelli, Michele Flammini, Luca Moscardelli
Performances of One-Round Walks in Linear Congestion Games. SAGT (2009)
Vittorio Bilò, Angelo Fanelli, Michele Flammini, Luca Moscardelli
Graphical Congestion Games. WINE (2008)
Vittorio Bilò, Angelo Fanelli, Michele Flammini, Luca Moscardelli
Graphical congestion games with linear latencies. SPAA (2008)
Angelo Fanelli, Michele Flammini, Luca Moscardelli
The Speed of Convergence in Congestion Games under Best-Response Dynamics. ICALP (1) (2008)
Vittorio Bilò, Angelo Fanelli, Michele Flammini, Luca Moscardelli
When Ignorance Helps: Graphical Multicast Cost Sharing Games. MFCS (2008)
Angelo Fanelli, Michele Flammini, Domenico Mango, Giovanna Melideo, Luca Moscardelli
Experimental Evaluations of Algorithms for IP Table Minimization. WEA (2007)
Angelo Fanelli, Michele Flammini, Luca Moscardelli
On the convergence of multicast games in directed networks. SPAA (2007)
Angelo Fanelli, Michele Flammini, Giovanna Melideo, Luca Moscardelli
Multicast Transmissions in Non-cooperative Networks with a Limited Number of Selfish Moves. MFCS (2006)