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 the Crossing Spanning Tree Problem. - Vittorio Bilò; Vineet Goyal; R. Ravi 001; Mohit Singh (APPROX-RANDOM, 2004)

An Improved Approximation Algorithm for the Minimum Energy Consumption Broadcast Subgraph. - Vittorio Bilò; Giovanna Melideo (Euro-Par, 2004)

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

The Price of Anarchy in All-Optical Networks. - Vittorio Bilò; Luca Moscardelli (SIROCCO, 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)

Geometric Clustering to Minimize the Sum of Cluster Sizes. - Vittorio Bilò; Ioannis Caragiannis; Christos Kaklamanis; Panagiotis Kanellopoulos (ESA, 2005)

Pricing and equilibria in non-cooperative networks. - Vittorio Bilò (2005)

On the packing of selfish items. - Vittorio Bilò (IPDPS, 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)

On Satisfiability Games and the Power of Congestion Games. - Vittorio Bilò (AAIM, 2007)

The Price of Nash Equilibria in Multicast Transmissions Games. - Vittorio Bilò (ISAAC, 2007)

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

On Nash equilibria for multicast transmissions in ad-hoc wireless networks. - Vittorio Bilò; Michele Flammini; Giovanna Melideo; Luca Moscardelli (Wirel. Networks, 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)

One-round Walks in Linear Congestion Games. - Vittorio Bilò (Bull. EATCS, 2010)

The Price of Nash Equilibria in Multicast Transmission Games. - Vittorio Bilò (J. Interconnect. Networks, 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)

Graphical Congestion Games. - Vittorio Bilò; Angelo Fanelli 001; Michele Flammini; 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)

Bounds on the Price of stability of Undirected Network Design Games with Three Players. - Vittorio Bilò; Roberta Bove (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)

The Complexity of Decision Problems about Nash Equilibria in Win-Lose Games. - Vittorio Bilò; Marios Mavronicolas (SAGT, 2012)

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

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)

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)

On Linear Congestion Games with Altruistic Social Context. - Vittorio Bilò (COCOON, 2014)

On the Stackelberg fuel pricing problem. - Cosimo Vinci; Vittorio Bilò (ICTCS, 2014)

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

Complexity of Rational and Irrational Nash Equilibria. - Vittorio Bilò; Marios Mavronicolas (Theory Comput. Syst., 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)

New bounds for the balloon popping problem. - Davide Bilò; Vittorio Bilò (J. Comb. Optim., 2015)

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

A Catalog of EXISTS-R-Complete Decision Problems About Nash Equilibria in Multi-Player Games. - Vittorio Bilò; Marios Mavronicolas (STACS, 2016)

On the performance of mildly greedy players in cut games. - Vittorio Bilò; Mauro Paladini (J. Comb. Optim., 2016)

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

On the Impact of Singleton Strategies in Congestion Games. - Vittorio Bilò; Cosimo Vinci (ESA, 2017)

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

Existential-R-Complete Decision Problems about Symmetric Nash Equilibria in Symmetric Multi-Player Games. - Vittorio Bilò; Marios Mavronicolas (STACS, 2017)

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

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

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

On Colorful Bin Packing Games. - Vittorio Bilò; Francesco Cellinese; Giovanna Melideo; Gianpiero Monaco (COCOON, 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)

A Unifying Tool for Bounding the Quality of Non-Cooperative Solutions in Weighted Congestion Games. - Vittorio Bilò (Theory Comput. Syst., 2018)

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

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 a Simple Hedonic Game with Graph-Restricted Communication. - Vittorio Bilò; Laurent Gourvès; Jérôme Monnot (SAGT, 2019)

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

On Stackelberg Strategies in Affine Congestion Games. - Vittorio Bilò; Cosimo Vinci (Theory Comput. Syst., 2019)

Editorial. - Vittorio Bilò; Antonio Caruso 001 (Theor. Comput. Sci., 2019)

Dynamic Taxes for Polynomial Congestion Games. - Vittorio Bilò; Cosimo Vinci (ACM Trans. Economics and Comput., 2019)

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

Data-Driven Models of Selfish Routing: Why Price of Anarchy Does Depend on Network Topology. - Francisco Benita; Vittorio Bilò; Barnabé Monnot; Georgios Piliouras; Cosimo Vinci (WINE, 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)

Selfish colorful bin packing games. - Vittorio Bilò; Francesco Cellinese; Giovanna Melideo; Gianpiero Monaco (J. Comb. Optim., 2020)

The price of anarchy of affine congestion games with similar strategies. - Vittorio Bilò; Cosimo Vinci (Theor. Comput. Sci., 2020)

The Complexity of Computational Problems About Nash Equilibria in Symmetric Win-Lose Games. - Vittorio Bilò; Marios Mavronicolas (Algorithmica, 2021)

On Nash Equilibria in Non-Cooperative All-Optical Networks. - Vittorio Bilò; Michele Flammini; Luca Moscardelli (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)

∃ℝ-complete Decision Problems about (Symmetric) Nash Equilibria in (Symmetric) Multi-player Games. - Vittorio Bilò; Marios Mavronicolas (ACM Trans. Economics and Comput., 2021)

Hedonic Games with Fixed-Size Coalitions. - Vittorio Bilò; Gianpiero Monaco; Luca Moscardelli (AAAI, 2022)

General Opinion Formation Games with Social Group Membership (Discussion Paper). - Vittorio Bilò; Diodato Ferraioli; Cosimo Vinci (DP@AI*IA, 2022)

General Opinion Formation Games with Social Group Membership. - Vittorio Bilò; Diodato Ferraioli; Cosimo Vinci (ICTCS, 2022)

Tolerance is Necessary for Stability: Single-Peaked Swap Schelling Games. - Davide Bilò; Vittorio Bilò; Pascal Lenzner; Louise Molitor (IJCAI, 2022)

Topological influence and locality in swap schelling games. - Davide Bilò; Vittorio Bilò; Pascal Lenzner; Louise Molitor (Auton. Agents Multi Agent Syst., 2022)

The Impact of Selfish Behavior in Load Balancing Games. - Vittorio Bilò; Cosimo Vinci (CoRR, 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)

On the robustness of the approximate price of anarchy in generalized congestion games. - Vittorio Bilò (Theor. Comput. Sci., 2022)

Nash Social Welfare in Selfish and Online Load Balancing. - Cosimo Vinci; Vittorio Bilò; Gianpiero Monaco; Luca Moscardelli (ACM Trans. Economics and Comput., 2022)

Utility-Sharing Games: How to Improve the Efficiency with Limited Subsidies (short paper) . - Vittorio Bilò; Lucaleonardo Bove; Cosimo Vinci (IPS-RCRA-SPIRIT@AI*IA, 2023)

Schelling Games with Continuous Types (short paper). - Davide Bilò; Vittorio Bilò; Michelle Döring; Pascal Lenzner; Louise Molitor; Jonas Schmidt 002 (ICTCS, 2023)

Utility-Sharing Games: How to Improve the Efficiency with Limited Subsidies. - Vittorio Bilò; Lucaleonardo Bove; Cosimo Vinci (ICTCS, 2023)

Schelling Games with Continuous Types. - Davide Bilò; Vittorio Bilò; Michelle Döring; Pascal Lenzner; Louise Molitor; Jonas Schmidt 002 (IJCAI, 2023)

Computational Complexity of Decision Problems About Nash Equilibria in Win-Lose Multi-player Games. - Vittorio Bilò; Kristoffer Arnsfelt Hansen; Marios Mavronicolas (SAGT, 2023)

Project games. - Vittorio Bilò; Laurent Gourvès; Jérôme Monnot (Theor. Comput. Sci., 2023)

Coping with Selfishness in Congestion Games - Analysis and Design via LP Duality - Vittorio Bilò; Cosimo Vinci (Springer, 2023)

Congestion games with priority-based scheduling. - Vittorio Bilò; Cosimo Vinci (Theor. Comput. Sci., 2023)

Enhancing the Efficiency of Altruism and Taxes in Affine Congestion Games through Signalling. - Vittorio Bilò; Cosimo Vinci (AAAI, 2024)

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)

Achieving Envy-Freeness Through Items Sale. - Vittorio Bilò; Evangelos Markakis; Cosimo Vinci (ESA, 2024)

Uniform Mixed Equilibria in Network Congestion Games with Link Failures. - Vittorio Bilò; Luca Moscardelli; Cosimo Vinci (Math. Oper. Res., 2024)

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

On the Performance of Mildly Greedy Players in k-Coloring Games. - Vittorio Bilò; Andrea D'Ascenzo; Mattia D'Emidio; Giuseppe F. Italiano (MFCS, 2025)

Mixed Nash Equilibria in Discrete Tullock Contests. - Vittorio Bilò; Marios Mavronicolas; Paul G. Spirakis; Daniel Windisch (SAGT, 2025)

On Almost Fair and Equitable Allocations of Indivisible Items for Non-monotone Valuations. - Vittorio Bilò; Martin Loebl; Cosimo Vinci (CoRR, 2025)