arXiv (All)
open access
Asymptotic Max-Min Fair Allocation with Random Utilities
We investigate the asymptotic behavior of max-min fair allocations for indivisible goods under i.i.d. random utilities. For $N$ agents and $K$ goods with utilities ${\mU_{i,j}}$ drawn independently from a common distribution $F$, we derive asymptotic characterizations of the max-min value in the bal
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 best of both worlds allocations with subadditive valuations#1118300
- Fair Division Under Boolean Valuations: Beyond Normalization#790257
- Fair Share Allocations for Almost All Agents#1117946
- Multi-Principal Competition for an Exclusive Agent: characterization and approximation of Nash Equilibria#927716
- Subquadratic Subsidies for Nonnegative or Nonpositive Valuations#985643
Record · ID 1013916
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