arXiv (OAI Expanded)
open access
Improved Impossibility Bounds for Maximin Share Allocations
The maximin share (MMS) is a central fairness benchmark for allocating indivisible items, but it need not be simultaneously attainable even under additive preferences. While extensive work has developed approximation guarantees, quantitative impossibility bounds have received comparatively little at
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
- On the Hardness of Maximin Share Allocations#1109881
- Fair Stable Matching: A Nash Social Welfare Approach#924243
- Fair Stable Matching: A Nash Social Welfare Approach#920012
- Envy-Free Decompositions of Random Assignments: Settling Four Agents, and What Lies Beyond#1129789
- Pairwise Maximin Share Allocations Need Not Exist#973869
Record · ID 1084972
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