Auction-based bidding among selfish local policies in a general-sum Markov game enables dynamic adaptation to evolving multi-objectives in reinforcement learning with Nash equilibrium guarantees.
Multi- objective reinforcement learning with max-min criterion: A game-theoretic approach.arXiv preprint arXiv:2510.20235
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Auction-Based Online Policy Adaptation for Evolving Objectives
Auction-based bidding among selfish local policies in a general-sum Markov game enables dynamic adaptation to evolving multi-objectives in reinforcement learning with Nash equilibrium guarantees.