Co-occurring keywords · papers mentioning both
Papers
Fair and Efficient Allocations under Subadditive Valuations
AAAI 2021
Fair and Efficient Online Allocations with Normalized Valuations
AAAI 2021
Improving Multi-agent Coordination by Learning to Estimate Contention
IJCAI 2021
Nash Welfare in the Facility Location Problem
IJCAI 2021
On Fair and Efficient Allocations of Indivisible Goods
AAAI 2021
On the PTAS for Maximin Shares in an Indivisible Mixed Manna
AAAI 2021
PeerReview4All: Fair and Accurate Reviewer Assignment in Peer Review
JMLR 2021
PROPm Allocations of Indivisible Goods to Multiple Agents
IJCAI 2021
Contiguous Cake Cutting: Hardness Results and Approximation Algorithms
AAAI 2020
Group-Fair Online Allocation in Continuous Time
NeurIPS 2020
Maximum Nash Welfare and Other Stories About EFX
IJCAI 2020
On the Max-Min Fair Stochastic Allocation of Indivisible Goods
AAAI 2020
The Complexity of Computing Maximin Share Allocations on Graphs
AAAI 2020
Themis: Fair and Efficient GPU Cluster Scheduling
NSDI 2020
Almost Envy-Freeness in Group Resource Allocation
IJCAI 2019
Fair Allocation of Indivisible Goods and Chores
IJCAI 2019
Fair and Efficient Memory Sharing: Confronting Free Riders
AAAI 2019
Fair Knapsack
AAAI 2019
Fairly Allocating Many Goods with Few Queries
AAAI 2019
Matroid Constrained Fair Allocation Problem
AAAI 2019
Strategyproof and Approximately Maxmin Fair Share Allocation of Chores
IJCAI 2019
The Price of Fairness for Indivisible Goods
IJCAI 2019
Algorithms for Fair Load Shedding in Developing Countries
IJCAI 2018
Democratic Fair Allocation of Indivisible Goods
IJCAI 2018
Strategyproof and Fair Matching Mechanism for Union of Symmetric M-convex Constraints
IJCAI 2018