TL;DR
This paper analyzes flashcard games, a family of discrete dynamical processes, proving key properties, settling a conjecture on card appearance frequency, and exploring generalizations and open questions.
Contribution
It proves a conjecture on card appearance frequency in flashcard games and introduces various generalizations and open problems.
Findings
Settled a conjecture on card appearance frequency.
Proved key properties of flashcard games.
Explored generalizations and posed open questions.
Abstract
We study a certain family of discrete dynamical processes introduced by Novikoff, Kleinberg and Strogatz that we call flashcard games. We prove a number of results on the evolution of these games, an in particular we settle a conjecture of NKS on the frequency with which a given card appears. We introduce a number of generalizations and variations that we believe are of interest, and provide a large number of open questions and problems.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.