Luca Moscardelli

ORCID

Publication Activity (10 Years)

Years Active: 2004-2024
Publications (10 Years): 35

Top Venues

AAMAS

WINE

CoRR

J. Artif. Intell. Res.

Publications

Vittorio Bilò, Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Cosimo Vinci
On Green Sustainability of Resource Selection Games with Equitable Cost-Sharing. AAMAS (2024)
Vittorio Bilò, Luca Moscardelli, Cosimo Vinci
Uniform Mixed Equilibria in Network Congestion Games with Link Failures. Math. Oper. Res. 49 (1) (2024)
Gianpiero Monaco, Luca Moscardelli
Nash Stability in Fractional Hedonic Games with Bounded Size Coalitions. WINE (2023)
Vittorio Bilò, Gianpiero Monaco, Luca Moscardelli, Cosimo Vinci
Nash Social Welfare in Selfish and Online Load Balancing. ICTCS (2022)
Vittorio Bilò, Michele Flammini, Gianpiero Monaco, Luca Moscardelli
Pricing Problems with Buyer Preselection. J. Artif. Intell. Res. 74 (2022)
Cosimo Vinci, Vittorio Bilò, Gianpiero Monaco, Luca Moscardelli
Nash Social Welfare in Selfish and Online Load Balancing. ACM Trans. Economics and Comput. 10 (2) (2022)
Angelo Fanelli, Gianpiero Monaco, Luca Moscardelli
Relaxed Core Stability in Fractional Hedonic Games. ISAIM (2022)
Maurizio Parton, Marco Angelone, Carlo Metta, Stefania D'Ovidio, Roberta Massarelli, Luca Moscardelli, Gianluca Amato
Artificial intelligence and renegotiation of commercial lease contracts affected by pandemic-related contingencies from Covid-19. The project A.I.A.Co. CoRR (2022)
Vittorio Bilò, Gianpiero Monaco, Luca Moscardelli
Hedonic Games with Fixed-Size Coalitions. AAAI (2022)
Gianpiero Monaco, Luca Moscardelli, Yllka Velaj
Additively Separable Hedonic Games with Social Context. Games 12 (3) (2021)
Angelo Fanelli, Gianpiero Monaco, Luca Moscardelli
Relaxed Core Stability in Fractional Hedonic Games. IJCAI (2021)
Vittorio Bilò, Michele Flammini, Luca Moscardelli
On Nash Equilibria in Non-Cooperative All-Optical Networks. Algorithms 14 (1) (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, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks
On the Online Coalition Structure Generation Problem. J. Artif. Intell. Res. 72 (2021)
Gianpiero Monaco, Luca Moscardelli, Yllka Velaj
Stable outcomes in modified fractional hedonic games. Auton. Agents Multi Agent Syst. 34 (1) (2020)
Vittorio Bilò, Gianpiero Monaco, Luca Moscardelli, Cosimo Vinci
Nash Social Welfare in Selfish and Online Load Balancing. CoRR (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)
Vittorio Bilò, Gianpiero Monaco, Luca Moscardelli, Cosimo Vinci
Nash Social Welfare in Selfish and Online Load Balancing. WINE (2020)
Vittorio Bilò, Angelo Fanelli, Michele Flammini, Gianpiero Monaco, Luca Moscardelli
Optimality and Nash Stability in Additive Separable Generalized Group Activity Selection Problems. IJCAI (2019)
Raffaello Carosi, Gianpiero Monaco, Luca Moscardelli
Local Core Stability in Simple Symmetric Fractional Hedonic Games. AAMAS (2019)
Gianpiero Monaco, Luca Moscardelli, Yllka Velaj
On the Performance of Stable Outcomes in Modified Fractional Hedonic Games with Egalitarian Social Welfare. AAMAS (2019)
Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks
Online Coalition Structure Generation in Graph Games. AAMAS (2018)
Vittorio Bilò, Angelo Fanelli, Luca Moscardelli
Opinion formation games with dynamic social influences. Theor. Comput. Sci. 746 (2018)
Gianpiero Monaco, Luca Moscardelli, Yllka Velaj
Stable Outcomes in Modified Fractional Hedonic Games. CoRR (2018)
Vittorio Bilò, Luca Moscardelli, Cosimo Vinci
Uniform Mixed Equilibria in Network Congestion Games with Link Failures. ICALP (2018)
Gianpiero Monaco, Luca Moscardelli, Yllka Velaj
Stable Outcomes in Modified Fractional Hedonic 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)
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)
Gianpiero Monaco, Luca Moscardelli, Yllka Velaj
Hedonic Games with Social Context. ICTCS (2018)
Michele Flammini, Vasco Gallotti, Giovanna Melideo, Gianpiero Monaco, Luca Moscardelli
Network Movement Games. Theor. Comput. Sci. 667 (2017)
Vittorio Bilò, Angelo Fanelli, Luca Moscardelli
On lookahead equilibria in congestion games. Math. Struct. Comput. Sci. 27 (2) (2017)
Vittorio Bilò, Angelo Fanelli, Luca Moscardelli
Opinion Formation Games with Dynamic Social Influences. WINE (2016)
Vittorio Bilò, Angelo Fanelli, Michele Flammini, Gianpiero Monaco, Luca Moscardelli
The price of envy-freeness in machine scheduling. Theor. Comput. Sci. 613 (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ò, 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)
Vittorio Bilò, Angelo Fanelli, Luca Moscardelli
On Lookahead Equilibria in Congestion Games. WINE (2013)
Anna Angelucci, Vittorio Bilò, Michele Flammini, Luca Moscardelli
On the Sequential Price of Anarchy of Isolation Games. COCOON (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)
Luca Moscardelli
Convergence Issues in Congestion Games. Bull. EATCS 111 (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)
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)
Ioannis Caragiannis, Michele Flammini, Christos Kaklamanis, Panagiotis Kanellopoulos, Luca Moscardelli
Tight Bounds for Selfish and Greedy Load Balancing. Algorithmica 61 (3) (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)
Angelo Fanelli, Luca Moscardelli
On best response dynamics in weighted congestion games with polynomial delays. Distributed Comput. 24 (5) (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)
Vittorio Bilò, Michele Flammini, Gianpiero Monaco, Luca Moscardelli
On the performances of Nash equilibria in isolation games. J. Comb. Optim. 22 (3) (2011)
Angelo Fanelli, Luca Moscardelli, Alexander Skopalik
On the Impact of Fair Best Response Dynamics CoRR (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, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks
Optimizing Regenerator Cost in Traffic Grooming - (Extended Abstract). OPODIS (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)
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)
Vittorio Bilò, Michele Flammini, Gianpiero Monaco, Luca Moscardelli
On the Performances of Nash Equilibria in Isolation Games. COCOON (2009)
Michele Flammini, Alberto Marchetti-Spaccamela, Gianpiero Monaco, Luca Moscardelli, Shmuel Zaks
On the complexity of the regenerator placement problem in optical networks. SPAA (2009)
Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks
Approximating the traffic grooming problem in tree and star networks. J. Parallel Distributed Comput. 68 (7) (2008)
Vittorio Bilò, Angelo Fanelli, Michele Flammini, Luca Moscardelli
Graphical Congestion Games. WINE (2008)
Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks
Approximating the Traffic Grooming Problem with Respect to ADMs and OADMs. Euro-Par (2008)
Vittorio Bilò, Michele Flammini, Giovanna Melideo, Luca Moscardelli
On Nash equilibria for multicast transmissions in ad-hoc wireless networks. Wirel. Networks 14 (2) (2008)
Vittorio Bilò, Angelo Fanelli, Michele Flammini, Luca Moscardelli
Graphical congestion games with linear latencies. SPAA (2008)
Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks
Selfishness, collusion and power of local search for the ADMs minimization problem. Comput. Networks 52 (9) (2008)
Vincenzo Auletta, Luca Moscardelli, Paolo Penna, Giuseppe Persiano
Interference Games in Wireless Networks. WINE (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)
Michele Flammini, Luca Moscardelli, Alfredo Navarra, Stéphane Pérennes
Asymptotically Optimal Solutions for Small World Graphs. Theory Comput. Syst. 42 (4) (2008)
Michele Flammini, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks
Approximating the traffic grooming problem. J. Discrete Algorithms 6 (3) (2008)
Ioannis Caragiannis, Michele Flammini, Luca Moscardelli
An Exponential Improvement on the MST Heuristic for Minimum Energy Broadcasting in Ad Hoc Wireless Networks. ICALP (2007)
Angelo Fanelli, Michele Flammini, Domenico Mango, Giovanna Melideo, Luca Moscardelli
Experimental Evaluations of Algorithms for IP Table Minimization. WEA (2007)
Stefania Di Giannantonio, Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks
Selfishness, Collusion and Power of Local Search for the ADMs Minimization Problem. WINE (2007)
Angelo Fanelli, Michele Flammini, Luca Moscardelli
On the convergence of multicast games in directed networks. SPAA (2007)
Ioannis Caragiannis, Michele Flammini, Christos Kaklamanis, Panagiotis Kanellopoulos, Luca Moscardelli
Tight Bounds for Selfish and Greedy Load Balancing. ICALP (1) (2006)
Vittorio Bilò, Michele Flammini, Giovanna Melideo, Luca Moscardelli, Alfredo Navarra
Sharing the cost of multicast transmissions in wireless networks. Theor. Comput. Sci. 369 (1-3) (2006)
Angelo Fanelli, Michele Flammini, Giovanna Melideo, Luca Moscardelli
Multicast Transmissions in Non-cooperative Networks with a Limited Number of Selfish Moves. MFCS (2006)
Vittorio Bilò, Michele Flammini, Luca Moscardelli
Pareto approximations for the bicriteria scheduling problem. J. Parallel Distributed Comput. 66 (3) (2006)
Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks
Approximating the Traffic Grooming Problem in Tree and Star Networks. WG (2006)
Michele Flammini, Luca Moscardelli, Alfredo Navarra, Stéphane Pérennes
Asymptotically Optimal Solutions for Small World Graphs. DISC (2005)
Vittorio Bilò, Michele Flammini, Luca Moscardelli
On Nash Equilibria in Non-cooperative All-Optical Networks. STACS (2005)
Michele Flammini, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks
Approximating the Traffic Grooming Problem. ISAAC (2005)
Vittorio Bilò, Michele Flammini, Giovanna Melideo, Luca Moscardelli
On Nash Equilibria for Multicast Transmissions in Ad-Hoc Wireless Networks. ISAAC (2004)
Vittorio Bilò, Michele Flammini, Luca Moscardelli
Pareto Approximations for the Bicriteria Scheduling Problem. IPDPS (2004)
Vittorio Bilò, Luca Moscardelli
The Price of Anarchy in All-Optical Networks. SIROCCO (2004)

Luca Moscardelli.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Luca Moscardelli