Koc University Digital Collections
metadata only
Random assignment under weak preferences
The natural preference domain for many practical settings of the assignment problems is the one in which agents are allowed to be indifferent between objects, the weak preference domain. Most of the existing work on assignment problems assumes strict preferences. There are important exceptions. but
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
- Efficient allocation with ordinal preference intensities#144160
- Generalizable Robotic Insertion with World Models#1064802
- Predictive Priority Shapes Human Statistical Learning in Multi-Regularity Environments#637575
- Predictive Priority Shapes Human Statistical Learning in Multi-Regularity Environments#637114
- The Theory of Behavior - A Fundamental Comprehensive Algorithm for Human Behavior#173718
Record · ID 955128
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