Jugal Garg
14 papers · 2019–2026 · 2 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 ↓+3 more ↓ Show less ↑
π Interdisciplinary Bridge Β· Silver π Conference Polyglot Β· Bronze π Academic Marathon Β· Sprint πΊοΈ Taxonomy Completionist (11) π Keyword Champion (6)
π§¬
Topic Evolution
π₯
Unstoppable Β· Bronze
π
Century Club Β· Bronze
Top co-authors
Research topics
Keywords
fair division
(8)
pareto optimality
(6)
fair allocation
(5)
approximation algorithm
(5)
maximin share
(4)
indivisible chore
(4)
indivisible good
(3)
envy-freeness up to one item
(3)
resource allocation
(2)
envy-freeness up to any item
(2)
additive disutility
(2)
strategyproof mechanism
(1)
nash social welfare
(1)
scheduling algorithm
(1)
market equilibrium
(1)
proportional fairness
(1)
subadditive valuation
(1)
truthful mechanism
(1)
proportional allocation
(1)
envy-free allocation
(1)
Papers
Designing Truthful Mechanisms for Asymptotic Fair Division
AAAI 2026
Existence of 2-EFX Allocations of Chores
AAAI 2026
Improved Maximin Share Approximations for Chores by Bin Packing
AAAI 2025
Improved MMS Approximations for Few Agent Types
IJCAI 2025
Proportionally Fair Makespan Approximation
AAAI 2025
Weighted EF1 and PO Allocations with Few Types of Agents or Chores
IJCAI 2024
Fair and Efficient Allocation of Indivisible Chores with Surplus
IJCAI 2023
New Algorithms for the Fair and Efficient Allocation of Indivisible Chores
IJCAI 2023
New Fairness Concepts for Allocating Indivisible Items
IJCAI 2023
Simplification and Improvement of MMS Approximation
IJCAI 2023
Fair and Efficient Allocations of Chores under Bivalued Preferences
AAAI 2022
Fair and Efficient Allocations under Subadditive Valuations
AAAI 2021
On Fair and Efficient Allocations of Indivisible Goods
AAAI 2021
Improving Nash Social Welfare Approximations
IJCAI 2019