arXiv (All)
open access
An FPTAS for 7/9-Approximation to Maximin Share Allocations
We present a new algorithm that achieves a $\frac{7}{9}$-approximation for the \emph{maximin share (MMS)} allocation of indivisible goods under additive valuations, improving the current best ratio of $\frac{10}{13}$~\cite{conf/soda/HeidariKSS26}. Building on a new analytical framework, we further o
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
- Exact MMS Allocations under Personalized Bivalued Valuations: Goods and Chores#616957
- Exact MMS Allocations under Personalized Bivalued Valuations: Goods and Chores#616457
- An Algorithm-to-Contract Framework without Demand Queries#1084044
- On Justification, Idealization, and Discursive Purchase#95970
- BACI-VI-Bench: A dataset of variational inequality benchmark instances for multi-agent trade-network equilibrium.#334768
Record · ID 974264
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