Metraipolis › archive › dc_de44ba698801

Signed Exposure: Fair Routing of Algorithmic Attention When Attention Can Harm — arXiv:2609.29513

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.29513
License (as archived)
CC0-1.0
Archived
2026-10-08T04:52:01.012Z
SHA-256 of the archived text
d77e58ee411c120cdfbf77c0e3ef020501374686184e69712c501c7b0ab11b4e
Stable URL of this page
https://metraipolis.com/documento/dc_de44ba698801

How to cite

Signed Exposure: Fair Routing of Algorithmic Attention When Attention Can Harm — arXiv:2609.29513 — arXiv (en), https://arxiv.org/abs/2609.29513 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_de44ba698801 (Metraipolis archive dc_de44ba698801, sha256 d77e58ee411c120cdfbf77c0e3ef020501374686184e69712c501c7b0ab11b4e)
BibTeX
@misc{dcde44ba698801,
  title = {Signed Exposure: Fair Routing of Algorithmic Attention When Attention Can Harm — arXiv:2609.29513},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.29513},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_de44ba698801; sha256 d77e58ee411c120cdfbf77c0e3ef020501374686184e69712c501c7b0ab11b4e},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.29513. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Fairness-of-exposure treats algorithmic attention as a good to be distributed equitably. But when an autonomous agent initiates contact, attention is signed: it delivers value to a willing receiver and imposes a burden on an unwilling one. We formalize routing under signed exposure and show that a fair distribution of attention need not be a fair distribution of unwanted attention. Our central result is an incompatibility: within signed-exposure routing, exposure parity (equal contact rates across groups) and burden parity (equal unwanted-contact rates) generically cannot hold at once, and the two are separated by a band that widens as routing grows more selective. A second result shows measurement error is itself a fairness mechanism: group-differential noise in receptivity scores simultaneously inflates a group's exposure and degrades whom it selects, so an apparent exposure-fairness gain is a hidden burden transfer. Calibrating to a public dating-platform survey (n=2,499) that, to our knowledge, uniquely measures receive-side receptivity to conversational agents, we find exposure parity costs only 0.2--2.3% of yield yet moves the per-capita burden ratio to 1.7 times: the tension is between fairness notions, not between fairness and efficiency. Finally, the burden-parity policy is computable by bisection and learnable online: a plug-in learner recovers it at a $2.3\%$ empirical regret premium. The operative design choice in signed-exposure markets is not efficiency versus fairness but which fairness.

Tema degli esploratori: governance digitale e beni comuni (retro-catalogo arXiv: annunci del 2026-09-25 in cs.CY).
Categorie arXiv: Computers and Society (cs.CY).
Pagina del lavoro: https://arxiv.org/abs/2609.29513 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-08T04:29:10.275Z dalla pagina https://arxiv.org/catchup/cs.CY/2026-09-25?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).