Georgios Amanatidis
10 papers · 2016–2022 · 4 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 ↓+1 more ↓ Show less ↑
🌍 Conference Polyglot · Bronze 🏃 Academic Marathon · Sprint 🌉 Interdisciplinary Bridge · Silver 🗺️ Taxonomy Completionist (16) 🧭 Keyword Pioneer
💎
Century Club · Bronze
Venues
Top co-authors
Research topics
Keywords
indivisible good
(4)
fair division
(4)
approximation algorithm
(4)
combinatorial optimization
(3)
game theory
(3)
social welfare
(3)
maximin share
(2)
query complexity
(2)
resource allocation
(2)
submodular maximization
(2)
mechanism design
(2)
ordinal preference
(2)
knapsack constraint
(2)
envy-free allocation
(2)
parallel computation
(1)
combinatorial algorithm
(1)
nash welfare
(1)
fair allocation
(1)
efx allocation
(1)
greedy algorithm
(1)
Papers
Don't Roll the Dice, Ask Twice: The Two-Query Distortion of Matching Problems and Beyond
NeurIPS 2022
Fair Division of Indivisible Goods: A Survey
IJCAI 2022
A Few Queries Go a Long Way: Information-Distortion Tradeoffs in Matching
AAAI 2021
Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity
ICML 2021
Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint
NeurIPS 2020
Maximum Nash Welfare and Other Stories About EFX
IJCAI 2020
Multiple Birds with One Stone: Beating 1/2 for EFX and GMMS via Envy Cycle Elimination
AAAI 2020
Peeking Behind the Ordinal Curtain: Improving Distortion via Cardinal Queries
AAAI 2020
Comparing Approximate Relaxations of Envy-Freeness
IJCAI 2018
On Truthful Mechanisms for Maximin Share Allocations
IJCAI 2016