It's precisely the correct word. Prisoner's dilemma are simple, mathematically. This was one. OpenBSD defected. The joke's on the security researcher, though, since this doesn't appear to have been their first time [1][2].
Robert Axelrod outlined, in his 1984 classic The Evolution of Cooperation [3] four requirements for a successful iterative prisoner's dilemma strategy. One is retaliating. Security researchers are letting OpenBSD play an iterating game as if it's an N=1, i.e. they're not retaliating. Given the community is playing "always cooperate," OpenBSD's best move is actually "always defect".
[1] https://lwn.net/Articles/726585/ thank you 0x0 [a]
[2] https://lwn.net/Articles/726580/ thank you 0x0 [a]
[a] https://news.ycombinator.com/item?id=15481980
[1] https://en.wikipedia.org/wiki/The_Evolution_of_Cooperation
Real life is messier than any model.
https://www.quantamagazine.org/in-game-theory-no-clear-path-...
I'm mostly here just to correct misstatements of facts. You're welcome to your own interpretation, game theory optimization, etc.