No article text was recorded for this version.
Pareto optimal fair division
Version 1 of 139 papers40 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Fair Allocation of Indivisible Goods and Chores
- Blog: Achieving Proportionality up to the Maximin Item with Indivisible Goods
- Blog: Fair and Efficient Allocations under Lexicographic Preferences
- Blog: Simultaneous Approximation of Multi-criteria Submodular Function Maximization
- Blog: Equitable Allocations of Indivisible Goods
- Blog: A framework for fair decision-making over time with time-invariant utilities
- Blog: Guaranteeing Envy-Freeness under Generalized Assignment Constraints
- Blog: A polynomial-time algorithm for computing a Pareto optimal and almost proportional allocation
- Blog: Fair and Efficient Chore Allocation: Existence and Computation
- Blog: Online Envy Minimization and Multicolor Discrepancy: Equivalences and Separations
- Blog: On the Complexity of Pareto-Optimal and Envy-Free Lotteries
- Blog: When is Truthfully Allocating Chores no Harder than Goods?
- Blog: Approximately EFX Allocations for Indivisible Chores
- Blog: High-Multiplicity Fair Allocation Made More Practical
- Blog: Fair Allocation of Two Types of Chores
- Blog: Equitable Mechanism Design for Facility Location
- Blog: (Almost) Envy-Free, Proportional and Efficient Allocations of an Indivisible Mixed Manna
- Blog: Distributed Learning in the Presence of Disturbances
- Blog: Distribution of Chores with Information Asymmetry
- Blog: Weighted EF1 and PO Allocations with Few Types of Agents or Chores
- Blog: Allocating Mixed Goods with Customized Fairness and Indivisibility Ratio
- Blog: Maxileximin Envy Allocations and Connected Goods
- Blog: Achieving a Fairer Future by Changing the Past
- Blog: Fair Division of Indivisible Chores via Earning Restricted Equilibria
- Blog: Weighted Fairness Notions for Indivisible Items Revisited
- Blog: New Algorithms for the Fair and Efficient Allocation of Indivisible Chores
- Blog: Efficiency and envy-freeness in fair division of indivisible goods: logical representation and complexity
- Blog: PROPm Allocations of Indivisible Goods to Multiple Agents
- Blog: Fairly Dividing Mixtures of Goods and Chores under Lexicographic Preferences
- Blog: New Fairness Concepts for Allocating Indivisible Items
- Blog: High-Multiplicity Fair Allocation Using Parametric Integer Linear Programming
- Blog: Towards Return Parity in Markov Decision Processes
- Blog: The Complexity of Fair Division of Indivisible Items with Externalities
- Blog: Fairly Allocating (Contiguous) Dynamic Indivisible Items with Few Adjustments
- Blog: Indivisible Mixed Manna: On the Computability of MMS+PO Allocations
- Blog: Epistemic EFX Allocations Exist for Monotone Valuations
- Blog: An Efficient Protocol for Negotiation over Combinatorial Domains with Incomplete Information
- Blog: Computing Pareto-Optimal and Almost Envy-Free Allocations of Indivisible Goods
- Blog: Almost (Weighted) Proportional Allocations for Indivisible Chores✱✱
History & citation
Current · Permanent link
- This direction split from Reconciling Fairness and Efficiency in Indivisible Resource Allocation (82% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_pareto_optimal_fair_division_57f9141a,
title = {Pareto optimal fair division},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/pareto-optimal-fair-division/rdr_57f9141aa58a4f60a0c30fd013eaa00e},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-22},
}This exact version (version 1, frozen text):
@misc{lacuna_pareto_optimal_fair_division_57f9141a_v1,
title = {Pareto optimal fair division},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/pareto-optimal-fair-division/rdr_57f9141aa58a4f60a0c30fd013eaa00e/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-22},
}