arXiv (All)
open access
Fair Allocation with Dichotomous Preferences over Item Complements
We study the problem of fair allocation when agents have dichotomous submodular preferences over groups of, rather than individual, items. These preferences naturally extend existing models, and have a natural interpretation in settings such as course allocation. We show that this seemingly minor ex
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
- Problems for pure probabilism about promotion (and a disjunctive alternative)#89268
- Rule Underdetermination and the Non-Existence of Sharp Boundaries in Vague Predicates#721795
- Predictive Priority Shapes Human Statistical Learning in Multi-Regularity Environments#637575
- Predictive Priority Shapes Human Statistical Learning in Multi-Regularity Environments#637114
- A first-order coalition logic for BDI-agents#167793
Record · ID 1327051
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