.png){kind=icon}
.png){kind=icon}
Return
Booster draft mechanisms for multi-object assignment
.png){kind=icon}
OA
AI
DOI：10.1007/s00182-026-00981-7.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We describe a new class of mechanisms-referred to as booster draft mechanisms-for allocating \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$n\times m$$\end{document} indivisible objects among n individuals with responsive preferences. Specifically, n individuals are assigned m objects each, from m different sets of size n-called boosters-and simply receive their highest ranked object, among the remaining objects in each booster, when it is their turn to choose. We contrast booster draft mechanisms with two well-known alternatives: serial dictatorship and draft mechanisms. Our results suggest that booster draft mechanisms pose a viable alternative for resolving multi-object assignment problems.
Keywords:
Matching
Booster draft
Envy-free
Multi-object assignment
D47
C78
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
I
IF:
0.4
Papers:
40
Citations:
0