Metraipolis › archive › dc_5fa81ef5222b
Competitive mediator games and urban CAV routing markets — arXiv:2608.09894
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.09894
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-19T06:49:38.253Z
- SHA-256 of the archived text
f2230cb563800fb0199faa960d96d2378305eb9455d68a3c463bd29b3df576de- Stable URL of this page
https://metraipolis.com/documento/dc_5fa81ef5222b
How to cite
Competitive mediator games and urban CAV routing markets — arXiv:2608.09894 — arXiv (en), https://arxiv.org/abs/2608.09894 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_5fa81ef5222b (Metraipolis archive dc_5fa81ef5222b, sha256 f2230cb563800fb0199faa960d96d2378305eb9455d68a3c463bd29b3df576de)
BibTeX
@misc{dc5fa81ef5222b,
title = {Competitive mediator games and urban CAV routing markets — arXiv:2608.09894},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.09894},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_5fa81ef5222b; sha256 f2230cb563800fb0199faa960d96d2378305eb9455d68a3c463bd29b3df576de},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.09894. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Inspired by possible future markets of autonomous routing and driving (ARAD), we introduce competitive mediator games and their equilibria which generalize the (coarse) correlated equilibria, which have become a popular research area recently as they not only can be more socially efficient than Nash equilibria but also are limits of algorithmic no-regret multi-agent learning dynamics. We discuss the basic properties of competitive mediator games and prove that in the generic setting of anonymous congestion(routing) games with market-share maximizing mediators all competitive mediator equilibria are monopolies whenever one of the mediators is weakly preferred to other mediators by all users. We apply and interpret these results in the context of new markets of competing ARAD service providers. We also provide a comprehensive overview of these markets and discuss the future mechanism design thereof. Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-08-11 in cs.MA). Categorie arXiv: Computer Science and Game Theory (cs.GT) ; Multiagent Systems (cs.MA); Theoretical Economics (econ.TH); Optimization and Control (math.OC). Pagina del lavoro: https://arxiv.org/abs/2608.09894 — 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-19T06:45:31.723Z dalla pagina https://arxiv.org/catchup/cs.MA/2026-08-11?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).