Stable Menus of Public Goods: A Matching Problem
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , |
|---|---|
| Format: | Preprint |
| Publié: |
2024
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866910992548495360 |
|---|---|
| author | Fish, Sara Gonczarowski, Yannai A. Hart, Sergiu |
| author_facet | Fish, Sara Gonczarowski, Yannai A. Hart, Sergiu |
| contents | We study a matching problem between agents and public goods, in settings without monetary transfers. Since goods are public, they have no capacity constraints. There is no exogenously defined budget of goods to be provided. Rather, each provided good must justify its cost by being utilized by sufficiently many agents, leading to strong complementarities in the "preferences" of goods. Furthermore, goods that are in high demand given other already-provided goods must also be provided. The question of the existence of a stable solution (a menu of public goods to be provided) exhibits a rich combinatorial structure. We uncover sufficient conditions and necessary conditions for guaranteeing the existence of a stable solution, and derive both positive and negative results for strategyproof stable matching. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2402_11370 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Stable Menus of Public Goods: A Matching Problem Fish, Sara Gonczarowski, Yannai A. Hart, Sergiu Computer Science and Game Theory Theoretical Economics Combinatorics We study a matching problem between agents and public goods, in settings without monetary transfers. Since goods are public, they have no capacity constraints. There is no exogenously defined budget of goods to be provided. Rather, each provided good must justify its cost by being utilized by sufficiently many agents, leading to strong complementarities in the "preferences" of goods. Furthermore, goods that are in high demand given other already-provided goods must also be provided. The question of the existence of a stable solution (a menu of public goods to be provided) exhibits a rich combinatorial structure. We uncover sufficient conditions and necessary conditions for guaranteeing the existence of a stable solution, and derive both positive and negative results for strategyproof stable matching. |
| title | Stable Menus of Public Goods: A Matching Problem |
| topic | Computer Science and Game Theory Theoretical Economics Combinatorics |
| url | https://arxiv.org/abs/2402.11370 |