◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

A. Collevecchio

34 papers hereh-index 12409 citations47 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • sole author2
  • first author25
  • middle author6
  • last author1

Across the 34 of 34 papers where every author was matched, so the position is known.

fields
  • math.PR27
  • cs.GT3
  • math-ph2
  • cs.DC1
  • econ.TH1

identity via Semantic Scholar / OpenAlex

activity
20062025
most citedOn a preferential attachment and generalized Pólya's urn model

37 citations · 126 across the 31 of their papers we have counts for

collaborators
Showing 2025 · cs.GTShow all

1 paper · 2 filters

cs.GT2025

Finding a Nash equilibrium of a random win-lose game in expected polynomial time

Andrea Collevecchio, Gabor Lugosi, Adrian Vetta +1

A long-standing open problem in algorithmic game theory asks whether or not there is a polynomial time algorithm to compute a Nash equilibrium in a random bimatrix game. We study r…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.