paper-with-me

홈 › Papers

Solution Concepts in Hierarchical Games under Bounded Rationality with Applications to Autonomous Driving

2020-09-21 · Atrisha Sarkar, Krzysztof Czarnecki

With autonomous vehicles (AV) set to integrate further into regular human traffic, there is an increasing consensus on treating AV motion planning as a multi-agent problem. However, the traditional game-theoretic assumption of complete rationality is too strong for human driving, and there is a need for understanding human driving as a \emph{bounded rational} activity through a behavioural game-theoretic lens. To that end, we adapt four metamodels of bounded rational behaviour: three based on Quantal level-k and one based on Nash equilibrium with quantal errors. We formalize the different solution concepts that can be applied in the context of hierarchical games, a framework used in multi-agent motion planning, for the purpose of creating game theoretic models of driving behaviour. Furthermore, based on a contributed dataset of human driving at a busy urban intersection with a total of approximately 4k agents and 44k decision points, we evaluate the behaviour models on the basis of model fit to naturalistic data, as well as their predictive capacity. Our results suggest that among the behaviour models evaluated, at the level of maneuvers, modeling driving behaviour as an adaptation of the Quantal level-k model with level-0 behaviour modelled as pure rule-following provides the best fit to naturalistic driving behaviour. At the level of trajectories, bounds sampling of actions and a maxmax non-strategic models is the most accurate within the set of models in comparison. We also find a significant impact of situational factors on the performance of behaviour models.

📄 PDF Abstract BibTeX arXiv:2009.10033

Code (1)

https://git.uwaterloo.ca/a9sarkar/traffic_behavior_modeling 공식 구현

Tasks

4kAutonomous DrivingAutonomous VehiclesMotion Planning

Similar Papers 제목 키워드 기반

Tractable Equilibrium Computation in Markov Games through Risk Aversion

2024-06-20 · Eric Mazumdar, Kishan Panaganti, Laixi Shi

A significant roadblock to the development of principled multi-agent reinforcement learning is the fact that desired solution concepts like Nash equilibria may be intractable to compute. To overcome this obstacle, we tak…

Decision MakingMulti-agent Reinforcement Learningreinforcement-learningReinforcement Learning

A Unified Framework for Extensive-Form Game Abstraction with Bounds

2018-12-01 · NeurIPS 2018 12 · Christian Kroer, Tuomas Sandholm

Abstraction has long been a key component in the practical solving of large-scale extensive-form games. Despite this, abstraction remains poorly understood. There have been some recent theoretical results but they have b…

Form

Complexity and Algorithms for Exploiting Quantal Opponents in Large Two-Player Games

2020-09-30 · David Milec, Jakub Černý, Viliam Lisý, Bo An

Solution concepts of traditional game theory assume entirely rational players; therefore, their ability to exploit subrational opponents is limited. One type of subrationality that describes human behavior well is the qu…

counterfactual

Bounded Rationality Equilibrium Learning in Mean Field Games

2024-11-11 · Yannick Eich, Christian Fabian, Kai Cui, Heinz Koeppl

Mean field games (MFGs) tractably model behavior in large agent populations. The literature on learning MFG equilibria typically focuses on finding Nash equilibria (NE), which assume perfectly rational agents and are hen…

Imperfect-Recall Games: Equilibrium Concepts and Their Complexity

2024-06-23 · Emanuel Tewolde, Brian Hu Zhang, Caspar Oesterheld, Manolis Zampetakis 외

We investigate optimal decision making under imperfect recall, that is, when an agent forgets information it once held before. An example is the absentminded driver game, as well as team games in which the members have l…

Decision Making