No article text was recorded for this version.
computational complexity of Nash Welfare
Version 1 of 137 papers41 conceptsfrozen 2026-10-04
Papers in this version
- Blog: On Optimal Tradeoffs between EFX and Nash Welfare
- Blog: Constrained Fair and Efficient Allocations
- Blog: Fairness Towards Groups of Agents in the Allocation of Indivisible Items
- Blog: Reconciling Selfish Routing with Social Good
- Blog: A polynomial-time algorithm for computing a Pareto optimal and almost proportional allocation
- Blog: The Power of Verification for Greedy Mechanism Design
- Blog: Fair Division: The Computer Scientist's Perspective
- Blog: Subsidy Allocations in the Presence of Income Shocks
- Blog: To Give or Not to Give: Fair Division for Single Minded Valuations
- Blog: Computing Lindahl Equilibrium with and without Funding Caps
- Blog: Fair and Efficient Cake Division with Connected Pieces
- Blog: Maximum Nash Welfare and Other Stories About EFX
- Blog: Greedy Algorithms for Maximizing Nash Social Welfare
- Blog: Achieving Envy-freeness and Equitability with Monetary Transfers
- Blog: Computing Socially-Efficient Cake Divisions
- Blog: OWA for Bipartite Assignments
- Blog: Computing Fair Utilitarian Allocations of Indivisible Goods
- Blog: An Efficient Algorithm for Fair Multi-Agent Multi-Armed Bandit with Low Regret
- Blog: Combinatorial Auctions Do Need Modest Interaction
- Blog: On Improving Resource Allocations by Sharing
- Blog: APX-Hardness of Maximizing Nash Social Welfare with Indivisible Items
- Blog: Optimal Provision-After-Wait in Healthcare
- Blog: Fair Knapsack
- Blog: The Parameterized Complexity of Welfare Guarantees in Schelling Segregation
- Blog: On the Hardness of Fair Allocation under Ternary Valuations
- Blog: Finding Fair and Efficient Allocations
- Blog: On Fair Division for Indivisible Items
- Blog: Almost Envy-freeness, Envy-rank, and Nash Social Welfare Matchings
- Blog: Fair Division of Indivisible Goods for a Class of Concave Valuations
- Blog: EFX Feasible Scheduling for Time-dependent Resources
- Blog: Tractable Fragments of the Maximum Nash Welfare Problem
- Blog: Satiation in Fisher Markets and Approximation of Nash Social Welfare
- Blog: Online Nash Social Welfare Maximization with Predictions
- Blog: Welfare of Sequential Allocation Mechanisms for Indivisible Goods
- Blog: On fair price discrimination in multi-unit markets
- Blog: Welfare Maximization in Fractional Hedonic Games
- Blog: Welfare Maximization in Perpetual Voting (Student Abstract)
History & citation
Current · Permanent link
- This direction split from The Computational Boundaries of Fair Resource Allocation (95% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_computational_complexity_of_nash_welfare_915a144e,
title = {computational complexity of Nash Welfare},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/computational-complexity-of-nash-welfare/rdr_915a144e17f74598a98b34717afc9e30},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-19},
}This exact version (version 1, frozen text):
@misc{lacuna_computational_complexity_of_nash_welfare_915a144e_v1,
title = {computational complexity of Nash Welfare},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/computational-complexity-of-nash-welfare/rdr_915a144e17f74598a98b34717afc9e30/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-19},
}