Alexandros Hollender
6 papers · 2020–2025 · 5 venues · across top CS/AI venues
Authors are matched by name, so researchers who share a name ("Yang Liu", "Wei Wang") appear as a single profile and their paper counts, venues and achievements are combined. How identity is handled.
Achievements
Jump to papers ↓
๐
Conference Polyglot ยท Silver
๐
Academic Marathon ยท Sprint
๐
Interdisciplinary Bridge ยท Bronze
๐บ๏ธ
Taxonomy Completionist
(15)
Venues
Top co-authors
Research topics
Keywords
nash equilibrium
(2)
game theory
(2)
envy-free allocation
(2)
fair allocation
(2)
multi-agent learning
(1)
resource allocation
(1)
query complexity
(1)
learning algorithm
(1)
approximation algorithm
(1)
zero-sum game
(1)
stationary point
(1)
stackelberg game
(1)
min-max optimization
(1)
fair division
(1)
cake cutting
(1)
indivisible good
(1)
efx allocation
(1)
nash welfare
(1)
complexity theory
(1)
polymatrix game
(1)
Papers
The Complexity of Two-Team Polymatrix Games with Independent Adversaries
ICLR 2025
The Computational Complexity of Finding Stationary Points in Non-Convex Optimization
COLT 2023
Tight Inapproximability for Graphical Games
AAAI 2023
Contiguous Cake Cutting: Hardness Results and Approximation Algorithms
AAAI 2020
Maximum Nash Welfare and Other Stories About EFX
IJCAI 2020
Optimally Deceiving a Learning Leader in Stackelberg Games
NeurIPS 2020