arXiv (All)
open access
Fair and Efficient Allocations: Decision Problems in the Gap of Polynomial Hierarchy
We consider the fair division problem with indivisible goods and study the following decision problem: given a fair division instance, does there exist an allocation that is envy-free and efficient? We consider two efficiency criteria: Pareto-optimality and social welfare optimality. We provide a co
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Non-Existence of PMMS Allocations and a $4/3$-PMMS Guarantee for Additive Chores#997365
- Weighted Fair Division of Indivisible Mixed Manna#971885
- EF1-Constrained Nash Social Welfare with Identical Additive Valuations: Complexity, Guarantees, and Experiments#1084368
- Reconfiguration in Fair Division Revisited#1109380
- Fair Stable Matching: A Nash Social Welfare Approach#632893
Record · ID 1115805
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive