Alexandros Hollender
6 papers · 2020–2025 · 5 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+2 more ↓ Show less ↑
π Interdisciplinary Bridge π§ Keyword Pioneer π£ Hot Topic Early Bird π Conference Polyglot (5) π Academic Marathon (5)
π
Cross-Pollinator
(11)
πΊοΈ
Taxonomy Completionist
(11)
Conferences
AAAI (2)
COLT (1)
ICLR (1)
IJCAI (1)
NIPS (1)
Top co-authors
Keywords
game theory
(2)
fair allocation
(2)
envy-free allocation
(2)
constrained optimization
(1)
nash equilibrium
(1)
resource allocation
(1)
query complexity
(1)
learning algorithm
(1)
approximation algorithm
(1)
stationary point
(1)
stackelberg game
(1)
fair division
(1)
cake cutting
(1)
indivisible good
(1)
efx allocation
(1)
nash welfare
(1)
strategic deception
(1)
payoff manipulation
(1)
graphical game
(1)
leader-follower game
(1)
Papers
The Complexity of Two-Team Polymatrix Games with Independent Adversaries
ICLR 2025
Tight Inapproximability for Graphical Games
AAAI 2023
The Computational Complexity of Finding Stationary Points in Non-Convex Optimization
COLT 2023
Optimally Deceiving a Learning Leader in Stackelberg Games
NIPS 2020
Contiguous Cake Cutting: Hardness Results and Approximation Algorithms
AAAI 2020
Maximum Nash Welfare and Other Stories About EFX
IJCAI 2020