Imagen de Portada

Tie-breaking Agnostic Lower Bound for Fictitious Play

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Wang, Yuanhao
Formato:	Preprint
Publicado:	2025
Materias:	Computer Science and Game Theory
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Zero-Sum Fictitious Play Cannot Converge to a Point
por: Moon, Jaehong
Publicado: (2026)

Team-Fictitious Play for Reaching Team-Nash Equilibrium in Multi-team Games
por: Donmez, Ahmed Said, et al.
Publicado: (2024)

Fictitious Play in Extensive-Form Games of Imperfect Information
por: Castiglione, Jason, et al.
Publicado: (2025)

Beyond Nash Equilibrium: Achieving Bayesian Perfect Equilibrium with Belief Update Fictitious Play
por: Ju, Qi, et al.
Publicado: (2024)

From First-Order to Second-Order Rationality: Advancing Game Convergence with Dynamic Weighted Fictitious Play
por: Ju, Qi, et al.
Publicado: (2024)

Fast and Furious Symmetric Learning in Zero-Sum Games: Gradient Descent as Fictitious Play
por: Lazarsfeld, John, et al.
Publicado: (2025)

Offline Fictitious Self-Play for Competitive Games
por: Chen, Jingxiao, et al.
Publicado: (2024)

Aggregate Fictitious Play for Learning in Anonymous Polymatrix Games (Extended Version)
por: Kara, Semih, et al.
Publicado: (2025)

Empirical Analysis of Fictitious Play for Nash Equilibrium Computation in Multiplayer Games
por: Ganzfried, Sam
Publicado: (2020)

Accelerating Nash Equilibrium Convergence in Monte Carlo Settings Through Counterfactual Value Based Fictitious Play
por: Qi, Ju, et al.
Publicado: (2023)

Lower Bound for Online MMS Assignment of Indivisible Chores
por: Seddighin, Masoud, et al.
Publicado: (2025)

A Lower Bound for Local Search Proportional Approval Voting
por: Kraiczy, Sonja, et al.
Publicado: (2024)

A Lower Bound on Swap Regret in Extensive-Form Games
por: Daskalakis, Constantinos, et al.
Publicado: (2024)

Robust Deep Monte Carlo Counterfactual Regret Minimization: Addressing Theoretical Risks in Neural Fictitious Self-Play
por: Jaafari, Zakaria El
Publicado: (2025)

Exponential Lower Bounds on the Double Oracle Algorithm in Zero-Sum Games
por: Zhang, Brian Hu, et al.
Publicado: (2024)

(Doubly) Exponential Lower Bounds for Follow the Regularized Leader in Potential Games
por: Anagnostides, Ioannis, et al.
Publicado: (2026)

Bad News for Couples: Tight Lower Bounds for Fair Division of Indivisible Items
por: la Tour, Max Dupré
Publicado: (2026)

Tarski Lower Bounds from Multi-Dimensional Herringbones
por: Brânzei, Simina, et al.
Publicado: (2025)

Weakly-Popular and Super-Popular Matchings with Ties and Their Connection to Stable Matchings
por: Csáji, Gergely, et al.
Publicado: (2023)

On Robust Popular Matchings with Tie-Bounded Preferences and Stable Matchings with Two-Sided Ties
por: De, Koustav
Publicado: (2025)

Tight Lower Bound for Multicolor Discrepancy
por: Manurangsi, Pasin, et al.
Publicado: (2025)

The Set of Stable Matchings and the Core in a Matching Market with Ties and Matroid Constraints
por: Kamiyama, Naoyuki
Publicado: (2024)

Tie-breaking in self interest cumulative subtraction games
por: Bhagat, Anjali, et al.
Publicado: (2025)

Computational Lower Bounds for Regret Minimization in Normal-Form Games
por: Anagnostides, Ioannis, et al.
Publicado: (2024)

Stable Matching with Ties: Approximation Ratios and Learning
por: Lin, Shiyun, et al.
Publicado: (2024)

Playing against a stationary opponent
por: Grand-Clément, Julien, et al.
Publicado: (2025)

Maximin Shares with Lower Quotas
por: Kinoshita, Hirota, et al.
Publicado: (2026)

On the Optimality of Dilated Entropy and Lower Bounds for Online Learning in Extensive-Form Games
por: Fan, Zhiyuan, et al.
Publicado: (2024)

Playing Stochastically in Weighted Timed Games to Emulate Memory
por: Monmege, Benjamin, et al.
Publicado: (2021)

Contracting With a Reinforcement Learning Agent by Playing Trick or Treat
por: Bollini, Matteo, et al.
Publicado: (2024)

Efficient Lower Bounding of Single Transferable Vote Election Margins
por: Blom, Michelle, et al.
Publicado: (2025)

Playing with Peaks: A Game-Theoretic Comparison of Electricity Pricing Mechanisms
por: Shah, Vade, et al.
Publicado: (2025)

Let Leaders Play Games: Improving Timing in Leader-based Consensus
por: M, Rasheed, et al.
Publicado: (2026)

Tight Regret Upper and Lower Bounds for Optimistic Hedge in Two-Player Zero-Sum Games
por: Tsuchiya, Taira
Publicado: (2025)

Optimal Capacity Modification for Stable Matchings with Ties
por: Ranjan, Keshav, et al.
Publicado: (2024)

Lower Bias, Higher Welfare: How Creator Competition Reshapes Bias-Variance Tradeoff in Recommendation Platforms?
por: Wang, Kang, et al.
Publicado: (2025)

Self-Play Q-learners Can Provably Collude in the Iterated Prisoner's Dilemma
por: Bertrand, Quentin, et al.
Publicado: (2023)

Tight Bounds for The Price of Fairness
por: Cao, Yifeng, et al.
Publicado: (2023)

A Quadratic Lower Bound for Stable Roommates Solvability
por: Rosenbaum, Will
Publicado: (2025)

Barter Exchange with Bounded Trading Cycles
por: Emek, Yuval, et al.
Publicado: (2024)