paper
DNQ: Deep Nash Q-Network for Partially Observable n-Player Games
paperactiveprovisional
dnq-deep-nash-q-network-for-partially-observable-n-player-games-afad764a·1 events·first seen 12d agoAliases: DNQ: Deep Nash Q-Network for Partially Observable n-Player Games
Co-occurring entities
More like this (12)
Double Q-learningGame-Theoretic EquilibriaMulti-Agent Reinforcement Learning from Delayed Marketplace Feedback for Objective-Weight Adaptation in Three-Sided DispatchRegret Minimization with Adaptive Opponents in Repeated GamesLearning Red Agent Policy from Observations for Neurosymbolic Autonomous Cyber AgentsSoft Q-LearningDNQQ-learningIterated Prisoner's DilemmaAgentopia: Long-Term Life Simulation and Learning in Agent SocietiesMulti-Turn Evaluation of Deep Research Agents Under Process-Level FeedbackNeural MMO
Recent events (1)
DNQ: Deep Nash Q-Network framework for equilibrium learning in multi-agent bidding games
Researchers propose DNQ (Deep Nash Q-Network), a solver-in-the-loop framework for training agents to reach Nash equilibria in partially observable n-player simultaneous bidding games. The method alternates between trajectory collection, critic-based payoff estimation, external equilibrium computation, and policy imitation via KL divergence minimization. A scalable pairwise payoff formulation is shown to outperform the exact N-player tensor approach in computational cost while maintaining strategic quality, with experiments demonstrating the trade-off between fidelity and scalability as agent count grows.