Co-occurring keywords · papers mentioning both
Papers
Weighted Envy-Freeness for Submodular Valuations
AAAI 2024
Approximate Envy-Freeness in Graphical Cake Cutting
IJCAI 2023
Fair Allocation of Indivisible Chores: Beyond Additive Costs
NeurIPS 2023
Fairness Concepts for Indivisible Items with Externalities
AAAI 2023
Finding Fair Allocations under Budget Constraints
AAAI 2023
Maximin-Aware Allocations of Indivisible Chores with Symmetric and Asymmetric Agents
IJCAI 2023
Multi-agent Online Scheduling: MMS Allocations for Indivisible Items
ICML 2023
New Fairness Concepts for Allocating Indivisible Items
IJCAI 2023
On Lower Bounds for Maximin Share Guarantees
IJCAI 2023
Simplification and Improvement of MMS Approximation
IJCAI 2023
Truthful Fair Mechanisms for Allocating Mixed Divisible and Indivisible Goods
IJCAI 2023
An EF2X Allocation Protocol for Restricted Additive Valuations
IJCAI 2022
Fair and Efficient Allocations of Chores under Bivalued Preferences
AAAI 2022
Fair and Truthful Giveaway Lotteries
AAAI 2022
Improved Maximin Guarantees for Subadditive and Fractionally Subadditive Fair Allocation Problem
AAAI 2022
I Will Have Order! Optimizing Orders for Fair Reviewer Assignment
IJCAI 2022
Nonstationary Dual Averaging and Online Fair Allocation
NeurIPS 2022
Optimal Efficiency-Envy Trade-Off via Optimal Transport
NeurIPS 2022
Socially Fair Mitigation of Misinformation on Social Networks via Constraint Stochastic Optimization
AAAI 2022
Truthful Cake Sharing
AAAI 2022
Universal and Tight Online Algorithms for Generalized-Mean Welfare
AAAI 2022
Weighted Fairness Notions for Indivisible Items Revisited
AAAI 2022
Budget-feasible Maximum Nash Social Welfare is Almost Envy-free
IJCAI 2021
Facility’s Perspective to Fair Facility Location Problems
AAAI 2021
Fair and Efficient Allocations under Lexicographic Preferences
AAAI 2021