default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVittorio Bilò
Person information
- affiliation: University of Salento, Lecce, Italy
- affiliation (former): University of L'Aquila, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j47]Vittorio Bilò
, Luca Moscardelli, Cosimo Vinci:
Uniform Mixed Equilibria in Network Congestion Games with Link Failures. Math. Oper. Res. 49(1): 509-535 (2024)- [c77]Vittorio Bilò, Cosimo Vinci:
Enhancing the Efficiency of Altruism and Taxes in Affine Congestion Games through Signalling. AAAI 2024: 9511-9518 - [c76]Vittorio Bilò, Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Cosimo Vinci:
On Green Sustainability of Resource Selection Games with Equitable Cost-Sharing. AAMAS 2024: 207-215 - [c75]Alessandro Aloisio, Vittorio Bilò, Antonio Mario Caruso, Michele Flammini, Cosimo Vinci:
Approximately Fair Allocation of Indivisible Items with Random Valuations. AAMAS 2024: 2120-2122 - [c74]Vittorio Bilò, Evangelos Markakis, Cosimo Vinci:
Achieving Envy-Freeness Through Items Sale. ESA 2024: 26:1-26:16 - [i14]Vittorio Bilò, Angelo Fanelli, Laurent Gourvès, Christos Tsoufis, Cosimo Vinci:
Minimizing Rosenthal's Potential in Monotone Congestion Games. CoRR abs/2408.11489 (2024) - 2023
- [b2]Vittorio Bilò, Cosimo Vinci:
Coping with Selfishness in Congestion Games - Analysis and Design via LP Duality. Monographs in Theoretical Computer Science. An EATCS Series, Springer 2023, ISBN 978-3-031-30260-2, pp. 3-166 - [j46]Vittorio Bilò, Laurent Gourvès, Jérôme Monnot:
Project games. Theor. Comput. Sci. 940(Part): 97-111 (2023) - [j45]Vittorio Bilò, Cosimo Vinci:
Congestion games with priority-based scheduling. Theor. Comput. Sci. 974: 114094 (2023) - [c73]Vittorio Bilò, Lucaleonardo Bove, Cosimo Vinci:
Utility-Sharing Games: How to Improve the Efficiency with Limited Subsidies (short paper) . IPS-RCRA-SPIRIT@AI*IA 2023 - [c72]Vittorio Bilò, Lucaleonardo Bove, Cosimo Vinci:
Utility-Sharing Games: How to Improve the Efficiency with Limited Subsidies. ICTCS 2023: 314-327 - [c71]Davide Bilò, Vittorio Bilò, Michelle Döring, Pascal Lenzner, Louise Molitor, Jonas Schmidt:
Schelling Games with Continuous Types (short paper). ICTCS 2023: 328-333 - [c70]Davide Bilò, Vittorio Bilò, Michelle Döring, Pascal Lenzner, Louise Molitor, Jonas Schmidt:
Schelling Games with Continuous Types. IJCAI 2023: 2520-2527 - [c69]Vittorio Bilò, Kristoffer Arnsfelt Hansen, Marios Mavronicolas:
Computational Complexity of Decision Problems About Nash Equilibria in Win-Lose Multi-player Games. SAGT 2023: 40-57 - [i13]Davide Bilò, Vittorio Bilò, Michelle Döring, Pascal Lenzner, Louise Molitor, Jonas Schmidt:
Schelling Games with Continuous Types. CoRR abs/2305.06819 (2023) - 2022
- [j44]Davide Bilò, Vittorio Bilò, Pascal Lenzner, Louise Molitor:
Topological influence and locality in swap schelling games. Auton. Agents Multi Agent Syst. 36(2): 47 (2022) - [j43]Vittorio Bilò, Ioannis Caragiannis, Michele Flammini, Ayumi Igarashi, Gianpiero Monaco, Dominik Peters, Cosimo Vinci, William S. Zwicker:
Almost envy-free allocations with connected bundles. Games Econ. Behav. 131: 197-221 (2022) - [j42]Vittorio Bilò, Michele Flammini, Gianpiero Monaco, Luca Moscardelli:
Pricing Problems with Buyer Preselection. J. Artif. Intell. Res. 74: 1791-1822 (2022) - [j41]Vittorio Bilò:
On the robustness of the approximate price of anarchy in generalized congestion games. Theor. Comput. Sci. 906: 94-113 (2022) - [j40]Cosimo Vinci, Vittorio Bilò, Gianpiero Monaco, Luca Moscardelli:
Nash Social Welfare in Selfish and Online Load Balancing. ACM Trans. Economics and Comput. 10(2): 8:1-8:41 (2022) - [c68]Vittorio Bilò, Gianpiero Monaco, Luca Moscardelli:
Hedonic Games with Fixed-Size Coalitions. AAAI 2022: 9287-9295 - [c67]Vittorio Bilò, Diodato Ferraioli, Cosimo Vinci:
General Opinion Formation Games with Social Group Membership (Discussion Paper). DP@AI*IA 2022: 85-94 - [c66]Vittorio Bilò, Diodato Ferraioli, Cosimo Vinci:
General Opinion Formation Games with Social Group Membership. ICTCS 2022: 174-179 - [c65]Vittorio Bilò, Gianpiero Monaco, Luca Moscardelli, Cosimo Vinci:
Nash Social Welfare in Selfish and Online Load Balancing. ICTCS 2022: 180-187 - [c64]Davide Bilò, Vittorio Bilò, Pascal Lenzner, Louise Molitor:
Tolerance is Necessary for Stability: Single-Peaked Swap Schelling Games. IJCAI 2022: 81-87 - [c63]Vittorio Bilò, Diodato Ferraioli, Cosimo Vinci:
General Opinion Formation Games with Social Group Membership. IJCAI 2022: 88-94 - [i12]Vittorio Bilò, Cosimo Vinci:
The Impact of Selfish Behavior in Load Balancing Games. CoRR abs/2202.12173 (2022) - [i11]Davide Bilò, Vittorio Bilò, Pascal Lenzner, Louise Molitor:
Tolerance is Necessary for Stability: Single-Peaked Swap Schelling Games. CoRR abs/2204.12599 (2022) - 2021
- [j39]Vittorio Bilò, Marios Mavronicolas:
The Complexity of Computational Problems About Nash Equilibria in Symmetric Win-Lose Games. Algorithmica 83(2): 447-530 (2021) - [j38]Vittorio Bilò, Michele Flammini, Luca Moscardelli:
On Nash Equilibria in Non-Cooperative All-Optical Networks. Algorithms 14(1): 15 (2021) - [j37]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): 1-14 (2021) - [j36]Vittorio Bilò, Marios Mavronicolas:
∃ℝ-complete Decision Problems about (Symmetric) Nash Equilibria in (Symmetric) Multi-player Games. ACM Trans. Economics and Comput. 9(3): 14:1-14:25 (2021) - 2020
- [j35]Vittorio Bilò, Michele Flammini, Vasco Gallotti, Cosimo Vinci:
On Multidimensional Congestion Games. Algorithms 13(10): 261 (2020) - [j34]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: 359-376 (2020) - [j33]Vittorio Bilò, Francesco Cellinese, Giovanna Melideo, Gianpiero Monaco:
Selfish colorful bin packing games. J. Comb. Optim. 40(3): 610-635 (2020) - [j32]Vittorio Bilò, Cosimo Vinci:
The price of anarchy of affine congestion games with similar strategies. Theor. Comput. Sci. 806: 641-654 (2020) - [c62]Vittorio Bilò, Michele Flammini, Cosimo Vinci:
The Quality of Content Publishing in the Digital Era. ECAI 2020: 35-42 - [c61]Davide Bilò, Vittorio Bilò, Pascal Lenzner, Louise Molitor:
Topological Influence and Locality in Swap Schelling Games. MFCS 2020: 15:1-15:15 - [c60]Vittorio Bilò, Cosimo Vinci:
Congestion Games with Priority-Based Scheduling. SAGT 2020: 67-82 - [c59]Francisco Benita, Vittorio Bilò, Barnabé Monnot, Georgios Piliouras, Cosimo Vinci:
Data-Driven Models of Selfish Routing: Why Price of Anarchy Does Depend on Network Topology. WINE 2020: 252-265 - [c58]Vittorio Bilò, Gianpiero Monaco, Luca Moscardelli, Cosimo Vinci:
Nash Social Welfare in Selfish and Online Load Balancing. WINE 2020: 323-337 - [i10]Davide Bilò, Vittorio Bilò, Pascal Lenzner, Louise Molitor:
Topological Influence and Locality in Swap Schelling Games. CoRR abs/2005.02752 (2020) - [i9]Vittorio Bilò, Gianpiero Monaco, Luca Moscardelli, Cosimo Vinci:
Nash Social Welfare in Selfish and Online Load Balancing. CoRR abs/2007.08263 (2020) - [i8]Francisco Benita, Vittorio Bilò, Barnabé Monnot, Georgios Piliouras, Cosimo Vinci:
Data-Driven Models of Selfish Routing: Why Price of Anarchy Does Depend on Network Topology. CoRR abs/2009.12871 (2020)
2010 – 2019
- 2019
- [j31]Vittorio Bilò, Cosimo Vinci:
On Stackelberg Strategies in Affine Congestion Games. Theory Comput. Syst. 63(6): 1228-1249 (2019) - [j30]Vittorio Bilò, Michele Flammini:
Guest Editorial: Special Issue on Algorithmic Game Theory. Theory Comput. Syst. 63(7): 1449-1450 (2019) - [j29]Vittorio Bilò, Antonio Caruso:
Editorial. Theor. Comput. Sci. 764: 1 (2019) - [j28]Vittorio Bilò, Cosimo Vinci:
Dynamic Taxes for Polynomial Congestion Games. ACM Trans. Economics and Comput. 7(3): 15:1-15:36 (2019) - [c57]Vittorio Bilò, Laurent Gourvès, Jérôme Monnot:
Project Games. CIAC 2019: 75-86 - [c56]Vittorio Bilò, Angelo Fanelli, Michele Flammini, Gianpiero Monaco, Luca Moscardelli:
Optimality and Nash Stability in Additive Separable Generalized Group Activity Selection Problems. IJCAI 2019: 102-108 - [c55]Vittorio Bilò, Ioannis Caragiannis, Michele Flammini, Ayumi Igarashi, Gianpiero Monaco, Dominik Peters, Cosimo Vinci, William S. Zwicker:
Almost Envy-Free Allocations with Connected Bundles. ITCS 2019: 14:1-14:21 - [c54]Vittorio Bilò, Laurent Gourvès, Jérôme Monnot:
On a Simple Hedonic Game with Graph-Restricted Communication. SAGT 2019: 252-265 - [i7]Vittorio Bilò, Marios Mavronicolas:
The Complexity of Computational Problems about Nash Equilibria in Symmetric Win-Lose Games. CoRR abs/1907.10468 (2019) - 2018
- [j27]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: 315-371 (2018) - [j26]Vittorio Bilò:
A Unifying Tool for Bounding the Quality of Non-Cooperative Solutions in Weighted Congestion Games. Theory Comput. Syst. 62(5): 1288-1317 (2018) - [j25]Vittorio Bilò, Angelo Fanelli, Luca Moscardelli:
Opinion formation games with dynamic social influences. Theor. Comput. Sci. 746: 73-87 (2018) - [c53]Vittorio Bilò, Michele Flammini, Gianpiero Monaco, Luca Moscardelli:
On the Impact of Buyers Preselection in Pricing Problems. AAMAS 2018: 1871-1873 - [c52]Vittorio Bilò, Francesco Cellinese, Giovanna Melideo, Gianpiero Monaco:
On Colorful Bin Packing Games. COCOON 2018: 280-292 - [c51]Vittorio Bilò, Luca Moscardelli, Cosimo Vinci:
Uniform Mixed Equilibria in Network Congestion Games with Link Failures. ICALP 2018: 146:1-146:14 - [c50]Vittorio Bilò, Cosimo Vinci:
The Price of Anarchy of Affine Congestion Games with Similar Strategies. ICTCS 2018: 48-59 - [c49]Vittorio Bilò, Michele Flammini, Gianpiero Monaco, Luca Moscardelli:
Pricing Problems with Buyer Preselection. MFCS 2018: 47:1-47:16 - [i6]Vittorio Bilò, Ioannis Caragiannis, Michele Flammini, Ayumi Igarashi, Gianpiero Monaco, Dominik Peters, Cosimo Vinci, William S. Zwicker:
Almost Envy-Free Allocations with Connected Bundles. CoRR abs/1808.09406 (2018) - 2017
- [j24]Vittorio Bilò, Angelo Fanelli, Luca Moscardelli:
On lookahead equilibria in congestion games. Math. Struct. Comput. Sci. 27(2): 197-214 (2017) - [j23]Vittorio Bilò, Michele Flammini, Gianpiero Monaco:
Approximating the revenue maximization problem with sharp demands. Theor. Comput. Sci. 662: 9-30 (2017) - [c48]Vittorio Bilò, Cosimo Vinci:
On the Impact of Singleton Strategies in Congestion Games. ESA 2017: 17:1-17:14 - [c47]Vittorio Bilò, Ioannis Caragiannis, Angelo Fanelli, Michele Flammini, Gianpiero Monaco:
Simple Greedy Algorithms for Fundamental Multidimensional Graph Problems. ICALP 2017: 125:1-125:13 - [c46]Vittorio Bilò, Marios Mavronicolas:
Existential-R-Complete Decision Problems about Symmetric Nash Equilibria in Symmetric Multi-Player Games. STACS 2017: 13:1-13:14 - [e2]Vittorio Bilò, Michele Flammini:
Algorithmic Game Theory - 10th International Symposium, SAGT 2017, L'Aquila, Italy, September 12-14, 2017, Proceedings. Lecture Notes in Computer Science 10504, Springer 2017, ISBN 978-3-319-66699-0 [contents] - [i5]Vittorio Bilò, Francesco Cellinese, Giovanna Melideo, Gianpiero Monaco:
On Colorful Bin Packing Games. CoRR abs/1711.03570 (2017) - 2016
- [j22]Vittorio Bilò, Mauro Paladini:
On the performance of mildly greedy players in cut games. J. Comb. Optim. 32(4): 1036-1051 (2016) - [j21]Vittorio Bilò, Angelo Fanelli, Michele Flammini, Gianpiero Monaco, Luca Moscardelli:
The price of envy-freeness in machine scheduling. Theor. Comput. Sci. 613: 65-78 (2016) - [c45]Vittorio Bilò:
On the Robustness of the Approximate Price of Anarchy in Generalized Congestion Games. SAGT 2016: 93-104 - [c44]Vittorio Bilò, Cosimo Vinci:
Dynamic Taxes for Polynomial Congestion Games. EC 2016: 839-856 - [c43]Vittorio Bilò, Marios Mavronicolas:
A Catalog of EXISTS-R-Complete Decision Problems About Nash Equilibria in Multi-Player Games. STACS 2016: 17:1-17:13 - [c42]Vittorio Bilò, Angelo Fanelli, Luca Moscardelli:
Opinion Formation Games with Dynamic Social Influences. WINE 2016: 444-458 - [e1]Vittorio Bilò, Antonio Caruso:
Proceedings of the 17th Italian Conference on Theoretical Computer Science, Lecce, Italy, September 7-9, 2016. CEUR Workshop Proceedings 1720, CEUR-WS.org 2016 [contents] - 2015
- [j20]Anna Angelucci, Vittorio Bilò, Michele Flammini, Luca Moscardelli:
On the sequential price of anarchy of isolation games. J. Comb. Optim. 29(1): 165-181 (2015) - [j19]Davide Bilò, Vittorio Bilò:
New bounds for the balloon popping problem. J. Comb. Optim. 29(1): 182-196 (2015) - [j18]Vittorio Bilò, Michele Flammini, Gianpiero Monaco, Luca Moscardelli:
Some Anomalies of Farsighted Strategic Behavior. Theory Comput. Syst. 56(1): 156-180 (2015) - [c41]Vittorio Bilò, Angelo Fanelli, Michele Flammini, Gianpiero Monaco, Luca Moscardelli:
On the Price of Stability of Fractional Hedonic Games. AAMAS 2015: 1239-1247 - [c40]Vittorio Bilò, Michele Flammini, Gianpiero Monaco, Luca Moscardelli:
Computing Approximate Nash Equilibria in Network Congestion Games with Polynomially Decreasing Cost Functions. WINE 2015: 118-131 - [c39]Vittorio Bilò, Cosimo Vinci:
On Stackelberg Strategies in Affine Congestion Games. WINE 2015: 132-145 - 2014
- [j17]Vittorio Bilò, Marios Mavronicolas:
Complexity of Rational and Irrational Nash Equilibria. Theory Comput. Syst. 54(3): 491-527 (2014) - [c38]Vittorio Bilò, Mauro Paladini:
On the Performance of Mildly Greedy Players in Cut Games. COCOON 2014: 513-524 - [c37]Vittorio Bilò:
On Linear Congestion Games with Altruistic Social Context. COCOON 2014: 547-558 - [c36]Cosimo Vinci, Vittorio Bilò:
On the Stackelberg fuel pricing problem. ICTCS 2014: 213-224 - [c35]Vittorio Bilò, Angelo Fanelli, Michele Flammini, Gianpiero Monaco, Luca Moscardelli:
The Price of Envy-Freeness in Machine Scheduling. MFCS (2) 2014: 106-117 - [c34]Vittorio Bilò, Michele Flammini, Gianpiero Monaco:
Approximating the Revenue Maximization Problem with Sharp Demands. SWAT 2014: 74-85 - [c33]Vittorio Bilò, Angelo Fanelli, Michele Flammini, Gianpiero Monaco, Luca Moscardelli:
Nash Stability in Fractional Hedonic Games. WINE 2014: 486-491 - [i4]Vittorio Bilò:
On the Robustness of the Approximate Price of Anarchy in Generalized Congestion Games. CoRR abs/1412.0845 (2014) - 2013
- [j16]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): 668-686 (2013) - [j15]Vittorio Bilò, Michele Flammini, Luca Moscardelli:
The price of stability of fair undirected broadcast games is constant. SIGecom Exch. 12(2): 42-45 (2013) - [j14]Vittorio Bilò, Alessandro Celi, Michele Flammini, Vasco Gallotti:
Social context congestion games. Theor. Comput. Sci. 514: 21-35 (2013) - [c32]Davide Bilò, Vittorio Bilò:
New Bounds for the Balloon Popping Problem. COCOON 2013: 5-16 - [c31]Anna Angelucci, Vittorio Bilò, Michele Flammini, Luca Moscardelli:
On the Sequential Price of Anarchy of Isolation Games. COCOON 2013: 17-28 - [c30]Vittorio Bilò, Michele Flammini, Luca Moscardelli:
The Price of Stability for Undirected Broadcast Network Design with Fair Cost Allocation Is Constant. FOCS 2013: 638-647 - [c29]Vittorio Bilò, Angelo Fanelli, Luca Moscardelli:
On Lookahead Equilibria in Congestion Games. WINE 2013: 54-67 - [i3]Vittorio Bilò:
On Linear Congestion Games with Altruistic Social Context. CoRR abs/1308.3329 (2013) - [i2]Vittorio Bilò, Michele Flammini, Gianpiero Monaco:
Approximating the Revenue Maximization Problem with Sharp Demands. CoRR abs/1312.3892 (2013) - 2012
- [c28]Vittorio Bilò, Marios Mavronicolas:
The Complexity of Decision Problems about Nash Equilibria in Win-Lose Games. SAGT 2012: 37-48 - [c27]Vittorio Bilò, Michele Flammini, Vasco Gallotti:
On Bidimensional Congestion Games. SIROCCO 2012: 147-158 - [c26]Vittorio Bilò:
A Unifying Tool for Bounding the Quality of Non-cooperative Solutions in Weighted Congestion Games. WAOA 2012: 215-228 - [c25]Vittorio Bilò, Michele Flammini, Gianpiero Monaco, Luca Moscardelli:
Some Anomalies of Farsighted Strategic Behavior. WAOA 2012: 229-241 - 2011
- [j13]Vittorio Bilò, Angelo Fanelli, Michele Flammini, Luca Moscardelli:
Graphical Congestion Games. Algorithmica 61(2): 274-297 (2011) - [j12]Vittorio Bilò, Michele Flammini, Gianpiero Monaco, Luca Moscardelli:
On the performances of Nash equilibria in isolation games. J. Comb. Optim. 22(3): 378-391 (2011) - [j11]Vittorio Bilò, Roberta Bove:
Bounds on the Price of stability of Undirected Network Design Games with Three Players. J. Interconnect. Networks 12(1-2): 1-17 (2011) - [j10]Vittorio Bilò, Angelo Fanelli, Michele Flammini, Luca Moscardelli:
Performance of One-Round Walks in Linear Congestion Games. Theory Comput. Syst. 49(1): 24-45 (2011) - [j9]Vittorio Bilò, Michele Flammini:
Extending the notion of rationality of selfish agents: Second Order Nash equilibria. Theor. Comput. Sci. 412(22): 2296-2311 (2011) - [c24]Vittorio Bilò, Marios Mavronicolas:
Complexity of Rational and Irrational Nash Equilibria. SAGT 2011: 200-211 - [c23]Vittorio Bilò, Alessandro Celi, Michele Flammini, Vasco Gallotti:
Social Context Congestion Games. SIROCCO 2011: 282-293 - [i1]Vittorio Bilò:
A Unifying Tool for Bounding the Quality of Non-Cooperative Solutions in Weighted Congestion Games. CoRR abs/1110.5439 (2011) - 2010
- [j8]Vittorio Bilò:
One-round Walks in Linear Congestion Games. Bull. EATCS 101: 45-63 (2010) - [j7]Vittorio Bilò:
The Price of Nash Equilibria in Multicast Transmission Games. J. Interconnect. Networks 11(3-4): 97-120 (2010) - [j6]Vittorio Bilò, Angelo Fanelli, Michele Flammini, Giovanna Melideo, Luca Moscardelli:
Designing Fast Converging Cost Sharing Methods for Multicast Transmissions. Theory Comput. Syst. 47(2): 507-530 (2010) - [j5]Vittorio Bilò, Angelo Fanelli, Michele Flammini, Luca Moscardelli:
When ignorance helps: Graphical multicast cost sharing games. Theor. Comput. Sci. 411(3): 660-671 (2010) - [c22]Vittorio Bilò, Angelo Fanelli:
Computing Exact and Approximate Nash Equilibria in 2-Player Games. AAIM 2010: 58-69 - [c21]Vittorio Bilò, Ioannis Caragiannis, Angelo Fanelli, Gianpiero Monaco:
Improved Lower Bounds on the Price of Stability of Undirected Network Design Games. SAGT 2010: 90-101 - [p1]Vittorio Bilò, Ioannis Caragiannis, Angelo Fanelli, Michele Flammini, Christos Kaklamanis, Gianpiero Monaco, Luca Moscardelli:
Game-Theoretic Approaches to Optimization Problems in Communication Networks. Graphs and Algorithms in Communication Networks 2010: 241-263
2000 – 2009
- 2009
- [c20]Vittorio Bilò, Michele Flammini, Gianpiero Monaco, Luca Moscardelli:
On the Performances of Nash Equilibria in Isolation Games. COCOON 2009: 17-26 - [c19]Vittorio Bilò, Angelo Fanelli, Michele Flammini, Luca Moscardelli:
Performances of One-Round Walks in Linear Congestion Games. SAGT 2009: 311-322 - 2008
- [j4]Vittorio Bilò, Michele Flammini, Giovanna Melideo, Luca Moscardelli:
On Nash equilibria for multicast transmissions in ad-hoc wireless networks. Wirel. Networks 14(2): 147-157 (2008) - [c18]Vittorio Bilò, Angelo Fanelli, Michele Flammini, Luca Moscardelli:
When Ignorance Helps: Graphical Multicast Cost Sharing Games. MFCS 2008: 108-119 - [c17]Vittorio Bilò, Angelo Fanelli, Michele Flammini, Luca Moscardelli:
Graphical congestion games with linear latencies. SPAA 2008: 194-196 - [c16]Vittorio Bilò, Angelo Fanelli, Michele Flammini, Luca Moscardelli:
Graphical Congestion Games. WINE 2008: 70-81 - 2007
- [c15]Vittorio Bilò:
On Satisfiability Games and the Power of Congestion Games. AAIM 2007: 231-240 - [c14]Vittorio Bilò:
The Price of Nash Equilibria in Multicast Transmissions Games. ISAAC 2007: 390-401 - [c13]Vittorio Bilò, Michele Flammini:
Extending the Notion of Rationality of Selfish Agents: Second Order Nash Equilibria. MFCS 2007: 621-632 - 2006
- [j3]Vittorio Bilò, Michele Flammini, Luca Moscardelli:
Pareto approximations for the bicriteria scheduling problem. J. Parallel Distributed Comput. 66(3): 393-402 (2006) - [j2]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): 269-284 (2006) - [c12]Vittorio Bilò:
On the packing of selfish items. IPDPS 2006 - 2005
- [b1]Vittorio Bilò:
Pricing and equilibria in non-cooperative networks. University of L'Aquila, Italy, 2005 - [c11]Vittorio Bilò, Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos:
Geometric Clustering to Minimize the Sum of Cluster Sizes. ESA 2005: 460-471 - [c10]Vittorio Bilò, Michele Flammini, Luca Moscardelli:
On Nash Equilibria in Non-cooperative All-Optical Networks. STACS 2005: 448-459 - 2004
- [j1]Vittorio Bilò, Michele Flammini, Roberto Giovannelli:
Experimental analysis of online algorithms for the bicriteria scheduling problem. J. Parallel Distributed Comput. 64(9): 1086-1100 (2004) - [c9]Vittorio Bilò, Vineet Goyal, R. Ravi, Mohit Singh:
On the Crossing Spanning Tree Problem. APPROX-RANDOM 2004: 51-60 - [c8]Vittorio Bilò, Giovanna Melideo:
An Improved Approximation Algorithm for the Minimum Energy Consumption Broadcast Subgraph. Euro-Par 2004: 949-956 - [c7]Vittorio Bilò, Michele Flammini:
On the IP Routing Tables Minimization with Addresses Reassignment. IPDPS 2004 - [c6]Vittorio Bilò, Michele Flammini, Luca Moscardelli:
Pareto Approximations for the Bicriteria Scheduling Problem. IPDPS 2004 - [c5]Vittorio Bilò, Michele Flammini, Giovanna Melideo, Luca Moscardelli:
On Nash Equilibria for Multicast Transmissions in Ad-Hoc Wireless Networks. ISAAC 2004: 172-183 - [c4]Vittorio Bilò, Luca Moscardelli:
The Price of Anarchy in All-Optical Networks. SIROCCO 2004: 13-22 - [c3]Vittorio Bilò, Chiara Di Francescomarino, Michele Flammini, Giovanna Melideo:
Sharing the cost of multicast transmissions in wireless networks. SPAA 2004: 180-187 - 2003
- [c2]Vittorio Bilò, Adriano Di Pasquale, Fabio Fioravanti, Michele Flammini, Luca Forlizzi, Francesco Lo Presti, Giovanna Melideo, Enrico Nardelli, Alfredo Navarra, Guido Proietti:
Quality of Service in Wireless Networks. IPDPS 2003: 224 - [c1]Vittorio Bilò, Michele Flammini, Roberto Giovannelli:
Experimental Analysis of Online Algorithms for the Bicriteria Scheduling Problem. WEA 2003: 33-46
Coauthor Index
[c76] [c75] [j43] [j42] [j38] [j37] [j35] [j34] [c62] [j30] [c56] [c55] [j27] [c53] [c49] [i6] [j23] [c47] [e2] [j21] [j20] [j18] [c41] [c40] [c35] [c34] [c33] [j15] [j14] [c31] [c30] [i2] [c27] [c25] [j13] [j12] [j10] [j9] [c23] [j6] [j5] [p1] [c20] [c19] [j4] [c18] [c17] [c16] [c13] [j3] [j2] [c10] [j1] [c7] [c6] [c5] [c3] [c2] [c1]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:23 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
