default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndrea Collevecchio
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i6]Andrea Collevecchio, Tuan-Minh Nguyen
, Ziwen Zhong:
Finding pure Nash equilibria in large random games. CoRR abs/2406.09732 (2024)- [i5]Andrea Collevecchio, Hlafo Alfie Mimun, Matteo Quattropani, Marco Scarsini:
Basins of Attraction in Two-Player Random Ordinal Potential Games. CoRR abs/2407.05460 (2024) - 2021
- [j5]Ben Amiet, Andrea Collevecchio, Marco Scarsini, Ziwen Zhong:
Pure Nash Equilibria and Best-Response Dynamics in Random Games. Math. Oper. Res. 46(4): 1552-1572 (2021) - [j4]Ben Amiet, Andrea Collevecchio, Kais Hamza:
When "Better" is better than "Best". Oper. Res. Lett. 49(2): 260-264 (2021) - 2020
- [i4]Ben Amiet, Andrea Collevecchio, Kais Hamza:
When "Better" is better than "Best". CoRR abs/2011.00239 (2020)
2010 – 2019
- 2019
- [i3]Ben Amiet, Andrea Collevecchio, Marco Scarsini:
Pure Nash Equilibria and Best-Response Dynamics in Random Games. CoRR abs/1905.10758 (2019) - 2017
- [j3]Hüseyin Acan, Andrea Collevecchio, Abbas Mehrabian, Nick Wormald:
On the Push&Pull Protocol for Rumor Spreading. SIAM J. Discret. Math. 31(2): 647-668 (2017) - 2016
- [j2]Andrea Collevecchio, Abbas Mehrabian, Nick Wormald:
Longest paths in random Apollonian networks and largest r-ary subtrees of random d-ary recursive trees. J. Appl. Probab. 53(3): 846-856 (2016) - 2015
- [c1]Hüseyin Acan, Andrea Collevecchio, Abbas Mehrabian, Nick Wormald:
On the Push&Pull Protocol for Rumour Spreading: [Extended Abstract]. PODC 2015: 405-412 - 2014
- [i2]Andrea Collevecchio, Timothy M. Garoni, Timothy Hyndman, Daniel Tokarev:
The worm algorithm for the Ising model is rapidly mixing. CoRR abs/1409.4484 (2014) - [i1]Hüseyin Acan, Andrea Collevecchio, Abbas Mehrabian, Nick Wormald:
On the push&pull protocol for rumour spreading. CoRR abs/1411.0948 (2014) - 2012
- [j1]Andrea Collevecchio, Marco LiCalzi:
The probability of nontrivial common knowledge. Games Econ. Behav. 76(2): 556-570 (2012)
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).
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-04 03:17 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:
