← Back to all news
arXiv Machine Learning By Qintong Xie, Edward Koh, Xavier Cadet, Peter Chin

DNQ: Deep Nash Q-Network for Partially Observable n-Player Games

Read the original on arXiv Machine Learning →

arXiv:2606. 06480v1 Announce Type: cross Abstract: Many real-world competitive systems require multiple decision-makers to act simultaneously under shared constraints, limited information, and repeated interaction, as in auctions, resource allocation, and security competition.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

Related stories

arXiv AI
Sep 18

Mitigating Retaliatory Algorithmic Collusion in Repeated Games

The paper introduces CURB, a reward‑shaping framework that penalizes the total variation distance between an agent’s action distributions under cooperation and defection histories, thereby preventing collusive equilibria in repeated games. By linking empirical Q‑learning collusion to Simple Penal Codes, the authors prove that any non‑trivial SPC can be neutralized, and demonstrate CURB’s effectiveness in both tabular and deep Q‑learning settings for Bertrand and Cournot competition.

By Karthik Sivachandran, Rohan Paleja
agentsreinforcement-learning
More like this →
arXiv Machine Learning
Aug 18

BRAID: Learning Equilibrium Maps in Interdependent Security Games via Weight-Tied Iterative Graph Neural Networks

arXiv:2608. 14856v1 Announce Type: cross Abstract: Computing Nash equilibria in interdependent security (IDS) games on networks is computationally expensive: best-response dynamics may need hundreds of iterations per instance, and downstream tasks such as auditing, stress-testing, and incentive design often require repeatedly re-solving the game under parameter perturbations.

By Elnaz Nowrouzi, Zhiqun Zuo, Xueru Zhang, Mohammad Mahdi Khalili
More like this →