Clarification of `Algorithmic Collusion without Threats'
Fuente:
arXiv
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Preprint |
| Publicado: |
2026
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866911469423034368 |
|---|---|
| author | Hartline, Jason |
| author_facet | Hartline, Jason |
| contents | This brief note clarifies that the scenario described in Arunachaleswaran et al. (2025) -- titled `Algorithmic Collusion without Threats' -- is not one of collusion, but one where one player is behaving non-competitively and the other is behaving competitively. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2602_22232 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Clarification of `Algorithmic Collusion without Threats' Hartline, Jason Computer Science and Game Theory Theoretical Economics This brief note clarifies that the scenario described in Arunachaleswaran et al. (2025) -- titled `Algorithmic Collusion without Threats' -- is not one of collusion, but one where one player is behaving non-competitively and the other is behaving competitively. |
| title | Clarification of `Algorithmic Collusion without Threats' |
| topic | Computer Science and Game Theory Theoretical Economics |
| url | https://arxiv.org/abs/2602.22232 |