:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autores principales:	McMahan, Jeremy, Wu, Young, Chen, Yudong, Zhu, Xiaojin, Xie, Qiaomin
Formato:	Preprint
Publicado:	2025
Materias:	Computer Science and Game Theory Machine Learning
Acceso en línea:	https://arxiv.org/abs/2503.03676
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Optimal Attack and Defense for Reinforcement Learning
por: McMahan, Jeremy, et al.
Publicado: (2023)

Inception: Efficiently Computable Misinformation Attacks on Markov Games
por: McMahan, Jeremy, et al.
Publicado: (2024)

Data Poisoning to Fake a Nash Equilibrium in Markov Games
por: Wu, Young, et al.
Publicado: (2023)

Minimally Modifying a Markov Game to Achieve Any Nash Equilibrium and Value
por: Wu, Young, et al.
Publicado: (2023)

Roping in Uncertainty: Robustness and Regularization in Markov Games
por: McMahan, Jeremy, et al.
Publicado: (2024)

Anytime-Constrained Equilibria in Polynomial Time
por: McMahan, Jeremy
Publicado: (2024)

Collaborative Mean Estimation Among Heterogeneous Strategic Agents: Individual Rationality, Fairness, and Truthful Contribution
por: Clinton, Alex, et al.
Publicado: (2024)

The Battling Influencers Game: Nash Equilibria Structure of a Potential Game and Implications to Value Alignment
por: Wu, Young, et al.
Publicado: (2025)

On Tractable $Φ$-Equilibria in Non-Concave Games
por: Cai, Yang, et al.
Publicado: (2024)

Nash Equilibria via Stochastic Eigendecomposition
por: Gemp, Ian
Publicado: (2024)

Learning and Computation of $Φ$-Equilibria at the Frontier of Tractability
por: Zhang, Brian Hu, et al.
Publicado: (2025)

Learnable Mixed Nash Equilibria are Collectively Rational
por: So, Geelon, et al.
Publicado: (2025)

Operator Splitting for Learning to Predict Equilibria in Convex Games
por: McKenzie, Daniel, et al.
Publicado: (2021)

Learning the Expected Core of Strictly Convex Stochastic Cooperative Games
por: Tran, Nam Phuong, et al.
Publicado: (2024)

Last-Iterate Convergence of No-Regret Learning for Equilibria in Bargaining Games
por: Kamp, Serafina, et al.
Publicado: (2025)

Swap Regret and Correlated Equilibria Beyond Normal-Form Games
por: Arunachaleswaran, Eshwar Ram, et al.
Publicado: (2025)

Market Games for Generative Models: Equilibria, Welfare, and Strategic Entry
por: Wei, Xiukun, et al.
Publicado: (2026)

Approximating Nash Equilibria in General-Sum Games via Meta-Learning
por: Sychrovský, David, et al.
Publicado: (2025)

Mechanism Design for Decentralized Risk Detection: Strict Propriety, Network Coalitions, and the Backfiring Mandat
por: Ni, Jian, et al.
Publicado: (2026)

Proximal Regret and Proximal Correlated Equilibria: A New Tractable Solution Concept for Online Learning and Games
por: Cai, Yang, et al.
Publicado: (2025)

Computing Pure-Strategy Nash Equilibria in a Two-Party Policy Competition: Existence and Algorithmic Approaches
por: Lin, Chuang-Chieh, et al.
Publicado: (2025)

Learning Local Stackelberg Equilibria from Repeated Interactions with a Learning Agent
por: Ananthakrishnan, Nivasini, et al.
Publicado: (2025)

Towards Performatively Stable Equilibria in Decision-Dependent Games for Arbitrary Data Distribution Maps
por: Zhong, Guangzheng, et al.
Publicado: (2025)

NashPG: A Policy Gradient Method with Iteratively Refined Regularization for Finding Nash Equilibria
por: Yu, Eason, et al.
Publicado: (2025)

Near-Optimal Quantum Algorithms for Computing (Coarse) Correlated Equilibria of General-Sum Games
por: Li, Tongyang, et al.
Publicado: (2025)

Optimal Correlated Equilibria in General-Sum Extensive-Form Games: Fixed-Parameter Algorithms, Hardness, and Two-Sided Column-Generation
por: Zhang, Brian, et al.
Publicado: (2022)

Regret Minimization and Convergence to Equilibria in General-sum Markov Games
por: Erez, Liad, et al.
Publicado: (2022)

Smooth Nash Equilibria: Algorithms and Complexity
por: Daskalakis, Constantinos, et al.
Publicado: (2023)

Nash Equilibria in Games with Playerwise Concave Coupling Constraints: Existence and Computation
por: Jordan, Philip, et al.
Publicado: (2025)

Small-Gain Nash: Certified Contraction to Nash Equilibria in Differentiable Games
por: Sharma, Vedansh
Publicado: (2025)

$\widetilde{O}(T^{-1})$ Convergence to (Coarse) Correlated Equilibria in Full-Information General-Sum Markov Games
por: Mao, Weichao, et al.
Publicado: (2024)

Online Bidding Algorithms with Strict Return on Spend (ROS) Constraint
por: Vaze, Rahul, et al.
Publicado: (2025)

Nearly-Optimal Bandit Learning in Stackelberg Games with Side Information
por: Balcan, Maria-Florina, et al.
Publicado: (2025)

Entry Barriers in Content Markets
por: Zhu, Haiqing, et al.
Publicado: (2025)

Independent Learning of Nash Equilibria in Partially Observable Markov Potential Games with Decoupled Dynamics
por: Jordan, Philip, et al.
Publicado: (2026)

Convex Markov Games and Beyond: New Proof of Existence, Characterization and Learning Algorithms for Nash Equilibria
por: Barakat, Anas, et al.
Publicado: (2026)

Optimal Scoring Rule Design under Partial Knowledge
por: Chen, Yiling, et al.
Publicado: (2021)

On the Universal Near Optimality of Hedge in Combinatorial Settings
por: Fan, Zhiyuan, et al.
Publicado: (2025)

$ε$-Optimally Solving Zero-Sum POSGs
por: Escudie, Erwan, et al.
Publicado: (2024)

Fair Transit Stop Placement: A Clustering Perspective and Beyond
por: Aziz, Haris, et al.
Publicado: (2026)