A tie-breaking-agnostic 10-by-10 counterexample makes fictitious play converge at rate Ω(t^{-1/3}), disproving the weak form of Karlin's 1959 conjecture.
Frank-wolfe algorithms for saddle point problems
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.GT 1years
2025 1verdicts
REJECT 1roles
background 1polarities
support 1representative citing papers
citing papers explorer
-
Tie-breaking Agnostic Lower Bound for Fictitious Play
A tie-breaking-agnostic 10-by-10 counterexample makes fictitious play converge at rate Ω(t^{-1/3}), disproving the weak form of Karlin's 1959 conjecture.