A simple, fast, and safe mediator for congestion management

3Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.

Abstract

Congestion is a severe problem in cities. A large population with little information about each other's preferences hardly reaches equilibrium and causes unexpected congestion. Controlling such congestion requires us to collect information dispersed in the market and to coordinate actions among agents. We aim to design a mediator that a) induces a game with high social welfare in equilibrium, b) computes an equilibrium efficiently, c) works without common prior, and d) performs well even when only some of the agents in the market use the mediator. We propose a mediator based on a version of best response dynamics (BRD). We prove that, in a simple setting with two resources, “good behavior” (reporting truthfully and following the recommendation) forms an (approximate) ex-post Nash equilibrium in the mediated game; in the equilibrium, the welfare is close to the first-best when preferences diverge enough. Furthermore, under a certain behavioral assumption, those who are not using the mediator can always enjoy non-negative payoff gain by joining it even without the full participation of others. Additionally, our experimental results suggest that such results remain valid for more general settings.

Cite

CITATION STYLE

APA

Ikegami, K., Okumura, K., & Yoshikawa, T. (2020). A simple, fast, and safe mediator for congestion management. In AAAI 2020 - 34th AAAI Conference on Artificial Intelligence (pp. 2030–2037). AAAI press. https://doi.org/10.1609/aaai.v34i02.5575

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free