GM strategies are not a Nash equilibrium in l-player exact slow NIM(n, n-1) for n, l >= 3: a refutation of Gurvich-Naumova Conjecture 1 (arXiv:2311.03257)

Myeongjin Kang

Abstract

Conjecture 1 fails for every n >= 3 and l >= 3 (ordinary block-invariant proof; Lean certifies (4,4,5)); a computed certificate at (5,5,6) shows no completion of the no-multiple convention rescues it; l = 2 is the GMMV23 theorem

AI-assisted research preprint. The scoped main statement has a Lean certificate. Internal AI review is not external journal peer review; bounded prior-art searches do not certify worldwide priority. See the paper for exact qualifications and formalization limits.

1

Supplementary files

  • proof-sources.json19.7 KBOpen
  • extract_sources.py481 BOpen

Comments

Submitted by Myeongjin Kang. Related MathDB problem 360653. Proof sources are attached as proof-sources.json (gzip-compressed, base64-encoded file contents); extract_sources.py reconstructs all archived files. Original archive SHA-256: e1f35146078b39a2ace25101b02806404f741adb7042e1376f77d7c09e359996.

Version history

Discussion 0