How Bad is Selfish Driving? Bounding the Inefficiency of Equilibria in Urban Driving Games

10/24/2022
by   Alessandro Zanardi, et al.
0

We consider the interaction among agents engaging in a driving task and we model it as general-sum game. This class of games exhibits a plurality of different equilibria posing the issue of equilibrium selection. While selecting the most efficient equilibrium (in term of social cost) is often impractical from a computational standpoint, in this work we study the (in)efficiency of any equilibrium players might agree to play. More specifically, we bound the equilibrium inefficiency by modeling driving games as particular type of congestion games over spatio-temporal resources. We obtain novel guarantees that refine existing bounds on the Price of Anarchy (PoA) as a function of problem-dependent game parameters. For instance, the relative trade-off between proximity costs and personal objectives such as comfort and progress. Although the obtained guarantees concern open-loop trajectories, we observe efficient equilibria even when agents employ closed-loop policies trained via decentralized multi-agent reinforcement learning.

READ FULL TEXT
research
05/13/2021

Emergent Prosociality in Multi-Agent Games Through Gifting

Coordination is often critical to forming prosocial behaviors – behavior...
research
02/11/2020

Inference-Based Strategy Alignment for General-Sum Differential Games

In many settings where multiple agents interact, the optimal choices for...
research
01/08/2022

Multi-Vehicle Control in Roundabouts using Decentralized Game-Theoretic Planning

Safe navigation in dense, urban driving environments remains an open pro...
research
10/04/2021

Inducing Equilibria via Incentives: Simultaneous Design-and-Play Finds Global Optima

To regulate a social system comprised of self-interested agents, economi...
research
03/16/2021

Tracking Truth by Weighting Proxies in Liquid Democracy

We study wisdom of the crowd effects in liquid democracy when agents are...
research
09/25/2021

Algorithmic Information Design in Multi-Player Games: Possibility and Limits in Singleton Congestion

Most algorithmic studies on multi-agent information design so far have f...
research
03/14/2022

Efficient Model-based Multi-agent Reinforcement Learning via Optimistic Equilibrium Computation

We consider model-based multi-agent reinforcement learning, where the en...

Please sign up or login with your details

Forgot password? Click here to reset