No article text was recorded for this version.
binary valuation simplification
Version 1 of 129 papers36 conceptsfrozen 2026-10-04
Papers in this version
- Blog: On Fair and Efficient Allocations of Indivisible Goods
- Blog: Fair and Efficient Chore Allocation: Existence and Computation
- Blog: Strategyproof Mechanisms for Activity Scheduling
- Blog: Fair and Efficient Allocations of Chores under Bivalued Preferences
- Blog: Fair Division with Binary Valuations: One Rule to Rule Them All
- Blog: The Complexity of Fair Division of Indivisible Items with Externalities
- Blog: Computing Pareto-Optimal and Almost Envy-Free Allocations of Indivisible Goods
- Blog: On the Existence of EFX (and Pareto-Optimal) Allocations for Binary Chores
- Blog: Equitable Allocations of Indivisible Goods
- Blog: Computing Efficient Envy-Free Partial Allocations of Indivisible Goods
- Blog: Approximately EFX Allocations for Indivisible Chores
- Blog: Greedy Algorithms for Maximizing Nash Social Welfare
- Blog: Uniform Welfare Guarantees Under Identical Subadditive Valuations
- Blog: How to Fairly Allocate Easy and Difficult Chores
- Blog: Approximately EFX and fPO Allocations for Bivalued Chores
- Blog: Complexity Results and Exact Algorithms for Fair Division of Indivisible Items: A Survey
- Blog: Fairness Towards Groups of Agents in the Allocation of Indivisible Items
- Blog: Maximizing Nash Social Welfare under Two-Sided Preferences
- Blog: Weighted Maxmin Fair Share Allocation of Indivisible Chores
- Blog: Fair assignment of indivisible objects under ordinal preferences
- Blog: Competitive Equilibrium with Equal Incomes for Allocation of Indivisible Objects
- Blog: Weighted EF1 and PO Allocations with Few Types of Agents or Chores
- Blog: Tractable Fragments of the Maximum Nash Welfare Problem
- Blog: On Maximum Weighted Nash Welfare for Binary Valuations
- Blog: Expanding the Reach of Social Choice Theory
- Blog: Fair Division via the Cake-Cutting Share
- Blog: Welfare of Sequential Allocation Mechanisms for Indivisible Goods
- Blog: How to Cut a Discrete Cake Fairly
- Blog: On Fair Division under Heterogeneous Matroid Constraints
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_binary_valuation_simplification_880a939b,
title = {binary valuation simplification},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/binary-valuation-simplification/rdr_880a939b942d441c81d04b6bad344ad3},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-21},
}This exact version (version 1, frozen text):
@misc{lacuna_binary_valuation_simplification_880a939b_v1,
title = {binary valuation simplification},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/binary-valuation-simplification/rdr_880a939b942d441c81d04b6bad344ad3/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-21},
}