Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2021
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2110.14865 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866929330536316928 |
|---|---|
| author | Ashlagi, Itai Kang, Jamie Koren, Moran Monachou, Faidra |
| author_facet | Ashlagi, Itai Kang, Jamie Koren, Moran Monachou, Faidra |
| contents | This paper considers the problem of offering a scarce object with a common unobserved quality to strategic agents in a priority queue. Each agent has a private signal over the quality of the object and observes the decisions made by other agents. We first show that, under the widely-used first-come-first-served sequential offering mechanism, herding behavior emerges: initial rejections create an information cascade resulting in inefficient waste. To address this issue, we then introduce a class of batching mechanisms. Agents in each batch report whether they would be willing to accept or reject the object based on their private signals and prior information. If the majority opts to accept, the object is randomly allocated within that batch. We prove that suitable batching mechanisms are incentive-compatible and improve efficiency. A key property of the mechanism is the gradual increase of the batch size after each failed allocation; the size is chosen so that it elicits as much information as possible without distorting the incentives of agents to report truthfully. Additionally, from a healthcare policy perspective, our results can shed light on the large wastage in organ allocation. In particular, wastage that arises due to herding may be reduced by applying adaptive simultaneous offering mechanisms. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2110_14865 |
| institution | arXiv |
| publishDate | 2021 |
| record_format | arxiv |
| spellingShingle | Counterbalancing Learning and Strategic Incentives in Allocation Markets Ashlagi, Itai Kang, Jamie Koren, Moran Monachou, Faidra Computer Science and Game Theory This paper considers the problem of offering a scarce object with a common unobserved quality to strategic agents in a priority queue. Each agent has a private signal over the quality of the object and observes the decisions made by other agents. We first show that, under the widely-used first-come-first-served sequential offering mechanism, herding behavior emerges: initial rejections create an information cascade resulting in inefficient waste. To address this issue, we then introduce a class of batching mechanisms. Agents in each batch report whether they would be willing to accept or reject the object based on their private signals and prior information. If the majority opts to accept, the object is randomly allocated within that batch. We prove that suitable batching mechanisms are incentive-compatible and improve efficiency. A key property of the mechanism is the gradual increase of the batch size after each failed allocation; the size is chosen so that it elicits as much information as possible without distorting the incentives of agents to report truthfully. Additionally, from a healthcare policy perspective, our results can shed light on the large wastage in organ allocation. In particular, wastage that arises due to herding may be reduced by applying adaptive simultaneous offering mechanisms. |
| title | Counterbalancing Learning and Strategic Incentives in Allocation Markets |
| topic | Computer Science and Game Theory |
| url | https://arxiv.org/abs/2110.14865 |