Parameterized Voter Relevance in Facility Location Games with Tree-Shaped Invitation Graphs
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909385530277888 |
|---|---|
| author | Ando, Ryoto Kimura, Kei Todo, Taiki Yokoo, Makoto |
| author_facet | Ando, Ryoto Kimura, Kei Todo, Taiki Yokoo, Makoto |
| contents | Diffusion mechanism design, which investigate how to incentivise agents to invite as many colleagues to a multi-agent decision making as possible, is a new research paradigm at the intersection between microeconomics and computer science. In this paper we extend traditional facility location games into the model of diffusion mechanism design. Our objective is to completely understand to what extent of anonymity/voter-relevance we can achieve, along with strategy-proofness and Pareto efficiency when voters strategically invite collegues. We define a series of anonymity properties applicable to the diffusion mechanism design model, as well as parameterized voter-relevance properties for guaranteeing reasonably-fair decision making. We obtained two impossibility theorems and two existence theorems, which partially answer the question we have raised in the beginning of the paper |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2411_05574 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Parameterized Voter Relevance in Facility Location Games with Tree-Shaped Invitation Graphs Ando, Ryoto Kimura, Kei Todo, Taiki Yokoo, Makoto Computer Science and Game Theory Theoretical Economics Diffusion mechanism design, which investigate how to incentivise agents to invite as many colleagues to a multi-agent decision making as possible, is a new research paradigm at the intersection between microeconomics and computer science. In this paper we extend traditional facility location games into the model of diffusion mechanism design. Our objective is to completely understand to what extent of anonymity/voter-relevance we can achieve, along with strategy-proofness and Pareto efficiency when voters strategically invite collegues. We define a series of anonymity properties applicable to the diffusion mechanism design model, as well as parameterized voter-relevance properties for guaranteeing reasonably-fair decision making. We obtained two impossibility theorems and two existence theorems, which partially answer the question we have raised in the beginning of the paper |
| title | Parameterized Voter Relevance in Facility Location Games with Tree-Shaped Invitation Graphs |
| topic | Computer Science and Game Theory Theoretical Economics |
| url | https://arxiv.org/abs/2411.05574 |