Alkis Kalavasis

Also affiliated with The University of Texas at Austin

Computer ScienceMathematics

Pilot corpus only

This score is computed over theSindex pilot corpus and does not cover the full scientific literature. Scores are relative to papers we have ingested — papers, authors, and institutions outside the pilot are not represented. Methodology.

Top 100%percentile

0Author DataRank

Indexed papers

0in pilot corpus

datarank_citation_only_1hop_v6· scope data_onlyMethodology

Papers

Driven by 3 papers. Top paper: “On the Complexity of Computing Sparse Equilibria and Lower Bounds for No-Regret Learning in Games”.

On the Complexity of Computing Sparse Equilibria and Lower Bounds for No-Regret Learning in Games

arXiv (Cornell University)(2023)10.48550/arxiv.2311.14869

N/A

0DataRank · unranked

0 citations

Alkis Kalavasis, Tüomas Sandholm, Manolis Zampetakis, Ioannis Anagnostides

Barriers to Welfare Maximization with No-Regret Learning

arXiv (Cornell University)(2024)10.48550/arxiv.2411.01720

N/A

0DataRank · unranked

0 citations

Alkis Kalavasis, Tüomas Sandholm, Ioannis Anagnostides

Computational Lower Bounds for Regret Minimization in Normal-Form Games

arXiv (Cornell University)(2024)10.48550/arxiv.2411.01721

N/A

0DataRank · unranked

0 citations

Alkis Kalavasis, Tüomas Sandholm, Ioannis Anagnostides