Journal article
Matching with semi-bandits
- Abstract:
-
We consider an experimental setting in which a matching of resources to participants has to be chosen repeatedly and returns from the individual chosen matches are unknown, but can be learned. Our setting covers two-sided and one-sided matching with (potentially complex) capacity constraints, such as refugee resettlement, social housing allocation, and foster care. We propose a variant of the Thompson sampling algorithm to solve such adaptive combinatorial allocation problems. We give a tight...
Expand abstract
- Publication status:
- Published
- Peer review status:
- Peer reviewed
Actions
Access Document
- Files:
-
-
(Preview, Version of record, pdf, 1.3MB, Terms of use)
-
- Publisher copy:
- 10.1093/ectj/utac021
Authors
Funding
Bibliographic Details
- Publisher:
- Oxford University Press
- Journal:
- Econometrics Journal More from this journal
- Volume:
- 26
- Issue:
- 1
- Pages:
- 45–66
- Publication date:
- 2022-09-26
- Acceptance date:
- 2022-04-08
- DOI:
- EISSN:
-
1368-423X
- ISSN:
-
1368-4221
Item Description
- Language:
-
English
- Keywords:
- Pubs id:
-
1260676
- Local pid:
-
pubs:1260676
- Deposit date:
-
2022-05-24
Terms of use
- Copyright holder:
- Kasy and Teytelboym
- Copyright date:
- 2022
- Rights statement:
- © The Author(s) 2022. Published by Oxford University Press on behalf of Royal Economic Society. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0/), which permits unrestricted reuse, distribution, and reproduction in any medium, provided the original work is properly cited.
- Licence:
- CC Attribution (CC BY)
Metrics
If you are the owner of this record, you can report an update to it here: Report update to this record