Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCosimo Vinci
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j7]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)- [j6]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) - [c23]Vincenzo Auletta, Diodato Ferraioli, Cosimo Vinci:
On Augmented Stochastic Submodular Optimization: Adaptivity, Multi-Rounds, Budgeted, and Robustness (Short Paper). IPS/RiCeRcA/SPIRIT@AI*IA 2022 - [c22]Vittorio Bilò, Diodato Ferraioli, Cosimo Vinci:
General Opinion Formation Games with Social Group Membership. ICTCS 2022: 174-179 - [c21]Vittorio Bilò, Gianpiero Monaco, Luca Moscardelli, Cosimo Vinci:
Nash Social Welfare in Selfish and Online Load Balancing. ICTCS 2022: 180-187 - [c20]Vittorio Bilò, Diodato Ferraioli, Cosimo Vinci:
General Opinion Formation Games with Social Group Membership. IJCAI 2022: 88-94 - [i6]Vittorio Bilò, Cosimo Vinci:
The Impact of Selfish Behavior in Load Balancing Games. CoRR abs/2202.12173 (2022) - 2021
- [c19]Gianlorenzo D'Angelo, Debashmita Poddar, Cosimo Vinci:
Better Bounds on the Adaptivity Gap of Influence Maximization under Full-adoption Feedback. AAAI 2021: 12069-12077 - [c18]Gianlorenzo D'Angelo, Debashmita Poddar, Cosimo Vinci:
Improved Approximation Factor for Adaptive Influence Maximization via Simple Greedy Strategies. ICALP 2021: 59:1-59:19 - [c17]Alessandro Aloisio, Michele Flammini, Bojana Kodric, Cosimo Vinci:
Distance Polymatrix Coordination Games. IJCAI 2021: 3-9 - 2020
- [j5]Vittorio Bilò, Michele Flammini, Vasco Gallotti, Cosimo Vinci:
On Multidimensional Congestion Games. Algorithms 13(10): 261 (2020) - [j4]Vittorio Bilò, Cosimo Vinci:
The price of anarchy of affine congestion games with similar strategies. Theor. Comput. Sci. 806: 641-654 (2020) - [c16]Alessandro Aloisio, Michele Flammini, Cosimo Vinci:
The Impact of Selfishness in Hypergraph Hedonic Games. AAAI 2020: 1766-1773 - [c15]Vittorio Bilò, Michele Flammini, Cosimo Vinci:
The Quality of Content Publishing in the Digital Era. ECAI 2020: 35-42 - [c14]Michele Flammini, Manuel Mauro, Matteo Tonelli, Cosimo Vinci:
Inequity Aversion Pricing in Multi-Unit Markets. ECAI 2020: 91-98 - [c13]Vittorio Bilò, Cosimo Vinci:
Congestion Games with Priority-Based Scheduling. SAGT 2020: 67-82 - [c12]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 - [c11]Vittorio Bilò, Gianpiero Monaco, Luca Moscardelli, Cosimo Vinci:
Nash Social Welfare in Selfish and Online Load Balancing. WINE 2020: 323-337 - [i5]Gianlorenzo D'Angelo, Debashmita Poddar, Cosimo Vinci:
Better Bounds on the Adaptivity Gap of Influence Maximization under Full-adoption Feedback. CoRR abs/2006.15374 (2020) - [i4]Vittorio Bilò, Gianpiero Monaco, Luca Moscardelli, Cosimo Vinci:
Nash Social Welfare in Selfish and Online Load Balancing. CoRR abs/2007.08263 (2020) - [i3]Gianlorenzo D'Angelo, Debashmita Poddar, Cosimo Vinci:
Improved Approximation Factor for Adaptive Influence Maximization via Simple Greedy Strategies. CoRR abs/2007.09065 (2020) - [i2]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
- [j3]Vittorio Bilò, Cosimo Vinci:
On Stackelberg Strategies in Affine Congestion Games. Theory Comput. Syst. 63(6): 1228-1249 (2019) - [j2]Cosimo Vinci:
Non-atomic one-round walks in congestion games. Theor. Comput. Sci. 764: 61-79 (2019) - [j1]Vittorio Bilò, Cosimo Vinci:
Dynamic Taxes for Polynomial Congestion Games. ACM Trans. Economics and Comput. 7(3): 15:1-15:36 (2019) - [c10]Cosimo Vinci:
Coping with Selfishness in Congestion Games (text not included). ICTCS 2019 - [c9]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 - 2018
- [c8]Vittorio Bilò, Luca Moscardelli, Cosimo Vinci:
Uniform Mixed Equilibria in Network Congestion Games with Link Failures. ICALP 2018: 146:1-146:14 - [c7]Vittorio Bilò, Cosimo Vinci:
The Price of Anarchy of Affine Congestion Games with Similar Strategies. ICTCS 2018: 48-59 - [i1]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
- [c6]Vittorio Bilò, Cosimo Vinci:
On the Impact of Singleton Strategies in Congestion Games. ESA 2017: 17:1-17:14 - [c5]Ioannis Caragiannis, Vasilis Gkatzelis, Cosimo Vinci:
Coordination Mechanisms, Cost-Sharing, and Approximation Algorithms for Scheduling. WINE 2017: 74-87 - 2016
- [c4]Cosimo Vinci:
Non-Atomic One-Round Walks in Polynomial Congestion Games. ICTCS 2016: 11-22 - [c3]Vittorio Bilò, Cosimo Vinci:
Dynamic Taxes for Polynomial Congestion Games. EC 2016: 839-856 - 2015
- [c2]Vittorio Bilò, Cosimo Vinci:
On Stackelberg Strategies in Affine Congestion Games. WINE 2015: 132-145 - 2014
- [c1]Cosimo Vinci, Vittorio Bilò:
On the Stackelberg fuel pricing problem. ICTCS 2014: 213-224
Coauthor Index
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).
load content from web.archive.org
Privacy notice: By enabling the option above, your browser will contact the API of web.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 2023-03-12 03:02 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:
