Bibliographic record
Abstract
Maximin share (MMS) allocations are a popular relaxation of envy-free allocations that have received wide attention in the fair division of indivisible items. Although MMS allocations of goods can fail to exist, previous work has found conditions under which they exist. Specifically, MMS allocations of goods exist whenever m ≤ n+5, and this bound is tight in the sense that they can fail to exist when m = n+6. The techniques used to obtain these results do not apply to the mixed manna setting, leaving the question of whether similar results hold for the general setting. This paper addresses this by introducing new techniques to handle these settings. In particular, we are able to answer this question completely for the chores setting, and partially for the mixed manna setting. An agent i is a chores agent if it considers every item to be a chore and a non-negative agent if its MMS guarantee is non-negative. In this paper, we prove that an MMS allocation exists as long as m ≤ n+5 and either (i) every agent is a chores agent, or (ii) there exists a non-negative agent. In addition, for n ≤ 3, we also prove that an MMS allocation exists as long as m ≤ n+5, regardless of the types of agents. To the best of our knowledge, these are the first non-trivial results pertaining to the existence of exact MMS allocations in the mixed manna setting.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".