arXiv (All)
open access
Envy-Free Decompositions of Random Assignments: Settling Four Agents, and What Lies Beyond
A random assignment of n indivisible objects to n agents is specified by its assignment matrix and implemented by drawing a deterministic assignment from a Birkhoff-von Neumann decomposition. Kawase et al. observed that the choice of decomposition matters for fairness: a matrix that is envy-free in
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
- Improved Impossibility Bounds for Maximin Share Allocations#1084972
- Bargaining with Algorithms: An Experiment on Algorithmic Price Discrimination and Consumer and Data Protection Laws#1176847
- Algorithmic Randomness, Exchangeability, and the Principal Principle#694494
- Subgame-Perfect Nash Equilibria of Plurality Voting with Abstention: a PSPACE-Completeness Result for Restricted Ballots#1050473
- The Matroid Secretary Conjecture is True#1084500
Record · ID 1129789
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