arXiv (All)
open access
Polynomial Algorithms for Simultaneous Share-Based and Envy-Based Guarantees
We study the simultaneous achievement of share-based and envy-based fairness in the allocation of indivisible goods with nonnegative additive valuations. The AnyPrice share (APS) is a strengthening of the maximin share (MMS). A polynomial-time algorithm is known to guarantee a $2n/(3n-1)$ approximat
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
- Improved Impossibility Bounds for Maximin Share Allocations#1084972
- Non-Existence of PMMS Allocations and a $4/3$-PMMS Guarantee for Additive Chores#997365
- Best-of-Both-Worlds Fair Division via Subsidies#1325890
- Introspectively Envy-Free and Efficient Allocation of Indivisible Mixed Manna#1355542
- Maximin share allocations for two types of items#1344922
Record · ID 1326687
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