arXiv (OAI Expanded)
open access
Fair Division Under Boolean Valuations: Beyond Normalization
We study fair division of indivisible items when agents have arbitrary two-level preferences: the value of each agent for any set of items is Boolean, which need not be monotone or additive. Notably, we do not impose the standard assumption of normalization, i.e., different agents may value the empt
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
- Maximin Share Allocations Beyond Weakly Lexicographic Valuations#1154782
- Fair Share Allocations for Almost All Agents#1117946
- Reconfiguration in Fair Division Revisited#1109380
- Asymptotic Max-Min Fair Allocation with Random Utilities#1013916
- A Note on EFX Inapproximability for Chores#1155208
Record · ID 790257
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