Search arXivSearch

arXiv · 1911.02405

Liability Design for Autonomous Vehicles and Human-Driven Vehicles: A Hierarchical Game-Theoretic Approach

Abstract

Autonomous vehicles (AVs) are inevitably entering our lives with potential benefits for improved traffic safety, mobility, and accessibility. However, AVs' benefits also introduce a serious potential challenge, in the form of complex interactions with human-driven vehicles (HVs). The emergence of AVs introduces uncertainty in the behavior of human actors and in the impact of the AV manufacturer on autonomous driving design. This paper thus aims to investigate how AVs affect road safety and to design socially optimal liability rules for AVs and human drivers. A unified game is developed, including a Nash game between human drivers, a Stackelberg game between the AV manufacturer and HVs, and a Stackelberg game between the law maker and other users. We also establish the existence and uniqueness of the equilibrium of the game. The game is then simulated with numerical examples to investigate the emergence of human drivers' moral hazard, the AV manufacturer's role in traffic safety, and the law maker's role in liability design. Our findings demonstrate that human drivers could develop moral hazard if they perceive their road environment has become safer and an optimal liability rule design is crucial to improve social welfare with advanced transportation technologies. More generally, the game-theoretic model developed in this paper provides an analytical tool to assist policy-makers in AV policymaking and hopefully mitigate uncertainty in the existing regulation landscape about AV technologies.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Xuan Di, Xu Chen, Eric Talley. 2020-09-07. Liability Design for Autonomous Vehicles and Human-Driven Vehicles: A Hierarchical Game-Theoretic Approach. https://doi.org/10.1016/j.trc.2020.102710

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Learning in Structured Stackelberg Games

We initiate the study of structured Stackelberg games, a novel form of strategic interaction between a leader and a follower where contextual information can be predictive of the follower's (unknown) type. Motivated by applications such as security games and AI safety, we show how this additional structure can help the leader learn a utility-maximizing policy in both the online and distributional settings. In the online setting, we first prove that standard learning-theoretic measures of complexity do not characterize the difficulty of the leader's learning task. Notably, we find that there exists a learning-theoretic measure of complexity, analogous to the Littlestone dimension in online classification, that tightly characterizes the leader's instance-optimal regret. We term this the Stackelberg-Littlestone dimension, and leverage it to provide a provably optimal online learning algorithm. In the distributional setting, we provide analogous results by showing that two new dimensions control the sample complexity upper- and lower-bound.

cs.GT

Equilibrium and Infeasibility: A new solution concept for games

Addressing infeasibility in non-cooperative games has become an important topic, as many problems across different applications face this issue. In this paper, we propose a new solution concept for generalized games with possibly infeasible individual constraints. A solution is defined as the limit of a sequence of generalized Nash equilibria induced by games with penalty terms relaxing the individual constraints. Existence is established for a broad range of games and we provide conditions allowing to characterize a $ψ$-penalized solution as a strategy profile maximizing every player's utility over all her penalty minimizing strategies. A variation of Divide-the-Dollar serves as an illustrative example. We further establish the compatibility with the GNE and the solution to the Nash bargaining.

cs.GT

Subgame-Perfect Nash Equilibria of Plurality Voting with Abstention: a PSPACE-Completeness Result for Restricted Ballots

We consider sequential Plurality elections in which each voter may abstain or vote for a single candidate. Each voter assigns utilities to all candidates; for each voter, this induces a (weak) order over the candidates. Ties are resolved uniformly at random, and voting has a small positive cost, so that a voter prefers to abstain when their vote cannot change the election outcome. We consider a variant of this model where, for each voter, we additionally specify a prefix of her ranking, so that she is only allowed to vote for a candidate from that prefix (or abstain). We prove that for this variant of the model, deciding whether a designated candidate is among the election winners in a subgame-perfect equilibrium of the associated extensive-form game is PSPACE-complete. This partially resolves an open problem from the work of Desmedt and Elkind [2010].

cs.GT