arXiv (All)
open access
Equilibria of Round-Robin: Computational Hardness and Fairness for Few Subadditive Agents
The round-robin procedure is a simple and well-studied fair division mechanism where agents pick goods in turns. Motivated by draft mechanisms in sports leagues, we investigate strategic behaviour in online round-robin for subadditive agents. This gives rise to an extensive-form game, and we study t
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
- Procedural Fairness in Exchange Matching Systems#98615
- Rule-Based Pricing Algorithms and Market Outcomes: An Experimental Study#1063072
- Cognitive constraints govern collective outcomes in strategic network formation#1167874
- Cognitive constraints govern collective outcomes in strategic network formation#1148190
- Comparison of Deterministic Information Providers#1012871
Record · ID 1012501
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